IDEAS home Printed from https://ideas.repec.org/p/tse/wpaper/124587.html
   My bibliography  Save this paper

Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms

Author

Listed:
  • Castiel, Eyal
  • Borst, Sem
  • Miclo, Laurent
  • Simatos, Florian
  • Whiting, Phil

Abstract

We examine a queue-based random-access algorithm where activation and deactivation rates are adapted as functions of queue lengths. We establish its heavy traffic behavior on a complete interference graph, which turns out to be nonstandard in two respects: (1) the scaling depends on some parameter of the algorithm and is not the N/N2 scaling usually found in functional central limit theorems; (2) the heavy traffic limit is deterministic. We discuss how this nonstandard behavior arises from the idleness induced by the distributed nature of the algorithm. In order to prove our main result, we develop a new method for obtaining a fully coupled stochastic averaging principle.

Suggested Citation

  • Castiel, Eyal & Borst, Sem & Miclo, Laurent & Simatos, Florian & Whiting, Phil, 2020. "Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms," TSE Working Papers 20-1129, Toulouse School of Economics (TSE).
    • Handle: RePEc:tse:wpaper:124587
    as

    Download full text from publisher

    File URL: https://perso.math.univ-toulouse.fr/miclo/files/2020/07/csma.pdf
    File Function: Full Text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. E. G. Coffman & A. A. Puhalskii & M. I. Reiman, 1998. "Polling Systems in Heavy Traffic: A Bessel Process Limit," Mathematics of Operations Research, INFORMS, vol. 23(2), pages 257-304, May.
    2. Ohad Perry & Ward Whitt, 2013. "A Fluid Limit for an Overloaded X Model via a Stochastic Averaging Principle," Mathematics of Operations Research, INFORMS, vol. 38(2), pages 294-349, May.
    3. Hunt, P. J. & Kurtz, T. G., 1994. "Large loss networks," Stochastic Processes and their Applications, Elsevier, vol. 53(2), pages 363-378, October.
    4. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    5. Łukasz Kruk, 2011. "An Open Queueing Network with Asymptotically Stable Fluid Model and Unconventional Heavy Traffic Behavior," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 538-551, August.
    6. Otis B. Jennings, 2010. "Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 669-703, 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. Sem Borst & Onno Boxma, 2018. "Polling: past, present, and perspective," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 335-369, October.
    2. David M. Markowitz & Martin I. Reiman & Lawrence M. Wein, 2000. "The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies," Operations Research, INFORMS, vol. 48(1), pages 136-154, February.
    3. David M. Markowitz & Lawrence M. Wein, 2001. "Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem," Operations Research, INFORMS, vol. 49(2), pages 246-270, April.
    4. Martin I. Reiman & Lawrence M. Wein, 1999. "Heavy Traffic Analysis of Polling Systems in Tandem," Operations Research, INFORMS, vol. 47(4), pages 524-534, August.
    5. Jun Luo & Jiheng Zhang, 2013. "Staffing and Control of Instant Messaging Contact Centers," Operations Research, INFORMS, vol. 61(2), pages 328-343, April.
    6. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    7. Saulius Minkevičius & Igor Katin & Joana Katina & Irina Vinogradova-Zinkevič, 2021. "On Little’s Formula in Multiphase Queues," Mathematics, MDPI, vol. 9(18), pages 1-15, September.
    8. Amarjit Budhiraja & Chihoon Lee, 2009. "Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 45-56, February.
    9. Budhiraja, Amarjit & Lee, Chihoon, 2007. "Long time asymptotics for constrained diffusions in polyhedral domains," Stochastic Processes and their Applications, Elsevier, vol. 117(8), pages 1014-1036, August.
    10. Chenxu Li, 2016. "Bessel Processes, Stochastic Volatility, And Timer Options," Mathematical Finance, Wiley Blackwell, vol. 26(1), pages 122-148, January.
    11. Itai Gurvich & Ohad Perry, 2012. "Overflow Networks: Approximations and Implications to Call Center Outsourcing," Operations Research, INFORMS, vol. 60(4), pages 996-1009, August.
    12. Zhen Xu & Jiheng Zhang & Rachel Q. Zhang, 2019. "Instantaneous Control of Brownian Motion with a Positive Lead Time," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 943-965, August.
    13. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
    14. Martin I. Reiman & Lawrence M. Wein, 1998. "Dynamic Scheduling of a Two-Class Queue with Setups," Operations Research, INFORMS, vol. 46(4), pages 532-547, August.
    15. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
    16. I. Venkat Appal Raju & S. Ramasubramanian, 2016. "Risk Diversifying Treaty Between Two Companies with Only One in Insurance Business," Sankhya B: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 78(2), pages 183-214, November.
    17. Golshid Baharian & Tolga Tezcan, 2011. "Stability analysis of parallel server systems under longest queue first," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(2), pages 257-279, October.
    18. Mor Armony & Constantinos Maglaras, 2004. "On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design," Operations Research, INFORMS, vol. 52(2), pages 271-292, April.
    19. Andjel, Enrique & López, F. Javier & Sanz, Gerardo, 2002. "Ergodicity of one-dimensional resource sharing systems," Stochastic Processes and their Applications, Elsevier, vol. 98(1), pages 1-22, March.
    20. Saulius Minkevičius & Edvinas Greičius, 2019. "Heavy Traffic Limits for the Extreme Waiting Time in Multi-phase Queueing Systems," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 109-124, March.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:tse:wpaper:124587. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/tsetofr.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.