An adaptive uniform fractional guard channel algorithm: A learning automata approach

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. © Springer-Verlag 2003.