Ciucu, F.
Liebeherr, J.
Deutsche Telekom Labs., Tech. Univ. Berlin, Brlin
This paper appears in: INFOCOM 2009. The 28th Conference on Computer Communications. IEEE Publication Date: 19-25 April 2009
On page(s):
1071
- 1079
Location: Rio de Janeiro
ISSN: 0743-166X
ISBN: 978-1-4244-3512-8
Digital Object Identifier: 10.1109/INFCOM.2009.5062019
Current Version Published: 2009-06-02
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not
logged in.
Guests
may access Abstract records free of charge.
Cart
