Fair-efficient call admission control policies for broadband networks—a game theoretic framework
IEEE/ACM Transactions on Networking (TON)
ATM network design and optimization: a multirate loss network framework
IEEE/ACM Transactions on Networking (TON)
Wireless Networks - Special issue on performance evaluation methods for wireless networks
IEEE/ACM Transactions on Networking (TON)
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
IEEE/ACM Transactions on Networking (TON)
Integration of Pricing with Call Admission Control to Meet QoS Requirements in Cellular Networks
IEEE Transactions on Parallel and Distributed Systems
QoS Over Heterogeneous Networks
QoS Over Heterogeneous Networks
vertical QOS mapping over wireless interfaces
IEEE Wireless Communications
Performance analysis of cellular mobile communication systems with dynamic channel assignment
IEEE Journal on Selected Areas in Communications
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
Admission control in data transfers over lightpaths
IEEE Journal on Selected Areas in Communications - Part Supplement
Statistical multiplexing of multiple time-scale Markov streams
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Optimality conditions for Call Admission Control (CAC) problems with nonlinearly constrained feasibility regions and K classes of users are derived. The adopted model is a generalized stochastic knapsack, with exponentially distributed interarrival times of the objects. Call admission strategies are restricted to the family of Coordinate-Convex (CC) policies. For K = 2 classes of users, both general structural properties of the optimal CC policies and structural properties that depend on the revenue ratio are investigated. Then, the analysis is extended to the case K 2. The theoretical results are exploited to narrow the set of admissible solutions to the associated knapsack problem, i.e., the set of CC policies to which an optimal one belongs. With respect to results available in the literature, less restrictive conditions on the optimality of the complete-sharing policy are obtained. To illustrate the role played by the theoretical results on the combinatorial CAC problem, simulation results are presented, which show how the number of candidate optimal CC policies dramatically decreases as the derived optimality conditions are imposed.