Queuing models for cellular networks with generalised Erlang service distributions

• Autorzy: Jayasuriya A.
• Języki publikacji: EN

Abstrakty

EN

Providing seamless handover is one of the major problems in mobile communication environments. Careful dimensioning of the network and the underlying teletraffic analysis plays a major role in determining the various grade of services (GoSs) that can be provided at various network loads for handover users. It has been shown that the channel holding time of a cell, one of the important parameters in any teletraffic analysis, can be accurately modelled by Erlang distributions. This paper focuses on solving queuing systems with generalised Erlang service distributions and exponential arrival distributions. We present the quasi-birth-death (QBD) process, which characterises the queuing models with generalised Erlang service and exponential interarrival distributions. We then use the properties of Erlang distributions and characteristics of channel allocation process of cellular networks to simplify the queues used to model cellular networks. The use of these simplifications provide a significant reduction in computation time required to solve these QBDs.

Słowa kluczowe

EN

cellular networks; phase type distributions; generalised Erlang

PL

sieci komórkowe

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2003
• Tom: nr 2
• Strony: 55--61
• Opis fizyczny: Bibliogr. 10 poz., tab., rys.

Twórcy

autor

Jayasuriya A.

• Institute for Telecommunications Research, University of South Australia, Mawson Lakes, SA 5095, Australia,

Bibliografia

• [1] E. D. Re, R. Fantacci, and G. Giamabene, “Handover and dynamic channel allocation techniques in mobile cellular networks”, IEEE Trans. Veh. Techn., vol. 44, no. 2, pp. 397–405, 1995.
• [2] A. Jayasuriya, J. Asenstorfer, and D. Green, “Modelling service time distributions in cellular networks using phase-type service distributions”, in Proc. Int. Conf. Commun., Helsinki, Finland, June 2001, vol. 2, pp. 440–444.
• [3] A. Jayasuriya, “Improved handover performance through mobility predictions”. Ph.D. thesis, University of South Australia, 2001; URL – http://www.itr.unisa.edu.au/aruna/papers/thesis.pdf
• [4] S. Asmussen, O. Nerman, and M. Olsson, “Fitting phase-type distributions via the EM algorithm”, Scand. J. Stat., vol. 23, pp. 419–441, 1996.
• [5] M. Neuts, Matrix-Geometric Solutions in Stochastic Models. John Hopkins, 1981.
• [6] V. Naoumov, U. Krieger, and D. Wagner, “Analysis of a multiserver delay-loss system with a general Markovian arrival process”, in Proc. 1st Int. Conf. Matrix-Analyt. Meth. (MAM) Stoch. Mod., Flint, USA, Aug. 1995, pp. 44–66.
• [7] C. Meyer, “Stochastic complementation, uncoupling Markov chains and the theory of nearly reducible systems”, SIAM Rev., vol. 31, no. 2, pp. 240–272, 1989.
• [8] A. Jayasuriya and K. Dogancay, “Stochastic complementation applied to the analysis of blocking probabilities in cellular networks”, in Proc. IASTED Int. Conf., Wirel. & Opt. Commun., Banff, Alberta, Canada, July 2002, pp. 607–610.
• [9] P. Orlik and S. Rappaport, “A model for teletraffic performance and channel holding time characterization in wireless cellular communication with general session and dwell time distributions”, IEEE J. Selec. Areas Commun., vol. 16, pp. 788–803, 1998.
• [10] Y. Fang and I. Chlamtac, “Teletraffic analysis and mobility modelling of PCS networks”, IEEE Trans. Commun., vol. 47, pp. 1062–1072, 1999