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

Heavy Traffic Analysis of Polling Systems in Tandem

Author

Listed:
  • Martin I. Reiman

    (Bell Laboratories, Lucent Technologies, Murray Hill, New Jersey 07974)

  • Lawrence M. Wein

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142-1347)

Abstract

We analyze the performance of a tandem queueing network populated by two customer types. The interarrival times of each type and the service times of each type at each station are independent random variables with general distributions, but the load on each station is assumed to be identical. A setup time is incurred when a server switches from one customer type to the other, and each server employs an exhaustive polling scheme. We conjecture that a time scale decomposition, which is known to occur at the first station under heavy traffic conditions, holds for the entire tandem system, and we employ heavy traffic approximations to compute the sojourn time distribution for a customer that arrives to find the network in a particular state. When setup times are zero (except perhaps at the first station) and additional “product-form” type assumptions are imposed, we find the steady-state sojourn time distribution for each customer type.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:47:y:1999:i:4:p:524-534
    DOI: 10.1287/opre.47.4.524
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.47.4.524
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.47.4.524?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. Keigo Yamada, 1984. "Diffusion Approximations for Storage Processes with General Release Rules," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 459-470, August.
    2. 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.
    3. Yamada, Keigo, 1986. "Multi-dimensional Bessel processes as heavy traffic limits of certain tandem queues," Stochastic Processes and their Applications, Elsevier, vol. 23(1), pages 35-56, 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. Lawrence M. Wein, 1991. "Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue," Management Science, INFORMS, vol. 37(7), pages 834-850, July.
    6. William P. Peterson, 1991. "A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 90-118, February.
    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. S. Minkevičius & S. Steišūnas, 2006. "About the Sojourn Time Process in Multiphase Queueing Systems," Methodology and Computing in Applied Probability, Springer, vol. 8(2), pages 293-302, June.
    2. Gromoll, H. Christian & Terwilliger, Bryce & Zwart, Bert, 2020. "Heavy traffic limit for the workload plateau process in a tandem queue with identical service times," Stochastic Processes and their Applications, Elsevier, vol. 130(3), pages 1435-1460.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Saulius Minkevičius & Vladimiras Dolgopolovas & Leonidas L. Sakalauskas, 2016. "A Law of the Iterated Logarithm for the Sojourn Time Process in Queues in Series," Methodology and Computing in Applied Probability, Springer, vol. 18(1), pages 37-57, March.

    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. 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.
    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. 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.
    5. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    6. Maglaras, Constantinos & Van Mieghem, Jan A., 2005. "Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control," European Journal of Operational Research, Elsevier, vol. 167(1), pages 179-207, November.
    7. Hong Chen & Xinyang Shen & David D. Yao, 2002. "Brownian Approximations of Multiclass Open-Queueing Networks," Operations Research, INFORMS, vol. 50(6), pages 1032-1049, December.
    8. Amarjit Budhiraja & Jiang Chen & Sylvain Rubenthaler, 2014. "A Numerical Scheme for Invariant Distributions of Constrained Diffusions," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 262-289, May.
    9. Ick-Hyun Nam, 2001. "Dynamic Scheduling for a Flexible Processing Network," Operations Research, INFORMS, vol. 49(2), pages 305-315, April.
    10. 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).
    11. David Lipshutz & Kavita Ramanan, 2021. "Sensitivity Analysis for the Stationary Distribution of Reflected Brownian Motion in a Convex Polyhedral Cone," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 524-558, May.
    12. Avishai Mandelbaum & Petar Momčilović, 2017. "Personalized queues: the customer view, via a fluid model of serving least-patient first," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 23-53, October.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. Chenxu Li, 2016. "Bessel Processes, Stochastic Volatility, And Timer Options," Mathematical Finance, Wiley Blackwell, vol. 26(1), pages 122-148, January.
    18. Öner-Közen, Miray & Minner, Stefan, 2017. "Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates," European Journal of Operational Research, Elsevier, vol. 263(2), pages 524-539.
    19. 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.
    20. Yucesan, Enver & de Groote, Xavier, 2000. "Lead times, order release mechanisms, and customer service," European Journal of Operational Research, Elsevier, vol. 120(1), pages 118-130, January.

    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:47:y:1999:i:4:p:524-534. 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.