The paper is dedicated to the design problem of a wireless communication network. The problem of base stations optimal placement along a linear section subject to control with end-to-end delay limited is formulated. The goal is to maximize the coverage area that comes to under the control of multiple deployed base stations while respecting technological conditions and budget constraints. In the paper, the features of the technological statement are analyzed. The formulation of the problem in the form of integer linear programming is proposed. When forming a mathematical model, a queuing network model with a Poisson arrival process is used.

The article discusses a multiphase queuing system with a recurrent incoming flow, storage units of unlimited capacity, and recurrent service times at its nodes. To analyze and evaluate the main parameters of the performance of this network, a new approach is presented, which consists in combining simulation with data mining methods. This approach is universal in nature, and its area of application is not limited to studies of tandem networks only, but, on the contrary, extends to any other networks of arbitrary topology, as well as to queuing systems with various combinations of its main components. To assess the quality of the characteristics obtained, namely the average end-to-end delay, a comparative analysis is carried out with the known approximate results obtained in earlier works.

In the light of the proliferation of the Internet of Things (IoT), the device-to-device (D2D) communication is becoming a promising technology and a key enabler for enhancing the energy efficiency of the wireless network environment and reducing the traffic latency between user equipments (UEs) within their communication range. This papers considers one simplified analytical framework for modeling of communication offloading scenario within the D2D communications underlying cellular network, in which a UE generates a session toward another UE in the same cell. The model aims to improve the system capacity and energy-efficiency by offloading cellular traffic onto D2D communications, when the source and destination UEs are proximate enough to satisfy their QoS requirements.

The problem of sensitivity of a redundant system’s probability characteristics to shapes of the input distributions is considered. In some previous works, closed-form representations have been obtained for stationary characteristics of hot-standby redundant systems with exponential lifetime distribution of their elements and general distribution of their repair time. In the current paper we carry out the sensitivity analysis of a k-out-of −n :F system with the help of a simulation approach. Comparison of analytic and simulation results is presented.

In this paper we study the problem of optimal controlling in a processor sharing (PS) M/M/2 queueing system with heterogeneous servers. The servers differ in the service intensities, operating and usage costs. The objective is to find the optimal policy to allocate the customers either to an idle or partially loaded server, or to the queue at each arrival and service completion epoch to minimize the long-run average cost per unit of time. We handle this optimization problem as Markov decision problem and study numerically structural properties of the optimal control policy. Using a policy-iteration algorithm we show that this policy for the current model is of threshold type. In this case the faster server handles customers with maximum capacity, while the number of simultaneously serviced customers at the slower server can be increased only when the number of waiting customers exceeds a certain threshold level. The data-sets generated by classic methodology of analyzing the controlled queues are used to explore predictions for optimal thresholds through artificial neural networks. The presented theoretical results are accompanied by heuristic solution and numerical examples.