skip to main content
10.1145/1837856.1837874acmotherconferencesArticle/Chapter ViewAbstractPublication PagesqtnaConference Proceedingsconference-collections
research-article

On the (MAP1, MAP2)/(PH1, PH2)/N1+N2 retrial queue of wireless cellular networks with channel allocation

Published:24 July 2010Publication History

ABSTRACT

We consider that there are infinite positions in the orbit and N channels in the wireless cellular networks. For channel allocation, N1 (0 N1 < N) channels (guard channels) are reserved for handoff calls. It is assumed that handoff and new calls have different arrival rate of Markov Arrival Process (MAP), and their channel holding time distributions are different Phase-type (PH) distributions. Using matrix analytic techniques, we obtain the blocking probability of new calls and the dropping probability of handoff calls, the mean queue lengths of two types of calls. We give numerical results to show input of different handoff call arrival rate on performance measures.

References

  1. G. Choudhury, "Steady state analysis of an M/G/1 queue with linear retrial policy and two phase service under Bernoulli vacation schedule," Applied Mathematical Modelling, vol. 32, no. 12, pp. 2480--2489, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  2. N. P. Sherman, J. P. Kharoufeh, "An M/M/1 retrial queue with unreliable server," Operations Research Letters, vol. 34, no. 6, pp. 697--705, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. C. Ke, F. M. Chang, "Modified vacation policy for M/G/1 retrial queue with balking and feedback," Computers &amp; Industrial Engineering, vol. 57, no. 1, pp. 433--443, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. A. Hassan, S. I. Rabia, F. A. Taboly, "Performance evaluation of a discrete-time Geo{X}/G/1 retrial queue with general retrial times," Computers &amp; Mathematics with Applications, vol. 58, no. 3, pp. 548--557, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Kim, V. I. Klimenok, D. S. Orlovsky, "The BMAP/PH/N retrial queue with Markovian flow of breakdowns," European Journal of Operational Research, vol. 189, no. 3, pp. 1057--1072, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  6. J. R. Artalejo and S. R. Chakravarthy, "Computational analysis of the maximal queue length in the MAP/M/c retrial queue," Applied Mathematics and Computation, vol. 183, no. 2, pp. 1399--1409, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  7. S. Louvros, J. Pylarinos and S. Kotsopoulos, "Handoff multiple queue model in microcellular networks," Computer Communications, vol. 30, no. 2, pp. 396--403, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. P. Chung, S. C. Chien, "Analysis of multiservice cellular networks with asymmetrical traffic and handoff queue," Computer Communications, vol. 28, no. 8, pp. 864--879, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. H. Kang and D. K. Sung, "Two-state MMPP modeling of ATM superposed traffic streams based on the characterization of correlated interarrival times," in Conference Record / IEEE Global Telecommunications Conference, Taejon, Korea, 1422--1426, 1995.Google ScholarGoogle Scholar
  10. B. D. Choi and Y. Chang, "MAPI, MAP2/M/c retrial queue with the retrial group of finite capacity and geometric loss," Mathematical and Computer Modelling, vol. 30, no. 3--4, pp. 99--113, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. F. Neuts, Matrix-Geometric solutions in stochastic models. The Johns Hopkins University Press, 1981.Google ScholarGoogle Scholar

Index Terms

  1. On the (MAP1, MAP2)/(PH1, PH2)/N1+N2 retrial queue of wireless cellular networks with channel allocation

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        QTNA '10: Proceedings of the 5th International Conference on Queueing Theory and Network Applications
        July 2010
        213 pages
        ISBN:9781450302128
        DOI:10.1145/1837856

        Copyright © 2010 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 24 July 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
      • Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader