Deciding the FIFO Stability of Networks in Polynomial Time
FIFO is the most prominent queueing strategy due to its simplicity and the fact that it only works with local information. Its analysis within the adversarial queueing theory however has shown, that there are networks that are not stable under the FIFO protocol, even at arbitrarily low rate. On the other hand there are networks that are universally stable, i.e., they are stable under every greedy protocol at any rate r < 1.
The question as to which networks are stable under the FIFO protocol arises naturally. We offer the first polynomial time algorithm for deciding FIFO stability and simple-path FIFO stability of a directed network, answering an open question posed in [1, 4]. It turns out, that there are networks, that are FIFO stable but not universally stable, hence FIFO is not a worst case protocol in this sense. Our characterization of FIFO stability is constructive and disproves an open characterization in .
KeywordsPolynomial Time Polynomial Time Algorithm Outgoing Edge Simple Path Simple Cycle
Unable to display preview. Download preview PDF.
- 3.Bhattacharjee, R., Goel, A.: Instability of FIFO at arbitrarily low rates in the adversarial queueing model. In: Proc. of the 44th Symposium on Foundations of Computer Science, pp. 160–167 (2003)Google Scholar
- 6.Koukopoulos, D., Mavronicolas, M., Spirakis, P.: FIFO is Unstable at Arbitrarily Low Rates (Even in Planar Networks). Electronic Colloq. on Computational Complexity (2003)Google Scholar
- 7.Weinard, M.: Deciding the FIFO Stability of Networks in Polynomial Time (full version), Technical report: Frankfurter Informatik-Berichte, No 3/2005, ISSN 1616-9107Google Scholar