Data networks
Queueing networks—exact computational algorithms: a unified theory based on decomposition and aggregation
Computational complexity of loss networks
Theoretical Computer Science - Special issue on probabilistic modelling
Wireless Networks - Special issue on performance evaluation methods for wireless networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Wireless Networks - Special issue on performance evaluation methods for wireless networks
Alignment Properties in Ordinal Comparison of DiscreteEvent Dynamic Systems
Discrete Event Dynamic Systems
Generalized surrogate problem methodology for online stochastic discrete optimization
Journal of Optimization Theory and Applications
Capacity Analysis for Connection Admission Control in IndoorMultimedia CDMA Wireless Communications
Wireless Personal Communications: An International Journal
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Hi-index | 0.00 |
In this paper, we investigate the admission-control problem for voice traffic in fixed-route circuit-switched wireless networks. We consider coordinate-convex admission-control policies and a “blocked-calls-cleared” mode of operation, in conjunction with the usual assumptions on the voice process statistics. These conditions result in a product-form stationary distribution for the voice state of the system, which facilitates the evaluation of network performance. However, to determine the optimal policy a large state space must be searched. We develop a recursive procedure to accelerate the evaluation of a large number of different admission-control policies, and a descent-search method to reduce significantly the number of policies that must be evaluated in searching for the optimal one. The numerical examples we present indicate that reduced blocking probability (or increased throughput) can be obtained by administering active admission control. The degree of improvement is highest in moderately overloaded traffic conditions, but it is typically small in low-capacity networks (at all loads). However, in applications where the performance measure associates different revenues or costs with the various call types, considerable improvement can be obtained when admission control is used.