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.
| Original language | English |
|---|---|
| Pages (from-to) | 213-241 |
| Number of pages | 29 |
| Journal | Queueing Systems |
| Volume | 89 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - 1 Aug 2018 |
Bibliographical note
Funding Information:Funding was provided by NWO grant number 639.033.413.
Publisher Copyright:
© 2017, Springer Science+Business Media, LLC.
Funding
Funding was provided by NWO grant number 639.033.413.
Keywords
- Feller process
- Infinite variance
- Process limit
- Tandem queue
Fingerprint
Dive into the research topics of 'Heavy traffic limit for a tandem queue with identical service times'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver