TY - UNPD
A1 - Weinard, Maik
T1 - Deciding the FIFO stability of networks in polynomial time
N2 - 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 [4].
T3 - Frankfurter Informatik-Berichte - 05, 3
Y1 - 2005
UR - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/6675
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hebis:30:3-66757
UR - http://www.cs.uni-frankfurt.de/fbreports/0305report.ps
SN - 1616-9107
N1 - Diese Arbeit dürfen wir außerhalb der Universitätsbibliothek leider (aus urheberrechtlichen Gründen) nicht im Volltext zur Verfügung stellen.
PB - Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik
CY - Frankfurt am Main
ER -