direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Es gibt keine deutsche Übersetzung dieser Webseite.

Florin Ciucu's Publications

On Ω(HlogH) Scaling of Network Delays
Zitatschlüssel BLC-OOSND-07
Autor Burchard, Almut and Liebeherr, Jorg and Ciucu, Florin
Buchtitel Proceedings of IEEE INFOCOM 2007
Seiten 1866–1874
Jahr 2007
ISBN 1-4244-1047-9
ISSN 0743-166X
DOI http://dx.doi.org/10.1109/INFCOM.2007.217
Ort Anchorage, AK, USA
Adresse New York, NY, USA
Monat May
Verlag IEEE
Zusammenfassung A recent result in network calculus theory provided statistical delay bounds for exponentially bounded traffic that grow as O(H log H) with the number of nodes on the network path. In this paper we establish the corresponding lower bound which shows that for such such types of traffic, typical end-to-end delays can indeed grow as Theta (H log H). The lower bound is obtained by analyzing the end-to-end delay in a tandem network where each packet maintains the same service time at each traversed node. The results of this paper provide conclusive evidence that, in general, delays have a qualitatively different scaling behavior than is suggested by a worst-case analysis or by an analysis that assumes independent service times at network nodes.
Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe