Near-optimal channel reservation for cellular phone system
by Cheng-Yuan Ku, Shi-Ming Huang, David C. Yen, Yi-Wen Chen
International Journal of Electronic Business (IJEB), Vol. 2, No. 3, 2004

Abstract: In this paper, optimal management of requests for channel usage in a cellular system is formulated as an access control problem for a multi-server-loss-queue network. Using an inductive approach of dynamic programming, the optimal channel reservation policy is induced to be functions of the number of ongoing cellular calls in each cell. However, the scale of cellular networks is generally very large. So, the computational burden of finding an optimal policy may be too heavy due to its involvement with the states for all cells in the network. Hence, the idea of bottleneck modelling and aggregation method in stochastic process is used to downsize the system and find a near-optimal channel reservation policy. Focusing on the target cell, we first reduce the scale of loss-queue network to a seven-cell model with the compensation of system parameters. Furthermore, an aggregation method is proposed to further reduce the seven-cell model to a two-queue system. Numerical results show that the near-optimal control policy based on the reduced two-queue model demonstrates close performance to the optimal reservation policy.

Online publication date: Sat, 04-Sep-2004

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Business (IJEB):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email