Number Of Busy Channels Research Articles

Multiplay Multiarmed Bandit Algorithm Based Sensing of Noncontiguous Wideband Spectrum for AIoT Networks

To bring large-scale AIoT to reality, wireless networks need intelligence to identify resources in a non-contiguous spectrum. We address this challenge via a sub-Nyquist sampling-based wideband spectrum analyzer deployed in AIoT gateway. The non-contiguous nature demands learning the channel occupancy. However, the identification of channel status can fail when the number of busy channels in a selected subset is higher than the number of ADCs, K. We model this subset selection problem as Multi-Play Multi-Armed Bandit. First, we demonstrate the learnability of such a problem via a learning algorithm with a subset size of K (no sensing failure). For wideband sparse spectrum, we extend this algorithm using a novel subset size estimation approach to identify the optimal subset that gives the best possible throughput and could have a size potentially larger than K. These algorithms are mapped on the system-on-chip, and their in-depth performance analysis demonstrates their superiority over state-of-the-art.

Mathematical Models and Methods for Analyzing Computer Control Networks of Railway Power Supply

Methods for innovative transformation of railway power supply systems are analyzed. It is shown that modern intelligent power networks represent a new quality of a mutually integrated architecture of a distributed computer environment for the control of power supply and the topology of a traction power network, which are oriented towards the accumulation of new knowledge and optimization of energy resources. To synthesize mathematical models for investigating intelligent systems, a graph of a distributed computer environment is proposed, which adequately reflects the topology of a railway power grid. The paper also proposes a differential mathematical model of a distributed computer environment of intellectualization of procedures for all-mode control of power supply and methods for determining the probabilities of states of nodes, throughput, number of busy channels, and number of failures of requests for service.

Numerical Analysis of a Queueing System with Feedback

A mathematical model of the multichannel queueing system with feedback is proposed. The feedback occurs as returning a part of serviced calls to get a new service. The probability of returning to orbit depends on the number of busy channels. Both models with finite and infinite orbits are examined. Both exact and approximate methods to calculate characteristics of the system are developed. The results of numerical experiments are given.

INDIVIDUAL EQUILIBRIUM DYNAMIC ROUTING IN A MULTIPLE SERVER RETRIAL QUEUE

Customers arrive sequentially to a service system where the arrival times form a Poisson process of rate λ. The system offers a choice between a private channel and a public set of channels. The transmission rate at each of the public channels is faster than that of the private one; however, if all of the public channels are occupied, then a customer who commits itself to using one of them attempts to connect after exponential periods of time with mean μ−1. Once connection to a public channel has been made, service is completed after an exponential period of time, with mean ν−1. Each customer chooses one of the two service options, basing its decision on the number of busy channels and reapplying customers, with the aim of minimizing its own expected sojourn time. The best action for an individual customer depends on the actions taken by subsequent arriving customers. We establish the existence of a unique symmetric Nash equilibrium policy and show that its structure is characterized by a set of threshold-type strategies; we discuss the relevance of this concept in the context of a dynamic learning scenario.

Cutoff priority scheduling in mobile cellular communication systems

A mobile cellular communication system is considered. The calls arriving at the base station of each cell are modeled by a queueing system with two arrival streams. Stream 1 (also called class 1) arrivals are those calls in progress that are handed over to the cell from other cells, and class a arrivals are those calls that are originating in the cell. The guard channel scheme is considered in which arriving calls are indiscriminately assigned channels within a cell as long as the number of busy channels in the cell is below a predefined threshold. When this number reaches the threshold, only arriving class 1 calls are assigned channels immediately; arriving class 2 calls are queued. When all the channels are busy, then arriving class 1 calls are lost while class 2 calls continue to be queued. The system is analysed by a generating function method which utilizes the structure of the model to give a very concise solution.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

The moments of the extended compound point process with applications

The Concept of Compound point(or counting)process is generalized to account for situations in which the compound events are described by a stochastic process rather than a random variable. Quasi–closed form expressions for the mean and the variance of this extended compounded point process are obtained in terms of the first two moments of the underlying point process and of the process describing the compound events. An expression for the higher moments is also obtained. The results are applied to obtain the mean and variance of the number of busy channels in a ppx/G/∞ queue. (PP=point process) which generalises results of the M(t)x/G/∞ and GIx/G/∞ queue. Other applications include the derivation of the first two moments of the total backlog and of the revenues from telephone traffic in a PP/G/∞ queue. Finally, a special empirical model is considered

Bounds on the stability of the stationary distribution of the number of busy channels in the system GI�GI�?

Bounds on the stability of the stationary distribution of the number of busy channels in the system GI�GI�?

Infinite Channel Queueing System with Controlled Input

We study a queueing model of type G⃗/M/∞ with a nonrecurrent input. The intensity of the input stream is regulated at epochs of successive starts of customers moving from the source to the system, and it is dependent on the number of busy channels. We consider three groups of channels. Such a division is connected with different expenditures of servicing within each of the groups. It is worthwhile to control the input rate in order to minimize the long-run average cost. The basic process is the number of busy channels. We derive its limiting distribution explicitly by introducing an auxiliary two-dimensional Markov process and treating the corresponding Kolmogorov system of differential equations. We also use some properties of semiregenerative processes. The limiting distributions are used to solve an optimization problem.

On a multi-channel transportation loss system with controlled input and controlled service

A multi-channel loss queueing system is investigated. The input stream is a controlled point process. The service in each of m parallel channels depends on the state of the system at certain moments of time when input and service may be controlled. To obtain explicitly the limiting distribution of the main process (Zt) (the number of busy channels) in equilibrium, an auxiliary three dimensional process with two additional components (one of them is a semi-Markov process) is treated as semi-regenerative process. An optimization problem is discussed. Simple expressions for an objective function are derived.

Analytically Explicit Results for the Queueing System M/Mx/C with Charts and Tables for Certain Measures of Efficiency

Considering through time the multichannel bulk-service queue M/Mx/C. Ghare obtained the steady-state joint distribution of the number in the queue and the number of busy channels. This paper extends Ghare's analytical results by developing expressions for the measures of efficiency and delay distributions. and provides computer tabulations and charts of the measures of efficiency.

Erlang's formula and some results on the departure process for a loss system

The present paper investigates the limiting distribution of the number of busy channels (queue size) and the remaining lengths of holding times at an epoch of departure for a loss system with general holding times and exponentially distributed interarrival times. Further, it is established that for this loss system in the limit an interdeparture interval length is independent of the queue size at the end of the interval and is distributed according to an exponential distribution with mean λ–1. It is also seen that in the limit interdeparture times are mutually independent.