Fair queueing algorithms for packet scheduling in BISDN
This paper discusses several algorithms related to fair queueing and studies the application of fair queueing to the provision of quality of service (QOS) in broadband multi-media networks. We develop an intuitive understanding of several recent packet scheduling algorithms related to fair queueing, and show that one of them, the self-clocked fair queueing (SCFQ) algorithm, is both technically correct and practically implementable. The SCFQ algorithm provides a good analytic bound on delay, even in a multi-hop network; provides a bound on the discrepancy in service among sources (i.e., fairness); and provides isolation between sources to guarantee each source access to its allocated resources. The only computationally complex part of the algorithm is a sorting function, which can be implemented in hardware. We conclude that fair queueing provides a feasible and reliable way of satisfying QOS requirements for diverse traffic sources and applications, while maintaining a high level of network utilization. These properties make fair queueing a useful component of ATM network technology.
KeywordsFair Queueing Packet Scheduling ATM BISDN Quality of Service
Unable to display preview. Download preview PDF.
- 2.D. D. Clark, S. Shenker, and L. Zhang. Supporting real-time applications in an integrated services packet network: Architecture and mechanism. In ACM SIGComm Symp., pages 14–26, 1992.Google Scholar
- 3.R. L. Cruz. A calculus for network delay, part I: Network elements in isolation. IEEE Transactions on Information Theory, 37(1):114–131, January 1991.Google Scholar
- 4.A. Demers, S. Keshav, and S. Shenkar. Analysis and simulation of a fair queueing algorithm. In Proc. SIGCOMM'89, pages 1–12, Austin, Texas, September 1989.Google Scholar
- 7.S. J. Golestani. A self-clocked fair queueing scheme for broadband applications. In IEEE INFOCOM'94, pages 636–646, 1994.Google Scholar
- 9.E. L. Hahne. Round Robin Scheduling for Fair Flow Control. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, December 1986.Google Scholar
- 10.A. T. Heybey and J. R. Davin. A simulation study of fair queueing and policy enforcement. ACM Comp. Comm. Rev., 20(5), October 1990.Google Scholar
- 11.A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. In Proc. IEEE INFOCOM'93, pages 521–530, 1993.Google Scholar