Efficient fair queuing using deficit round robin

Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM 1995

Volumn , Issue , 1995, Pages 231-242

  Shreedhar, M ^a   Varghese, George ^b  

^a MICROSOFT   (United States)

^b WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; INTERNET PROTOCOLS; QUEUEING THEORY; ROUTERS;

DEFICIT ROUND ROBIN; DISTRIBUTED QUEUE; FAIR QUEUING; FAIR SHARE; NETWORK DEVICES; NETWORK RESOURCE; NUMBER OF ACTIVE FLOWS; SCHEDULING PROBLEM;

NETWORK ARCHITECTURE;

EID: 85013295511     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/217382.217453     Document Type: Conference Paper

References (15)

1. H. Adiseshu, G. Parulkar, and G. Varghese. Reliable FIFO Load Balancing over Multiple FIFO Channels. Washington University Technical Report 95-11, available by FTP.
2. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
3. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Proc. Sigcomm'89, 19(4):1-12, September 1989.
4. S. Floyd. Notes on guaranteed service in resource management. Unpublished note. 1993.
5. S. Floyd. Personal communication. 1993.
6. A. Greenberg and N. Madras. How fair is fair queueing. In Proc. Performance'90, 1990.
7. S. Golestani. A self clocked fair queueing scheme for broadband applications. In Proc. IEEE Infocomm'94, 1994.
8. R. Jain and S. Routhier. Packet trains measurement and a new model for computer netwoek traffic. IEEE Journal on Selected Areas in Communications, Sept. 1986.
9. S. Keshav. On the efficient implementation of fair queueing. In Internetworking: Research and Experience Vol. 2, 157-173, September 1991.
10. P. McKenney. Stochastic fairness queueing. In Internetworking: Research and Experience Vol. 2, 113-131, January 1991.
11. John Nagle. On packet switches with infinite storage. IEEE Trans. on Comm., COM-35(4), April 1987.
12. A. K. Parekh and R. G. Gallagher. A generalized processor sharing approach to flow control in integrated services networks. In Proc. IEEE Infocomm'93.
13. 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.
14. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28(2):202-208, 1985.
15. L. Zhang. Virtual clock: A new traffic control algorithm for packet switched networks. ACM Trans. on Computer Systems, 9(2):101-125, May 1991.