By Topic

Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule

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)
Andrews, M. ; Bell Labs., Murray Hill, NJ, USA ; Zhang, L.

We study the problem of providing end-to-end delay guarantees in connection-oriented networks. In this environment, multiple-hop sessions coexist and interfere with one another. Parekh and Gallager (1993, 1994) showed that the weighted fair queueing (WFQ) scheduling discipline provides a worst-case delay guarantee comparable to 1/(ρi)×K i for a session with rate ρi and Ki hops. Such delays can occur since a session-i packet can wait for time 1/(ρi) at every hop. We describe a work-conserving scheme that guarantees an additive delay bound of approximately 1/(ρi)+Ki . This bound is smaller than the multiplicative bound 1/(ρi)×Ki of WFQ, especially when the hop count K i is large. We call our scheme coordinated-earliest-deadline-first (CEDF) since it uses an earliest deadline-first approach in which simple coordination is applied to the deadlines for consecutive hops of a session. The key to the bound is that once a packet has passed through its first server, it can pass through all its subsequent servers quickly. We conduct simulations to compare the delays actually produced by the two scheduling disciplines. In many cases, these actual delays are comparable to their analytical worst-case bounds, implying that CEDF outperforms WFQ

Published in:

INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE  (Volume:1 )

Date of Conference:

21-25 Mar 1999