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

Achieving end-to-end delay bounds by EDF scheduling without traffic shaping

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

3 Author(s)
Zhu, K. ; Amber Networks, Fremont, CA, USA ; Zhuang, Y. ; Viniotis, Y.

Earliest deadline first scheduling with per-node traffic shaping (RC-EDF) has the largest schedulable region among all practical policies known today and has been considered a good solution for providing end-to-end packet delay bounds. In order to harness the traffic burstiness inside a network to satisfy the schedulability condition of EDF, per-node traffic shaping has been believed to be necessary. However, shaping introduces artificial packet delays. We show that by deadline assignments at each node that are strict time-shifting of the source packet arrival times, the functionality of shaping can be implicitly realized; the resulting schedulable region of the new scheduling policy is as large as that of RC-EDF. We name the new policy deadline-curve based EDF (DC-EDF). Not only working in a natural work-conserving way, when the global schedulability condition fails DC-EDF will also work in a “best-effort” way to allow packets excessively delayed at previous nodes to catch up and meet the end-to-end delay bounds. Therefore, DC-EDF is likely to provide “tight” statistical delay bounds. We also prove that a known EDF policy without traffic shaping also has a schedulable region as large as that of RC-EDF

Published in:

INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE  (Volume:3 )

Date of Conference:

2001

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.