A simple model of real-time flow aggregation

Authors:
Huirong Fu;Edward W. Knightly
Affiliations:
Department of Computer Science, North Dakota State University, Fargo, ND and Department of Electrical and Computer Engineering and the Department of Computer Science, Rice University, Houston, TX;Department of Electrical and Computer Engineering and the Department of Computer Science, Rice University, Houston, TX
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2003

Citing 5
Cited 2

Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Providing guaranteed services without per flow management

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Endpoint admission control: architectural issues and performance

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
SRP: a Scalable Resource Reservation Protocol for the Internet

Workshop on Wide Area Networks and High Performance Computing
Modeling Internet topology

IEEE Communications Magazine

Framework for parameter mapping to provide end-to-end QoS guarantees in IntServ/DiffServ architectures

Computer Communications
Intra-flow fairness in work-conserving flow aggregation

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The IETF's Integrated Services (IntServ) architecture together with reservation aggregation provide a mechanism to support the quality-of-service demands of real-time flows in a scalable way, i.e., without requiring that each router be signaled with the arrival or departure of each new flow for which it will forward data. However, reserving resources in "bulk" implies that the reservation will not precisely match the true demand. Consequently, if the flows' demanded bandwidth varies rapidly and dramatically, aggregation can incur significant performance penalties of underutilization and unnecessarily rejected flows. On the other hand, if demand varies moderately and at slower time scales, aggregation can provide an accurate and scalable approximation to IntServ. In this paper, we develop a simple analytical model and perform extensive trace-driven simulations to explore the effectiveness of aggregation under a broad class of factors. Example findings include: 1) a simple single-time-scale model with random noise can capture the essential behavior of surprisingly complex scenarios; and 2) with a two-order-of-magnitude separation between the dominant time scale of demand and the time scale of signaling and moderate levels of secondary noise, aggregation achieves performance that closely approximates that of IntServ.