Fair, efficient and low-latency packet scheduling using Nested Deficit Round Robin

2001 IEEE Workshop on High Performance Switching and Routing

Volumn , Issue , 2001, Pages 6-10

  Kanhere, Salil S ^a   Sethu, Harish ^a  

^a DREXEL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; QUALITY OF SERVICE; ROUTERS; SCHEDULING; THEOREM PROVING;

NESTED DEFICIT ROUND ROBIN; PACKET SCHEDULING ALGORITHMS;

PACKET NETWORKS;

EID: 0035785078     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. A. Demers, S. Keshav and S. Shenker, "Design and analysis of a fair queuing algorithm," Proceedings of ACM SIGCOMM, pp. 1-12, Austin, TX, September 1989.
2. S.J. Golestani, "A self-clocked fair queueing scheme for broadband applications," Proceedings of IEEE INFOCOM, pp. 634-646, Toronto, June 1994.
3. P. Goyal, H.M. Vin and H. Cheng, "Start-time fair queueing: a scheduling algorithm for integrated services packet switched networks," IEEE Transactions on Networking, Vol. 5, No., pp. 690-704, October 1997.
4. 2Q: worst-case fair weighted fair queueing" Proceedings of IEEE INFOCOM, pp. 120-128, San Francisco, CA, March 1996.
5. M. Shreedhar and George Varghese, "Efficient fair queueing Using deficit round-robin," IEEE Transactions on Networking, Vol. 4, No. 3, pp. 375-385, June 1996.
6. S. Kanhere, A. Parekh and H. Sethu, "Fair and efficient packet scheduling in wormhole networks," Proceedings of IPDPS 2000, pp. 623-631, Cancun, Mexico, May 2000.
7. D. Stiliadis and A. Verma, "Latency-Rate servers: a general model for analysis of traffic scheduling algorithms," IEEE Transactions on Networking, Vol. 6, No. 3, pp. 611-624, October 1996.
8. D. Stiliadis and A. Verma, "Traffic scheduling in packet-switched networks: analysis, design, and implementation," Ph.D dissertation, University of Santa Cruz, California, June 1996.