IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v293y2020i1d10.1007_s10479-019-03358-0.html
   My bibliography  Save this article

Analysis of tandem polling queues with finite buffers

Author

Listed:
  • Ravi Suman

    (University of Wisconsin-Madison)

  • Ananth Krishnamurthy

    (Indian Institute of Management Bangalore)

Abstract

We analyze a tandem polling queue with two stations operating under three different polling strategies, namely: (1) Independent polling, (2) Synchronous polling, and (3) Out-of-sync polling. Under Markovian assumptions of arrival and service times, we conduct an exact analysis using Matrix Geometric method to determine system throughput, mean queue lengths, and mean waiting times. Through numerical experiments, we compare the performance of the three polling strategies and the effect of buffer sizes on performance. We observe that the independent polling strategy generally performs better than the other strategies, however, under certain settings of product asymmetry, other strategies yield better performance.

Suggested Citation

  • Ravi Suman & Ananth Krishnamurthy, 2020. "Analysis of tandem polling queues with finite buffers," Annals of Operations Research, Springer, vol. 293(1), pages 343-369, October.
    • Handle: RePEc:spr:annopr:v:293:y:2020:i:1:d:10.1007_s10479-019-03358-0
    DOI: 10.1007/s10479-019-03358-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03358-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/s10479-019-03358-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. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 306-330, May.
    2. M. Boon, 2012. "A polling model with reneging at polling instants," Annals of Operations Research, Springer, vol. 198(1), pages 5-23, September.
    3. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 331-361, May.
    4. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2003. "Dynamic Server Allocation for Queueing Networks with Flexible Servers," Operations Research, INFORMS, vol. 51(6), pages 952-968, December.
    5. Otis B. Jennings, 2008. "Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 12-35, February.
    6. Awi Federgruen & Ziv Katalan, 1996. "Customer waiting‐time distributions under base‐stock policies in single‐facility multi‐item production systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 533-548, June.
    7. Yonit Barron & Uri Yechiali, 2017. "Generalized control-limit preventive repair policies for deteriorating cold and warm standby Markovian systems," IISE Transactions, Taylor & Francis Journals, vol. 49(11), pages 1031-1049, November.
    8. Yonit Barron, 2018. "Group maintenance policies for an R-out-of-N system with phase-type distribution," Annals of Operations Research, Springer, vol. 261(1), pages 79-105, February.
    9. 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.
    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. Otis B. Jennings, 2008. "Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 12-35, February.
    2. J. G. Dai & O. B. Jennings, 2004. "Stabilizing Queueing Networks with Setups," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 891-922, November.
    3. Mansour Shrahili & Mohamed Kayid, 2023. "Stochastic Orderings of the Idle Time of Inactive Standby Systems," Mathematics, MDPI, vol. 11(20), pages 1-21, October.
    4. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2001. "Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems," Management Science, INFORMS, vol. 47(10), pages 1421-1439, October.
    5. Daniel Adelman, 2007. "Price-Directed Control of a Closed Logistics Queueing Network," Operations Research, INFORMS, vol. 55(6), pages 1022-1038, December.
    6. Wu, Hui & Li, Yan-Fu & Bérenguer, Christophe, 2020. "Optimal inspection and maintenance for a repairable k-out-of-n: G warm standby system," Reliability Engineering and System Safety, Elsevier, vol. 193(C).
    7. David Gamarnik, 2007. "On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 257-265, May.
    8. Dimitris Bertsimas & David Gamarnik & Alexander Anatoliy Rikun, 2011. "Performance Analysis of Queueing Networks via Robust Optimization," Operations Research, INFORMS, vol. 59(2), pages 455-466, April.
    9. Carri W. Chan & Mor Armony & Nicholas Bambos, 2016. "Maximum weight matching with hysteresis in overloaded queues with setups," Queueing Systems: Theory and Applications, Springer, vol. 82(3), pages 315-351, April.
    10. Joby K. Jose & M. Drisya, 2020. "Time-dependent stress–strength reliability models based on phase type distribution," Computational Statistics, Springer, vol. 35(3), pages 1345-1371, September.
    11. Gao, Shan & Wang, Jinting, 2021. "Reliability and availability analysis of a retrial system with mixed standbys and an unreliable repair facility," Reliability Engineering and System Safety, Elsevier, vol. 205(C).
    12. Kevin D. Glazebrook & José Niño-Mora, 2001. "Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance," Operations Research, INFORMS, vol. 49(4), pages 609-623, August.
    13. Nooshin Salari & Viliam Makis, 2020. "Joint maintenance and just-in-time spare parts provisioning policy for a multi-unit production system," Annals of Operations Research, Springer, vol. 287(1), pages 351-377, April.
    14. Ruiz-Castro, Juan Eloy, 2020. "A complex multi-state k-out-of-n: G system with preventive maintenance and loss of units," Reliability Engineering and System Safety, Elsevier, vol. 197(C).
    15. Wei-Min Lan & Tava Lennon Olsen, 2006. "Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules," Operations Research, INFORMS, vol. 54(3), pages 505-522, June.
    16. 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.
    17. Emmett J. Lodree & Nezih Altay & Robert A. Cook, 2019. "Staff assignment policies for a mass casualty event queuing network," Annals of Operations Research, Springer, vol. 283(1), pages 411-442, December.
    18. Tony T. Tran & Meghana Padmanabhan & Peter Yun Zhang & Heyse Li & Douglas G. Down & J. Christopher Beck, 2018. "Multi-stage resource-aware scheduling for data centers with heterogeneous servers," Journal of Scheduling, Springer, vol. 21(2), pages 251-267, April.
    19. Chen, Wu-Lin & Wang, Kuo-Hsiung, 2018. "Reliability analysis of a retrial machine repair problem with warm standbys and a single server with N-policy," Reliability Engineering and System Safety, Elsevier, vol. 180(C), pages 476-486.
    20. Zhao, Yaping & Xu, Xiaoyun & Li, Haidong & Liu, Yanni, 2016. "Prioritized customer order scheduling to maximize throughput," European Journal of Operational Research, Elsevier, vol. 255(2), pages 345-356.

    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:293:y:2020:i:1:d:10.1007_s10479-019-03358-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.