Fair queueing algorithms for packet scheduling in BISDN

  • S. Jamaloddin Golestani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1044)


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.


Fair Queueing Packet Scheduling ATM BISDN Quality of Service 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. J. Chao. A novel architecture for queue management in the ATM network. IEEE Journal on Selected Areas in Communications, 9(7):1110–1118, September 1991.CrossRefGoogle Scholar
  2. 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. 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. 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
  5. 5.
    D. Ferrari and D. Verma. A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications, 8(3):368–379, 1990.CrossRefGoogle Scholar
  6. 6.
    S. J. Golestani. Congestion free communication in high speed packet networks. IEEE Transactions on Communications, 32(12):1802–1812, December 1991.CrossRefGoogle Scholar
  7. 7.
    S. J. Golestani. A self-clocked fair queueing scheme for broadband applications. In IEEE INFOCOM'94, pages 636–646, 1994.Google Scholar
  8. 8.
    S. J. Golestani. Network delay analysis of a class of fair queueing algorithms. IEEE Journal on Selected Areas in Communications, 13(6):1057–1070, August 1995.CrossRefGoogle Scholar
  9. 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. 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. 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
  12. 12.
    A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. ACM/IEEE Transaction on Networking, 2(2):137–150, April 1994.CrossRefGoogle Scholar
  13. 13.
    J. S. Turner. New directions in communications or which way to the information age. IEEE Communications Magazine, 24(10):8–15, October 1986.CrossRefGoogle Scholar
  14. 14.
    L. Zhang. Virtual clock: A new traffic control algorithm for packet switching. ACM Transactions on Computer Systems, 9(2):101–124, May 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • S. Jamaloddin Golestani
    • 1
  1. 1.BellcoreMorristownUSA

Personalised recommendations