Evaluating buffer-constrained routers under bursty and shaped traffic

Authors:
Arvinderpal S. Wander;Anujan Varma
Affiliations:
Computer Engineering Department, University of California, Santa Cruz, CA;Computer Engineering Department, University of California, Santa Cruz, CA
Venue:
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Year:
2009

Citing 9
Cited 0

On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Fast, approximate synthesis of fractional Gaussian noise for generating self-similar network traffic

ACM SIGCOMM Computer Communication Review
The concept of relevant time scales and its application to queuing analysis of self-similar traffic (or is Hurst naughty or nice?)

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Data networks as cascades: investigating the multifractal nature of Internet WAN traffic

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Simulation of nonGaussian long-range-dependent traffic using wavelets

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Sizing router buffers

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Wavelet analysis of long-range-dependent traffic

IEEE Transactions on Information Theory
A multifractal wavelet model with application to network traffic

IEEE Transactions on Information Theory
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider traffic models for the evaluation of buffer-constrained routers, such as routers with all-optical data paths. We show that conventional models may substantially underestimate the packet loss behavior. We propose an alternative method based on the multifractal wavelet model (MWM). Using this new model, we show that routers are susceptible to high losses under bursty Internet traffic conditions. However, if traffic can be shaped into a deterministic arrival stream, then large-scale buffer-constrained routers are possible within backbone networks.