Search Swinburne Research Bank
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/158841
- A push-pull network with infinite supply of work
- Kopzon, Anat; Nazarathy, Yoni; Weiss, Gideon
- 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.
- Publication type
- Journal article
- Queueing Systems: Theory and Applications, Vol. 62, no. 1-2 (Jun 2009), pp. 75-111
- Publication year
- FOR Code(s)
- 0102 Applied Mathematics; 0103 Numerical and Computational Mathematics; 0104 Statistics
- Infinite supply of work; Infinite virtual queues; Kumar-Seidman-Rybko-Stolyar network; Manufacturing; Markovian multiclass queueing networks; Maximum pressure policies; Queueing; Threshold policies
- Publisher URL
- Copyright © Springer Science+Business Media, LLC 2009.
- Peer reviewed