Aggregation of Heterogeneous Real-Time Flows with Statistical Guarantees
Key: PSS02-1
Author: Krishna Pandit, Jens Schmitt, Ralf Steinmetz
Date: July 2002
Kind: In proceedings
Publisher: SCS
Book title: Procceedings of 2002 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS'02), San Diego, USA
Abstract: Aggregation of data flows has two major advantages. One is the reduction of state complexity within the network, the other is the saving of resources by statistical multiplexing between the aggregated flows. In this paper, we show a simple, yet effective scheme to aggregate real-time flows which require a statistical guarantee on experienced loss and a deterministic guarantee on the maximum delay on an individual basis. The focus of our aggregation scheme is on the reduction of state complexity. Therefore, we try to maximize the number of flows to be aggregated by the consideration of heterogeneous flows at the cost of maximally saving resources which would require homogenous flows to be aggregated. Our approach is to first gain insight on the buffer occupancy distribution of a single flow. In practice, the buffer occupancy distribution function of a real-time flow can be considered as monotonic decreasing. We show that the uniform distribution, which is analytically very tractable, is always more pessimistic than a monotonic decreasing distribution. This allows us to aggregate heterogeneous flows by taking the uniform distribution as a worst-case bound for the individual flows' buffer distributions and exploiting its statistical properties to save buffer resources by statistical multiplexing between the individual flows of the aggregate. Finally, we discuss at which rate such an aggregate of heterogeneous flows has to be served while maintaining the statistical guarantees given to individual flows.
View Full paper (PDF) | Download Full paper (PDF)

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.