Chapter 4. Packet Scheduling
Published Online: 12 FEB 2002
DOI: 10.1002/0471224391.ch4
Copyright © 2002 by John Wiley & Sons, Inc.
Book Title
Quality of Service Control in High-Speed Networks
Additional Information
How to Cite
Chao, H. J. and Guo, X. (2002) Packet Scheduling, in Quality of Service Control in High-Speed Networks, John Wiley & Sons, Inc., New York, USA. doi: 10.1002/0471224391.ch4
Publication History
- Published Online: 12 FEB 2002
- Published Print: 1 NOV 2001
ISBN Information
Print ISBN: 9780471003977
Online ISBN: 9780471224396
- Summary
- Chapter
Keywords:
- packet scheduling;
- delay bound;
- time stamp;
- arrival process;
- departure process;
- first-in-first-out (FIFO);
- round robin;
- stop-and-go;
- earliest due date (EDD);
- generalized processor sharing (GPS);
- weighted fair queuing (WFQ);
- virtual clock;
- packet fair queuing (PFQ)
Summary
Chapter 4 presents a comprehensive survey of packet scheduling algorithms, including simple first-in-first-out (FIFO), round robin, stop-and-go, hierarchical round robin, earliest due date (EDD), rate-controlled static priority, generalized processor sharing (GPS), weighted fair queuing (WFQ), virtual clock, self-clocked fair queuing (SCFQ), worst-case fair weighted fair queuing (WF2Q), WF2Q+, and core-stateless scheduling. In multiple node case, strict end-to-end delay bound is derived when packet fair queuing (PFQ) is combined with leaky bucket access control.