Abstract
In [1], a learning automata (LA) based call admission policy is given which accepts new calls as long as the pre-specified level of QoS is maintained. The simulation results show that this policy cannot maintain the upper bound on the level of QoS. In this paper, we propose a new LA based algorithm in which a LA is used to accept/reject new calls. This algorithm can be considered as an adaptive version of uniform fractional guard channel policy. In order to study the performance of the proposed call admission policy, computer simulations are conducted. The simulation results show that the level of QoS is satisfied by the proposed algorithm and the performance of given algorithm is very close to the performance of uniform fractional guard channel policy which needs to know all parameters of input traffic. Unlike the uniform fractional guard channel policy, the proposed policy is fully adaptive and doesn’t require any information about the input traffics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beigy, H., Meybodi, M.R.: Call Admission Control in Cellular Mobile Networks: A Learning Automata Approach. In: Shafazand, H., Tjoa, A.M. (eds.) EurAsia-ICT 2002. LNCS, vol. 2510, pp. 450–457. Springer, Heidelberg (2002)
Ramjee, R., Towsley, D., Nagarajan, R.: On Optimal Call Admission Control in Cellular Networks. Wireless Networks 3, 29–41 (1997)
Hong, D., Rappaport, S.: Traffic Modelling and Performance Analysis for Cellular Mobile Radio Telephone Systems with Priotrized and Nonpriotorized Handoffs Procedure. IEEE Transactions on Vehicular Technology 35, 77–92 (1986)
Haring, G., Marie, R., Puigjaner, R., Trivedi, K.: Loss Formulas and Their Application to Optimization for Cellular Networks. IEEE Transactions on Vehicular Technology 50, 664–673 (2001)
Beigy, H., Meybodi, M.R.: Uniform Fractional Guard Channel. In: Proceedings of Sixth World Multiconference on Systemmics, Cybernetics and Informatics, Orlando, USA (July 2002)
Beigy, H., Meybodi, M.R.: An Adaptive Uniform Fractional Guard Channel Algorithm: A Learning Automata Approach. Tech. Rep. TR-CE-2002-006, Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beigy, H., Meybodi, M.R. (2003). An Adaptive Uniform Fractional Guard Channel Algorithm: A Learning Automata Approach. In: Liu, J., Cheung, Ym., Yin, H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45080-1_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-45080-1_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40550-4
Online ISBN: 978-3-540-45080-1
eBook Packages: Springer Book Archive