Title :
Statistical per-flow service bounds in a network with aggregate provisioning
Author :
Liebeherr, Jörg ; Patek, Stephen D. ; Burchard, Almut
Author_Institution :
Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA
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.
Keywords :
calculus of communicating systems; quality of service; statistical analysis; stochastic processes; telecommunication traffic; QoS implementation; admission control; flow aggregate provisioning network; network traffic backlog; network traffic burstiness; network traffic delay; per-flow service stochastic bound; quality of service; scheduling algorithm; statistical flow multiplexing; statistical network calculus; Aggregates; Calculus; Communication system traffic control; Computer science; Fluid flow measurement; Intelligent networks; Scalability; Scheduling algorithm; Switches; Telecommunication traffic;
Conference_Titel :
INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies
Print_ISBN :
0-7803-7752-4
DOI :
10.1109/INFCOM.2003.1209191
