By Topic

A simple model of real-time flow aggregation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fu, H. ; Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA ; Knightly, E.W.

The IETF's integrated services (IntServ) architecture, together with reservation aggregation, provides 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 forwards data. However, reserving resources in "bulk" implies that the reservation does not precisely match the true demand. Consequently, if the flows' demanded bandwidth varies rapidly and dramatically, aggregation can incur significant performance penalties of under-utilization 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. 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; 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 a performance that closely approximates that of IntServ.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:11 ,  Issue: 3 )