Item Details

Print View

Statistical Per-Flow Service Bounds in a Network With Aggregate Provisioning

Liebeherr, Jorg; Patek, Stephen; Burchard, Almut
Format
Report
Author
Liebeherr, Jorg
Patek, Stephen
Burchard, Almut
Abstract
Scalability concerns of QoS implementations have stipulated service architectures where QoS is not provisioned separately to each flow, but instead to aggregates of flows. This paper determines stochastic bounds for the service experienced by a single flow when resources are managed for aggregates of flows and when the scheduling algorithms used in the network are not known. Using a recently developed statistical network calculus, per-flow bounds can be calculated for backlog, delay, and the burstiness of output traffic.
Language
English
Date Received
2012-10-29
Published
University of Virginia, Department of Computer Science, 2002
Published Date
2002
Collection
Libra Open Repository
In CopyrightIn Copyright
▾See more
▴See less

Availability

Access Online