Evaluating buffer-constrained routers under bursty and shaped traffic
Arvinderpal S. Wander, Anujan Varma
Abstract
Arvinderpal S. Wander, Anujan Varma
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 multi-fractal 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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 multi-fractal 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.
Key concepts: Computer science, Computer network, Network packet, Buffer (optical fiber), The Internet, Internet traffic, Packet loss, Routing protocol