A push-pull system with infinite supply of work

Kopzon, Anat, Nazarathy, Yoni and Weiss, Gideon (2009) A push-pull system with infinite supply of work. Queueing Systems, 62 1-2: 75-111. doi:10.1007/s11134-009-9121-1

Author Kopzon, Anat
Nazarathy, Yoni
Weiss, Gideon
Title A push-pull system with infinite supply of work
Journal name Queueing Systems   Check publisher's open access policy
ISSN 0257-0130
Publication date 2009
Sub-type Article (original research)
DOI 10.1007/s11134-009-9121-1
Volume 62
Issue 1-2
Start page 75
End page 111
Total pages 37
Place of publication Secaucus, NJ, United States
Publisher Springer New York
Language eng
Abstract We consider a two-node multiclass queueing network with two types of jobs moving through two servers in opposite directions, and there is infinite supply of work of both types. We assume exponential processing times and preemptive resume service. We identify a family of policies which keep both servers busy at all times and keep the queues between the servers positive recurrent. We analyze two specific policies in detail, obtaining steady state distributions. We perform extensive calculations of expected queue lengths under these policies. We compare this network with the Kumar-Seidman-Rybko-Stolyar network, in which there are two random streams of arriving jobs rather than infinite supply of work.
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Non-UQ
Additional Notes Published online: 20 May 2009.

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Mathematics and Physics
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 5 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 5 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 27 Apr 2012, 13:01:39 EST by Kay Mackie on behalf of School of Mathematics & Physics