IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v95y2020i1d10.1007_s11134-020-09652-0.html
   My bibliography  Save this article

Mobility can drastically improve the heavy traffic performance from $$\frac{1}{1-\varrho }$$11-ϱ to $$\log (1/(1-\varrho ))$$log(1/(1-ϱ))

Author

Listed:
  • Florian Simatos

    (ISAE SUPAERO and Université de Toulouse)

  • Alain Simonian

    (ORANGE LABS)

Abstract

We study a model of wireless networks where users move at speed $$\theta \ge 0$$θ≥0, which has the original feature of being defined through a fixed-point equation. Namely, we start from a two-class processor-sharing queue to model one representative cell of this network: class 1 users are patient (non-moving) and class 2 users are impatient (moving). This model has five parameters, and we study the case where one of these parameters is set as a function of the other four through a fixed-point equation. This fixed-point equation captures the fact that the considered cell is in balance with the rest of the network. This modeling approach allows us to alleviate some drawbacks of earlier models of mobile networks. Our main and surprising finding is that for this model, mobility drastically improves the heavy traffic behavior, going from the usual $$\frac{1}{1-\varrho }$$11-ϱ scaling without mobility (i.e., when $$\theta = 0$$θ=0) to a logarithmic scaling $$\log (1/(1-\varrho ))$$log(1/(1-ϱ)) as soon as $$\theta > 0$$θ>0. In the high load regime, this confirms that the performance of mobile systems benefits from the spatial mobility of users. Finally, other model extensions and complementary methodological approaches to this heavy traffic analysis are discussed.

Suggested Citation

  • Florian Simatos & Alain Simonian, 2020. "Mobility can drastically improve the heavy traffic performance from $$\frac{1}{1-\varrho }$$11-ϱ to $$\log (1/(1-\varrho ))$$log(1/(1-ϱ))," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 1-28, June.
  • Handle: RePEc:spr:queues:v:95:y:2020:i:1:d:10.1007_s11134-020-09652-0
    DOI: 10.1007/s11134-020-09652-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-020-09652-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11134-020-09652-0?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Huang, Gang & Mandjes, Michel & Spreij, Peter, 2016. "Large deviations for Markov-modulated diffusion processes with rapid switching," Stochastic Processes and their Applications, Elsevier, vol. 126(6), pages 1785-1818.
    2. Kiran M. Rege & Bhaskar Sengupta, 1996. "Queue-Length Distribution for the Discriminatory Processor-Sharing Queue," Operations Research, INFORMS, vol. 44(4), pages 653-657, August.
    Full references (including those not matched with items on IDEAS)

    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. O. J. Boxma & E. J. Cahen & D. Koops & M. Mandjes, 2019. "Linear Stochastic Fluid Networks: Rare-Event Simulation and Markov Modulation," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 125-153, March.
    2. Braunsteins, Peter & Mandjes, Michel, 2023. "The Cramér-Lundberg model with a fluctuating number of clients," Insurance: Mathematics and Economics, Elsevier, vol. 112(C), pages 1-22.
    3. Blom, Joke & De Turck, Koen & Mandjes, Michel, 2017. "Refined large deviations asymptotics for Markov-modulated infinite-server systems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1036-1044.
    4. H. Thorsdottir & I. M. Verloop, 2016. "Markov-modulated M/G/1-type queue in heavy traffic and its application to time-sharing disciplines," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 29-55, June.
    5. Jerim Kim & Bara Kim & Hsing Luh, 2019. "Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue," Annals of Operations Research, Springer, vol. 277(2), pages 137-159, June.
    6. I. M. Verloop & U. Ayesta & R. Núñez-Queija, 2011. "Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing," Operations Research, INFORMS, vol. 59(3), pages 648-660, June.
    7. Haviv, Moshe & van der Wal, Jan, 2008. "Mean sojourn times for phase-type discriminatory processor sharing systems," European Journal of Operational Research, Elsevier, vol. 189(2), pages 375-386, September.
    8. Nguyen, Dang Hai & Yin, George & Zhu, Chao, 2017. "Certain properties related to well posedness of switching diffusions," Stochastic Processes and their Applications, Elsevier, vol. 127(10), pages 3135-3158.

    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:spr:queues:v:95:y:2020:i:1:d:10.1007_s11134-020-09652-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.