direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Es gibt keine deutsche Übersetzung dieser Webseite.

Eirini Spartinou's Publications

A Case for Decomposition of FIFO Networks
Zitatschlüssel CL-CDFN-09
Autor Ciucu, Florin and Liebeherr, Jörg
Buchtitel INFOCOM 2009. The 28th Conference on Computer Communications.
Seiten 1071–1079
Jahr 2009
ISBN 978-1-4244-3512-8
ISSN 0743-166X
DOI http://dx.doi.org/10.1109/INFCOM.2009.5062019
Ort Rio de Janeiro, Brazil
Monat April
Verlag IEEE Computer Society
Zusammenfassung Recent findings showing that the output of traffic flows at packet switches has similar characteristics as the corresponding input enable a decomposition analysis of a network where nodes can be studied in isolation, thus simplifying an end- to-end analysis of networks. However, network decomposition results currently available are mostly many-sources asymptotics. In this paper we explore the viability of network decomposition in a non-asymptotic regime with a finite number of flows. For traffic with Exponentially Bounded Burstiness (EBB) we derive statistical bounds for the output traffic at a FIFO buffer and compare them with bounds on the input. By evaluating the accuracy of the output bounds with exact results available for special cases and by using numerical examples we find that conditions for network decomposition appear favorable even if the number of flows is relatively small.
Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe