direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Es gibt keine deutsche Übersetzung dieser Webseite.

Oliver Hohlfeld's Publications

On the Convergence to Fairness in Overloaded FIFO Systems
Zitatschlüssel CHC-OCFOFS-11
Autor Ciucu, Florin and Hohlfeld, Oliver and Chen, Lydia Y.
Buchtitel Proceedings of the 30th IEEE International Conference on Computer Communications (INFOCOM '11)
Seiten 1988–1996
Jahr 2011
ISBN 978-1-4244-9919-9
ISSN 0743-166X
DOI http://dx.doi.org/10.1109/INFCOM.2011.5935004
Ort Shanghai, China
Adresse New York, NY, USA
Monat April
Verlag IEEE
Zusammenfassung Many of computing and communication systems are based on FIFO queues whose performance, e.g., in terms of throughput and fairness, is highly influenced by load fluctuations, especially in the case of short-term overload. This paper analytically proves that, for both Markovian and heavy-tailed/self-similar arrivals, overloaded FIFO queues are asymptotically fair in the sense that each flow or aggregate of flows receives a weighted fair share over large time scales. In addition, the paper provides the corresponding transient results and convergence rates, i.e., the amount of time it takes for a flow to probabilistically attain the fair share. Interestingly, for Markovian arrivals, the paper indicates smaller convergence rates at higher utilizations, which is exactly the opposite behavior characteristic to underloaded queueing systems.
Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe