direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications by Type: Conference and Workshop Publications

see also conference papers, workshop papers, demos, and posters. (under construction)

On Ω(HlogH) Scaling of Network Delays
Citation key BLC-OOSND-07
Author Burchard, Almut and Liebeherr, Jorg and Ciucu, Florin
Title of Book Proceedings of IEEE INFOCOM 2007
Pages 1866–1874
Year 2007
ISBN 1-4244-1047-9
ISSN 0743-166X
DOI http://dx.doi.org/10.1109/INFCOM.2007.217
Location Anchorage, AK, USA
Address New York, NY, USA
Month May
Publisher IEEE
Abstract 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 entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

Under Construction

This page/section is
still under construc-
tion. Please try again
later.