Core-Stateless Fair Queueing: A scalable architecture to approximate fair bandwidth allocations in high-speed networks

IEEE/ACM Transactions on Networking

Volumn 11, Issue 1, 2003, Pages 33-46

  Stoica, Ion ^a   Shenker, Scott ^b   Zhang, Hui ^c,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d Turin Networks Inc   (United States)

Author keywords

Binary linear codes; Covering radius; Least covering radius

Indexed keywords

ALGORITHMS; BANDWIDTH; COST EFFECTIVENESS; PACKET SWITCHING; PROBABILISTIC LOGICS; QUEUEING NETWORKS; ROUTERS; TELECOMMUNICATION TRAFFIC;

FAIR QUEUEING;

INTERNET;

EID: 0037295811     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2002.808414     Document Type: Article

References (36)

1. J. C. R. Bennett, D. C. Stephens, and H. Zhang, "High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks," in Proc. IEEE Int. Conf. Network Protocols, Atlanta, GA, Oct. 1997, pp. 7-14.
2. 2Q: Worst-case fair weighted fair queueing," in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 1996, pp. 120-128.
3. B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, O. Minshall, C. Partridge, L. Peterson, K. K. Ramakrishnan, S. Shenker, and J. Wroclawski. (1998) Recommendations on queue management and congestion avoidance in the Internet. LBL Network Research Group. [Online]. Available: http://ftp.ee.lbl.gov/nrgother.html
4. R. Gallon, P. Doolan, N. Feldman, A. Fredette, G. Swallow, and A. Viswanathan. (1997) A framework for multiprotocol label switching. IETF. [Online]draft-ietf-mpls-framework-02.txt
5. Z. Cao, Z. Wang, and E. Zegura, "Rainbow fair queueing: Fair band-width sharing without per-flow state," in Proc. INFOCOM, Tel-Aviv, Israel, Mar. 2000, pp. 922-931.
6. A. Charny, "An algorithm for rate allocation in a packet-switching network with feedback," Master's thesis, Massachusetts Inst. Technol., Comput. Sci. Div., Cambridge, MA, 1994.
7. A. Clerget and W. Dabbous, "Tag-based unified fairness," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, pp. 498-507.
8. M. E. Crovella and A. Bestavros, "Self-similarity in World-Wide Web traffic evidence and possible causes," in Proc. ACM SIGMETRICS, Philadelphia, PA, May 1996, pp. 160-169.
9. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," J. Internets. Res. Experience, pp. 3-26, Oct. 1990.
10. S. Fahmy, R. Jain, S. Kalyanaraman, R. Goyal, and B. Vandalore, "On determining the fair bandwidth share for ABR connections in ATM networks," in Proc. IEEE Int. Conf. Communications (ICC), vol. 3, Atlanta, GA, June 1998, pp. 1485-1491.
11. S. Floyd and K. Fall, "Promoting the use of end-to-end congestion control in the Internet," IEEE/ACM Trans. Networking, vol. 7, pp. 458-472, Aug. 1999.
12. S. Floyd and V. Jacobson, "Random early detection for congestion avoidance," IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, July 1993.
13. _, "Link-sharing and resource management models for packet networks," IEEE/ACM Trans. Networking, vol. 3, pp. 365-386, Aug. 1995.
14. S. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM, Toronto, ON, Canada, June 1994, pp. 636-646.
15. P. Gupta and N. McKeown, "Packet classification on multiple fields," in Proc. ACM SIGCOMM, Sept. 1999, pp. 147-160.
16. V. Jacobson, "Congestion avoidance and control," in Proc. ACM SIGCOMM, Aug. 1988, pp. 314-329.
17. J. Jaffe, "Bottleneck flow control," IEEE Trans. Commun., vol. 29, pp. 954-962, July 1981.
18. R. Jain, S. Kalyanaraman, R. Goyal, S. Fahmy, and R. Viswanathan, "ERICA switch algorithm: A Complete description," ATM Forum, 96-1172, 1996.
19. T. V. Lakshman and D. Stiliadis, "High speed policy-based packet forwarding using efficient multi-dimensional range matching," in Proc. ACM SIGCOMM, Vancouver, BC, Canada, Sept. 1998, pp. 203-214.
20. D. Lin and R. Morris, "Dynamics of random early detection," in Proc. ACM SIGCOMM, Cannes, France, Oct. 1997, pp. 127-137.
21. R. Mahajan, S. Floyd, and D. Whaterall, "Controlling high-bandwidth flows at the congested route," in Proc. IEEE Int. Conf. Network Protocols, Riverside, CA, Nov. 2001, pp. 192-201.
22. S. McCanne, "Scalable compression and transmission of Internet multicast video," Ph.D. dissertation, Comput. Sci. Div., Univ. California, Berkeley, 1996.
23. J. Nagle, "On packet switches with infinite storage," IEEE Trans. Commun., vol. 35, pp. 435-438, Apr. 1987.
24. Ucb/lbnl/vint Network Simulator-ns (Version 2) [Online]. Available: http://www-mash.cs.berkeley.edu/ns/
25. R. Pan, B. Prabhakar, and K. Psounis, "CHOKe-A stateless active queue management scheme for approximating fair bandwidth allocation," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 942-951.
26. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control-The single node case," IEEE/ACM Trans. Networking, vol. 1, pp. 344-357, June 1993.
27. L. Roberts, "Enhanced PRCA (proportional rate control algorithm)," ATM Forum, 94-0735R1, 1994.
28. S. Shenker, "Making greed work in networks: A game theoretical analysis of switch service disciplines," in Proc. ACM SIGCOMM, London, U.K., Aug. 1994, pp. 47-57.
29. M. Shreedhar and G. Varghese, "Efficient fair queueing using deficit round robin," in Proc. ACM SIGCOMM, Boston, MA, Sept. 1995, pp. 231-243.
30. K. Y. Siu and H. Y. Tzeng, "Intelligent congestion control for ABR service in ATM networks," Dept. Electr. Comput. Eng., Univ. California, Irvine, CA, Tech. Rep. 1102, 1994.
31. V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," in Proc. ACM SIGCOMM, Cambridge, MA, Sept. 1999, pp. 135-146.
32. V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel, "Fast scalable algorithms for level four switching," in Proc. ACM SIGCOMM, BC, Canada, Sept. 1998, pp. 191-202.
33. D. Stilliadis and A. Varma, "Efficient fair queueing algorithms for packet-switched networks," IEEE/ACM Trans. Networking, vol. 6, pp. 175-185, Apr. 1998.
34. I. Stoica, S. Shenker, and H. Zhang, "Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks," Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-98-136, 1998.
35. N. Venkitaraman, J. Mysore, R. Srikant, and R. Barnes, "Stateless prioritized fair queueing," SPFQ, draft-venkitaraman-diffserv-spfq-00.txt, 2000.
36. Z. Wang, "User-share differentiation (USD) scalable bandwidth allocation for differentiated services," IETF, draft-wang-diff-serv-usd-00.txt, 1998.