Cart (Loading....) | Create Account
Close category search window
 

Coordinated aggregate scheduling for improving end-to-end delay performance

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)
Wei Sun ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Shin, K.G.

This paper proposes a novel coordinated aggregate scheduling (CAS) algorithm that combines both EOF (earliest-deadline-first) scheduling and rate-based fair queueing. CAS uses guaranteed rate (GR) scheduling (Goyal, P et al., 1995) for traffic aggregates at the inter-aggregate level, but employs EDF-like scheduling at the intra-aggregate level. Computation of the deadline DN of a packet at an intermediate node N is coordinated between the node N and its upstream nodes, and DN is related to the packet's guaranteed rate clock (GRC) value at the flow-aggregation node. CAS provides tighter end-to-end (e2e) delay bounds than the "vanilla" GR aggregate scheduling that relies on FIFO queueing within an aggregate. Our in-depth simulation results demonstrate CAS's superior performance. Moreover, as an aggregate-based work-conserving scheduling algorithm, CAS incurs lower scheduling and state-maintenance overheads at routers than per-flow scheduling. These salient features make CAS very attractive for use in Internet core networks.

Published in:

Quality of Service, 2004. IWQOS 2004. Twelfth IEEE International Workshop on

Date of Conference:

7-9 June 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.