Skip to main content
SpringerLink
Log in

Fair queueing algorithms for packet scheduling in BISDN

  • Conference paper
  • First Online:
Broadband Communications Networks, Services, Applications, Future Directions (IZS 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1044))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  Google Scholar 

  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 

  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.

    Article  Google Scholar 

  6. S. J. Golestani. Congestion free communication in high speed packet networks. IEEE Transactions on Communications, 32(12):1802–1812, December 1991.

    Article  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 

  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.

    Article  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 

  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.

    Article  Google Scholar 

  13. J. S. Turner. New directions in communications or which way to the information age. IEEE Communications Magazine, 24(10):8–15, October 1986.

    Article  Google Scholar 

  14. L. Zhang. Virtual clock: A new traffic control algorithm for packet switching. ACM Transactions on Computer Systems, 9(2):101–124, May 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bellcore, 445 South Street, 07960, Morristown, NJ, USA

    S. Jamaloddin Golestani

Authors
  1. S. Jamaloddin Golestani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Plattner

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golestani, S.J. (1996). Fair queueing algorithms for packet scheduling in BISDN. In: Plattner, B. (eds) Broadband Communications Networks, Services, Applications, Future Directions. IZS 1996. Lecture Notes in Computer Science, vol 1044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022216

Download citation

  • DOI: https://doi.org/10.1007/BFb0022216

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60895-0

  • Online ISBN: 978-3-540-49669-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation