Stochastic modelling and analysis: a computational approach
Stochastic modelling and analysis: a computational approach
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
New call blocking versus handoff blocking in cellular networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
On optimal call admission control in cellular networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Real-time prioritized call admission control in a base station scheduler
WOWMOM '00 Proceedings of the 3rd ACM international workshop on Wireless mobile multimedia
International Journal of Mobile Communications
Efficient structured policies for admission control in heterogeneous wireless networks
Mobile Networks and Applications
Optimal admission control policies for heterogeneous wireless networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
A call admission control scheme using neuroevolution algorithm in cellular networks
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Determination of optimal call admission control policy in wireless networks
IEEE Transactions on Wireless Communications
Expert Systems with Applications: An International Journal
Bandwidth degradation QoS provisioning for adaptive multimedia in wireless/mobile networks
Computer Communications
| Hi-index | 0.00 |
It is well known that the call admission policy can have a big impact on the performance of a wireless network. However, the nonlinear dependence of new calls and handoff calls makes the search for a better call admission policy – in terms of effective utilization – a difficult task. Many studies on optimal policies have not taken the correct dependence into consideration. As a result, the reported gains in those studies cannot be confirmed in a real network. In this paper we develop a solution to the problem of finding better call admission policies. The technique consists of three components. First, we search for the policy in an approximate reduced-complexity model. Second, we modify the Linear Programming technique for the inherently nonlinear policy-search problem. Third, we verify the performance of the found policy in the exact, high-complexity, analytical model. The results shown in the paper clearly demonstrate the effectiveness of the proposed technique.