Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143392 | Operations Research Letters | 2009 | 5 Pages |
Abstract
We show, using a simple example, that the First-In-First-Out (FIFO) policy can be unstable in a system with arbitrarily low load. Our proof is based on the observation that the special structure of the example we use allows us to establish stability using a much simpler queueing system.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tolga Tezcan,