Heavy traffic limit for a tandem queue with identical service times

H. Christian Gromoll (), Bryce Terwilliger () and Bert Zwart ()
Additional contact information
H. Christian Gromoll: University of Virginia
Bryce Terwilliger: University of Virginia
Bert Zwart: Centrum Wiskunde & Informatica

Queueing Systems: Theory and Applications, 2018, vol. 89, issue 3, No 1, 213-241

Abstract: Abstract We consider a two-node tandem queueing network in which the upstream queue is M/G/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. We investigate the amount of work in the second queue at certain embedded arrival time points, namely when the upstream queue has just emptied. We focus on the case of infinite-variance service times and obtain a heavy traffic process limit for the embedded Markov chain.

Keywords: Tandem queue; Infinite variance; Feller process; Process limit; 60K25; 90B22 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-017-9560-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:89:y:2018:i:3:d:10.1007_s11134-017-9560-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-017-9560-z

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().