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

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.

• Type: Conference
• Year: 2003
• Where: INFOCOM
• Authors: Jörg Liebeherr, Stephen D. Patek, Almut Burchard
• Keywords: Communications, INFOCOM 2003, QoS Implementations, Scalability Concerns, Stochastic Bounds