Improvements to Core Stateless Fair Queueing

  • Cristel Pelsser
  • Stefaan De Cnodder
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2334)


Core Stateless Fair Queueing (CSFQ) is a scalable mechanism to provide per-flow fairness in high-speed networks in that it does not need to maintain per-flow state in the core routers. This is possible because the state for each flow is encoded as special labels inside each packet. In this paper, we propose and evaluate by simulations two improvements to CSFQ. First, we show that CSFQ does not provide a fair service when some links are not congested. Our first improvement solves this issue. Second, we propose an algorithm to allow CSFQ to provide a service with a minimum guaranteed bandwidth and evaluate its performance with TCP traffic.


Window Size Arrival Rate Fair Share Output Link Link Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. Internet RFC 2475, December 1998.Google Scholar
  2. [2]
    R. Braden, D. Clark, and S. Shenker. Integrated services in the Internet architecture: an overview. Internet RFC 1633, July 1994.Google Scholar
  3. [3]
    Z. Cao, Z. Wang, and E. Zegura. Rainbow fair queueing: Fair bandwidth sharing without per-flow state. In Proceedings INFOCOM’ 00, March 2000.Google Scholar
  4. [4]
    Stefaan De Cnodder, Kenny Pauwels, and Omar Elloumi. A rate based RED mechanism. In Proc. of the 10th International Workshop on Network and Operating System Support for Digital Audio and Video, NOSSDAV 2000, Chapel Hill, NC, 26–28 June 2000.Google Scholar
  5. [5]
    Na Li, Marissa Borrego, and San-qi Li. Achieving per-flow fair rate allocation within diffserv. In Proceedings of the fifth IEEE Symposium on Computers and Communications, ISCC 2000, Antibes, France, 3–6 July 2000.Google Scholar
  6. [6]
    M. Nabeshima, T. Shimizu, and I. Yamasaki. Fair queueing with in/out bit in core stateless networks. In Proc. of the 8th International Workshop on Quality of Service, IWQoS 2000, Pittsburgh, PA, 5–7 June 2000.Google Scholar
  7. [7]
    Kenny Pauwels, Stefaan De Cnodder, and Omar Elloumi. A multi-color marking scheme to achieve fair bandwidth allocation. In Proc. of the 1st International Workshop on Quality of future Internet Services, QofIS 2000, Berlin, Germany, 25–26 September 2000.Google Scholar
  8. [8]
    Cristel Pelsser. Support of fairness and guarantees without per-flow state in routers. Master’s thesis, Facultés Universitaires Notre-Dame de la Paix, Namur, Belgium, June 2001. Available at Scholar
  9. [9]
    I. Stoica, H. Zhang, S. Shenker, R. Yavatkar, D. Stephens, A. Malis, Y. Bernet, Z. Wang, F. Baker, J. Wroclawski, C. Song, and R. Wilder. Per hop behaviors based on dynamic packet states. Internet Engineering Task Force, Work in Progress, draft-stoica-diffserv-dps-00.txt, February 1999.Google Scholar
  10. [10]
    Ion Stoica, Scott Shenker, and Hui Zhang. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks. In Proceedings of ACM SIGCOMM’98, Vancouver, BC, October 1998.Google Scholar
  11. [11]
    Ion Stoica and Hui Zhang. Providing guaranteed services without per flow management. In Proceedings of ACM SIGCOMM’99, Cambridge, MA, August 1999.Google Scholar
  12. [12]
    N. Venkitaraman, J. Mysore, R. Srikant, and R. Barnes. Stateless prioritized fair queueing. Internet Engineering Task Force, Work in Progress, draft-venkitaraman-spfq-00.txt, July 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Cristel Pelsser
    • 1
  • Stefaan De Cnodder
    • 2
  1. 1.University of NamurBelgium
  2. 2.AlcatelBelgium

Personalised recommendations