Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142324 | Operations Research Letters | 2013 | 6 Pages |
Abstract
The push-pull queueing network is a simple example in which servers either serve jobs or generate new arrivals. It was previously conjectured that there is no policy that makes the network positive recurrent (stable) in the critical case. We settle this conjecture and devise a general sufficient condition for non-stabilizability of queueing networks which is based on a linear martingale and further applies to generalizations of the push-pull network.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yoni Nazarathy, Leonardo Rojas-Nandayapa, Thomas S. Salisbury,