IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v317y2022i2d10.1007_s10479-015-1850-4.html
   My bibliography  Save this article

Signaling for decentralized routing in a queueing network

Author

Listed:
  • Yi Ouyang

    (University of Michigan)

  • Demosthenis Teneketzis

    (University of Michigan)

Abstract

A discrete-time decentralized routing problem in a service system consisting of two service stations and two controllers is investigated. Each controller is affiliated with one station. Each station has an infinite size buffer. Exogenous customer arrivals at each station occur with rate $$\uplambda $$ λ . Service times at each station have rate $$\mu $$ μ . At any time, a controller can route one of the customers waiting in its own station to the other station. Each controller knows perfectly the queue length in its own station and observes the exogenous arrivals to its own station as well as the arrivals of customers sent from the other station. At the beginning, each controller has a probability mass function (PMF) on the number of customers in the other station. These PMFs are common knowledge between the two controllers. At each time a holding cost is incurred at each station due to the customers waiting at that station. The objective is to determine routing policies for the two controllers that minimize either the total expected holding cost over a finite horizon or the average cost per unit time over an infinite horizon. In this problem there is implicit communication between the two controllers; whenever a controller decides to send or not to send a customer from its own station to the other station it communicates information about its queue length to the other station. This implicit communication through control actions is referred to as signaling in decentralized control. Signaling results in complex communication and decision problems. In spite of the complexity of signaling involved, it is shown that an optimal signaling strategy is described by a threshold policy which depends on the common information between the two controllers; this threshold policy is explicitly determined.

Suggested Citation

  • Yi Ouyang & Demosthenis Teneketzis, 2022. "Signaling for decentralized routing in a queueing network," Annals of Operations Research, Springer, vol. 317(2), pages 737-775, October.
    • Handle: RePEc:spr:annopr:v:317:y:2022:i:2:d:10.1007_s10479-015-1850-4
    DOI: 10.1007/s10479-015-1850-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-1850-4
    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/s10479-015-1850-4?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. Ward Whitt, 1986. "Deciding Which Queue to Join: Some Counterexamples," Operations Research, INFORMS, vol. 34(1), pages 55-62, February.
    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. Plinio S. Dester & Christine Fricker & Danielle Tibi, 2017. "Stationary analysis of the shortest queue problem," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 211-243, December.
    2. 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.
    3. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    4. Sarang Deo & Itai Gurvich, 2011. "Centralized vs. Decentralized Ambulance Diversion: A Network Perspective," Management Science, INFORMS, vol. 57(7), pages 1300-1319, July.
    5. Athanasia Manou & Antonis Economou & Fikri Karaesmen, 2014. "Strategic Customers in a Transportation Station: When Is It Optimal to Wait?," Operations Research, INFORMS, vol. 62(4), pages 910-925, August.
    6. V.D. Dinopoulou & C. Melolidakis, 2001. "Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(8), pages 732-746, December.
    7. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
    8. Jori Selen & Ivo Adan & Stella Kapodistria & Johan Leeuwaarden, 2016. "Steady-state analysis of shortest expected delay routing," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 309-354, December.
    9. Fernanda Campello & Armann Ingolfsson & Robert A. Shumsky, 2018. "Queueing Models of Case Managers," Management Science, INFORMS, vol. 64(1), pages 7-26, January.
    10. Rami Atar & Isaac Keslassy & Gal Mendelson, 2019. "Replicate to the shortest queues," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 1-23, June.
    11. Rob Shone & Vincent A. Knight & Paul R. Harper, 2020. "A conservative index heuristic for routing problems with multiple heterogeneous service facilities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 511-543, December.
    12. Yan Chen & Ward Whitt, 2020. "Algorithms for the upper bound mean waiting time in the GI/GI/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 327-356, April.
    13. Legros, Benjamin & Jouini, Oualid, 2019. "On the scheduling of operations in a chat contact center," European Journal of Operational Research, Elsevier, vol. 274(1), pages 303-316.
    14. Jazeem Abdul Jaleel & Sherwin Doroudi & Kristen Gardner & Alexander Wickeham, 2022. "A general “power-of-d” dispatching framework for heterogeneous systems," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 431-480, December.
    15. Esther Frostig & Benny Levikson, 1999. "Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times," Operations Research, INFORMS, vol. 47(3), pages 438-444, June.
    16. Olga Bountali & Antonis Economou, 2019. "Strategic customer behavior in a two-stage batch processing system," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 3-29, October.
    17. P S Ansell & K D Glazebrook & C Kirkbride, 2003. "Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 379-389, April.
    18. Hong Chen & Heng-Qing Ye, 2012. "Asymptotic Optimality of Balanced Routing," Operations Research, INFORMS, vol. 60(1), pages 163-179, February.
    19. Senthil Veeraraghavan & Laurens Debo, 2009. "Joining Longer Queues: Information Externalities in Queue Choice," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 543-562, April.
    20. Danielle Tibi, 2019. "Martingales and buffer overflow for the symmetric shortest queue model," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 153-190, October.

    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:annopr:v:317:y:2022:i:2:d:10.1007_s10479-015-1850-4. 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.