TY - GEN
T1 - Combined CAC and forced handoff for mobile network performability
AU - Aouled, Idriss Ismael
AU - Castel-Taleb, Hind
PY - 2012/6/18
Y1 - 2012/6/18
N2 - In mobile networks, call admission control (CAC) is widely used in reaching of the quality of service (QoS) requirements. However, as the CACs schemes give priority to the handoff calls, the blocking probability is degraded. In this paper we propose a new scheme which is based on the combinaison of CAC scheme and load sharing policy between a cluster of surrounding cells. Our scheme forces some calls to handover, with conditions, to neighboring cells in order to avoid the blocking states in the serving cell. Thus we prove, in the case of one cell, that our scheme permits to improve both the dropping and blocking probabilities. We use multidimensional's Markov chains to model the systems because of the consideration of occupation and failure/reparations of channels. Therefore, it is difficult to deduce intuitively the relevance of our scheme versus others in the literatures. So, we apply a mathematical method based on stochastic comparisons in other to prove that our scheme provides better performance measures. We illustrate these proofs by numerical results in order to show the relevance of our mechanism to improve QoS of mobile networks.
AB - In mobile networks, call admission control (CAC) is widely used in reaching of the quality of service (QoS) requirements. However, as the CACs schemes give priority to the handoff calls, the blocking probability is degraded. In this paper we propose a new scheme which is based on the combinaison of CAC scheme and load sharing policy between a cluster of surrounding cells. Our scheme forces some calls to handover, with conditions, to neighboring cells in order to avoid the blocking states in the serving cell. Thus we prove, in the case of one cell, that our scheme permits to improve both the dropping and blocking probabilities. We use multidimensional's Markov chains to model the systems because of the consideration of occupation and failure/reparations of channels. Therefore, it is difficult to deduce intuitively the relevance of our scheme versus others in the literatures. So, we apply a mathematical method based on stochastic comparisons in other to prove that our scheme provides better performance measures. We illustrate these proofs by numerical results in order to show the relevance of our mechanism to improve QoS of mobile networks.
KW - Handoff
KW - Load sharing
KW - Markov chains
KW - Performability
KW - QoS
KW - Stochastic comparisons
U2 - 10.1007/978-3-642-30782-9_6
DO - 10.1007/978-3-642-30782-9_6
M3 - Conference contribution
AN - SCOPUS:84862202830
SN - 9783642307812
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 76
EP - 90
BT - Analytical and Stochastic Modeling Techniques and Applications - 19th International Conference, ASMTA 2012, Proceedings
T2 - 19th International Conference on Analytical and Stochastic Modelling and Applications, ASMTA 2012
Y2 - 4 June 2012 through 6 June 2012
ER -