Efficient fair queuing using deficit round-robin

IEEE/ACM Transactions on Networking

Volumn 4, Issue 3, 1996, Pages 375-385

  Shreedhar, M ^b   Varghese, George ^a,c  

^a IEEE

^b MICROSOFT   (United States)

^c WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER NETWORKS; DATA TRANSFER; GATEWAYS (COMPUTER NETWORKS); NETWORK PROTOCOLS;

DEFICIT ROUND-ROBIN; DISTRIBUTED QUEUES; FAIR QUEUING;

PACKET NETWORKS;

EID: 0030171894     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.502236     Document Type: Article

References (18)

1. H. Adiseshu, G. Parulkar, and G. Varghese, "Reliable FIFO load balancing over multiple FIFO channels," Washington Univ., St. Louis, MO, Tech. Rep. 95-11, available by FTP.
2. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. Cambridge, MA/New York: MIT Press/McGraw-Hill, 1990.
3. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," in Proc. SIGCOMM'89, vol. 19, no. 4, Sept. 1989, pp. 1-12.
4. N. Figuera and J. Pasquale, "Leave-in-time: A new service discipline for real-time communication in a packet-switching data network," in Proc. SIGCOMM'95, Sept. 1995.
5. S. Floyd, "Notes on guaranteed service in resource management," Unpublished note, 1993.
6. _, Personal communication. 1993.
7. S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet networks," IEEE/ACM Trans. Networking, Aug. 95.
8. A. Greenberg and N. Madras, "How fair is fair queueing?" in Proc. Performance'90, 1990.
9. S. Golestani, "A self clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOMM'94, 1994.
10. R. Jain and S. Routhier, "Packet trains measurement and a new model for computer network traffic," IEEE J. Select. Areas Commun., Sept. 1986.
11. S. Keshav, "On the efficient implementation of fair queueing," in Internetworking: Research and Experience, vol. 2, Sept. 1991, pp. 157-173.
12. P. McKenney, "Stochastic fairness queueing," in Internetworking: Research and Experience, vol. 2, Jan. 1991, pp. 113-131.
13. John Nagle, "On packet switches with infinite storage," IEEE Trans. Commun., vol. COM-35, no. 4, Apr. 1987.
14. A. K. Parekh and R. G. Gallagher, "A generalized processor sharing approach to flow control in integrated services networks," in Proc. IEEE INFOCOMM'93, 1993.
15. D. Saha and M. Saksena and S. Mukherjee, and S. Tripathi, "On guaranteed delivery of time-critical messages in DQDB," in Proc. IEEE INFOCOMM'94, 1994.
16. M. Shreedhar, "Efficient fair queuing using deficit round robin," M.S. Thesis, Dept. of Computer Science, Washington Univ., St. Louis, MO, Dec. 1994.
17. M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round robin," Previous version of this paper, in Proc. SIGCOMM'95, Boston, MA, Aug. 1995.
18. L. Zhang, "Virtual clock: A new traffic control algorithm for packet switched networks," ACM Trans. Comput. Syst., vol. 9, no. 2, pp. 101-125, May 1991.