IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v48y2000i1p38-49.html
   My bibliography  Save this article

On a Queueing Network Model for Cellular Mobile Telecommunications Networks

Author

Listed:
  • Richard J. Boucherie

    (Department of Econometrics, Universiteit van Amsterdam, Roetersstraat 11, 1018 WB Amsterdam, The Netherlands)

  • Nico M. van Dijk

    (Department of Econometrics, Universiteit van Amsterdam, Roetersstraat 11, 1018 WB Amsterdam, The Netherlands)

Abstract

This paper presents a queueing network description of a cellular mobile communications network. These cellular networks are characterised by the call lengths, the fresh call arrival rate, and the handover rates, as well as the capacity restrictions on the number of calls because of limited bandwidth. In the resulting queueing network the routing probabilities depend on the age of the customers. This queueing network is amenable to analysis via known methods. In particular, insensitivity results are generalised to also include capacity restrictions under age-dependent routing and to include call holding time distributions of customers moving from one queue to another.

Suggested Citation

  • Richard J. Boucherie & Nico M. van Dijk, 2000. "On a Queueing Network Model for Cellular Mobile Telecommunications Networks," Operations Research, INFORMS, vol. 48(1), pages 38-49, February.
    • Handle: RePEc:inm:oropre:v:48:y:2000:i:1:p:38-49
    DOI: 10.1287/opre.48.1.38.12446
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.48.1.38.12446
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.48.1.38.12446?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. D. L. Pallant & P. G. Taylor, 1995. "Modeling Handovers in Cellular Mobile Networks with Dynamic Channel Allocation," Operations Research, INFORMS, vol. 43(1), pages 33-42, February.
    2. Hordijk, A. & Schassberger, R., 1982. "Weak convergence for generalized semi-Markov processes," Stochastic Processes and their Applications, Elsevier, vol. 12(3), pages 271-291, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ule, Aljaz & Boucherie, Richard J., 2003. "On the distribution of calls in a wireless network driven by fluid traffic," European Journal of Operational Research, Elsevier, vol. 147(1), pages 146-155, May.
    2. Balsamo, Simonetta & Marin, Andrea, 2013. "Separable solutions for Markov processes in random environments," European Journal of Operational Research, Elsevier, vol. 229(2), pages 391-403.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dijk, N.M. van, 1988. "A LCFS finite buffer model with batch input and non-exponential services," Serie Research Memoranda 0007, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    2. Dijk, N.M. van, 1988. "Error bounds for comparing open and closed queueing networks with an application to performability analysis," Serie Research Memoranda 0056, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    3. Dijk, N.M. van, 1987. "A LCFS finite buffer model with finite source batch input," Serie Research Memoranda 0049, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    4. Dijk, N.M. van, 1989. "An equivalence of communication protocols for interconnection networks," Serie Research Memoranda 0034, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    5. Dijk, N.M. van, 1991. "Product forms for metropolitan area networks," Serie Research Memoranda 0007, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    6. Nico Dijk, 2005. "On product form tandem structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 429-436, December.
    7. Nico Dijk & Barteld Schilstra, 2022. "On two product form modifications for finite overflow systems," Annals of Operations Research, Springer, vol. 310(2), pages 519-549, March.
    8. Dijk, N.M. van, 1989. "On 'stop=repeat' servicing for non-exponential queueing networks with blocking," Serie Research Memoranda 0023, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    9. Dijk, N.M. van, 1989. "A note on extended uniformization for non-exponential stochastic networks," Serie Research Memoranda 0026, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    10. Niek Baer & Richard J. Boucherie & Jan-Kees C. W. van Ommeren, 2019. "Threshold Queueing to Describe the Fundamental Diagram of Uninterrupted Traffic," Transportation Science, INFORMS, vol. 53(2), pages 585-596, March.
    11. Dijk, J.N. & Akyildiz, I.F., 1988. "Networks with mixed processor sharing parallel queues and common pools," Serie Research Memoranda 0023, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    12. van Dijk, N.M. & van der Sluis, E. & Bulder, L.N. & Cui, Y., 2024. "Flexible serial capacity allocation with intensive care application," International Journal of Production Economics, Elsevier, vol. 272(C).
    13. van Dijk, Nico M., 2008. "Error bounds for state space truncation of finite Jackson networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 164-181, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:48:y:2000:i:1:p:38-49. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.