Network capacity region of multi-queue multi-server queueing system with random ON-OFF connectivities and stationary arrival processes is derived in this paper. Specifically, the necessary and sufficient conditions for the stability of the system are derived under general arrival processes with finite first and second moments. In the case of stationary arrival processes, these conditions establish the network capacity region of the system. It is also shown that AS/LCQ (Any Server/Longest Connected Queue) policy stabilizes the system when it is stabilizable. Furthermore, an upper bound for the average queue occupancy is derived for this policy.
In this paper, we characterize the network stability region (capacity region) of multi-queue multiserver (MQMS) queueing systems with stationary channel distribution and stationary arrival processes.The stability region is specified by a finite set of linear inequalities. We first show that the stability region is a polytope characterized by the finite set of its facet defining hyperplanes. We explicitly determine the coefficients of the linear inequalities describing the facet defining hyperplanes of the stability region polytope. We further derive the necessary and sufficient conditions for the stability of the system for general arrival processes with finite first and second moments. For the case of stationary arrival processes, the derived conditions characterize the system stability region. Furthermore, we obtain an upper bound for the average queueing delay of Maximum Weight (MW) server allocation policy which has been shown in the literature to be a throughput optimal policy for MQMS systems. Using a similar approach, we can characterize the stability region for a fluid model MQMS system. However, the stability region of the fluid model system is described by an infinite number of linear inequalities since in this case the stability region is a convex surface. We present an example where we show that in some cases depending on the channel distribution, the stability region can be characterized by a finite set of non-linear inequalities instead of an infinite number of linear inequalities.
In 4G cellular networks, call admission control (CAC) has a direct impact on quality of service (QoS) for individual connections and overall system efficiency. Reservation-based CAC schemes have been previously proposed for cellular networks where a certain amount of system bandwidth is reserved for high-priority calls, e.g., hand-off calls and real-time new calls. Traditional reservation-based schemes are not efficient for 4G vehicular networks, as the reserved bandwidth may not be utilized effectively in low hand-off rates. We propose a channel borrowing approach in which new best effort (BE) calls can borrow the reserved bandwidth for high-priority calls. Later, if a hand-off call arrives and all the channels are busy, it will pre-empt the service of a borrower BE call if there exists any. The pre-empted BE calls are kept in a queue and resume their service whenever a channel becomes available. The analytical model for this scheme is a mixed loss-queueing system for which it is difficult to calculate call blocking probability (CBP) and call dropping probability (CDP). Our focus in this paper is on the system modeling and performance evaluation of the proposed scheme. We present two system models that approximate the operation of the proposed scheme. For these models, we derive the CBP and CDP analytically. It is shown that our analytical results are very close to the ones obtained from simulations. Furthermore, it is observed that our channel borrowing approach decreases the CBP considerably while increases the CDP slightly over a large range of hand-off rates.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.