Heavy traffic limit for a tandem queue with identical service times
- 168 Downloads
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.
KeywordsTandem queue Infinite variance Feller process Process limit
Mathematics Subject Classification60K25 90B22
Funding was provided by NWO grant number 639.033.413.
- 1.Boxma, O.: Analysis of models for tandem queues. Ph.D. Thesis, University of Utrecht, Utrecht (1977)Google Scholar
- 7.Ethier, S.N., Kurtz, T.G.: Markov Processes: Characterization and Convergence, vol. 282. Wiley, Hoboken (2009)Google Scholar
- 9.Billingsley, P.: Convergence of Probability Measures. Tracts on Probability and Statistics. Wiley Series in Probability and Mathematical Statistics. Wiley, Hoboken (1968)Google Scholar
- 11.Resnick, S.I.: Heavy-tail Phenomena. Springer Series in Operations Research and Financial Engineering. Springer, New York (2007). (Probabilistic and statistical modeling)Google Scholar