By Topic

Minimum-delay self-clocked fair queueing algorithm for packet-switched networks

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)
Chiussi, F.M. ; High-Speed Networks Res. Dept., AT&T Bell Labs., Holmdel, NJ, USA ; Francini, A.

The minimum-delay self-clocked fair queueing (MD-SCFQ) algorithm that we present in this paper is the first algorithm that achieves the same delay bounds as the packet by packet version of generalized processor sharing (P-GPS), has fairness properties similar to P-GPS, and uses a system-potential function of 0(1) complexity. To prove that MD-SCFQ achieves the same delay bounds of P-GPS, we have shown that the fluid version of MD-SCFQ belongs to the class of rate proportional server (RPS) schedulers; thus, its packet-by-packet version inherits all the well-known single-node and multiple-node delay properties of P-RPS schedulers. We have also computed the fairness index of MD-SCFQ, and show that is very close to that of P-GPS. Because of the properties of its system potential, MD-SCFQ, when combined with a shaper which declares packets eligible for scheduling according to their virtual starting times, is a work-conserving worst-case fair scheduler

Published in:

INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE  (Volume:3 )

Date of Conference:

29 Mar-2 Apr 1998