Computer Science – Networking and Internet Architecture
Scientific paper
2009-11-19
Computer Science
Networking and Internet Architecture
29 pages
Scientific paper
We provide upper bounds on the end-to-end backlog and delay in a network with heavy-tailed and self-similar traffic. The analysis follows a network calculus approach where traffic is characterized by envelope functions and service is described by service curves. A key contribution of this paper is the derivation of a probabilistic sample path bound for heavy-tailed self-similar arrival processes, which is enabled by a suitable envelope characterization, referred to as `htss envelope'. We derive a heavy-tailed service curve for an entire network path when the service at each node on the path is characterized by heavy-tailed service curves. We obtain backlog and delay bounds for traffic that is characterized by an htss envelope and receives service given by a heavy-tailed service curve. The derived performance bounds are non-asymptotic in that they do not assume a steady-state, large buffer, or many sources regime. We also explore the scale of growth of delays as a function of the length of the path. The appendix contains an analysis for self-similar traffic with a Gaussian tail distribution.
Burchard Almut
Ciucu Florin
Liebeherr Jörg
No associations
LandOfFree
Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-453785