Deficits for bursty latency-critical flows: DRR++

IEEE International Conference on Networks, ICON

Volumn , Issue , 2000, Pages 287-293

  MacGregor, M H ^a   Shi, W ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BURSTY ARRIVALS; DEFICIT ROUND ROBIN; FAIR QUEUING; FAIR SHARE; LATENCY BOUNDS; MULTIHOP NETWORKS;

INFORMATION SYSTEMS;

COMPUTER NETWORKS;

EID: 84890326176     PISSN: 15566463     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICON.2000.875803     Document Type: Conference Paper

References (8)

1. Shreedhar, M., and Varghese, G, "Efficient Fair Queuing Using Deficit Round-Robin", IEEE/ACM Trans. Net., Vol. 4, No. 4, June, 1996, p. 386-397.
2. Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., Peterson, L., Ramakrishnan, K., Shenker, S., Wroclawski, J., and Zhang, L., "Recommendations on Queue Management and Congestion Avoidance in the Internet", RFC 2309, April, 1998.
3. Zhang, L., "Virtual clock: A new traffic control algorithm for packet switched networks", ACM Trans. Comput. Syst., Vol. 9, No. 2, May, 1991, p. 101-125.
4. Sauer, C.H, Chandy, K.M., Computer Systems Performance Modeling, Prentice Hall, Englewood Cliffs, N.J., 1981, pages 46-49.
5. Demers, A., Keshav, S., Shenker, S., "Analysis and simulation of a fair queueing algorithm", Proc. ACM SIGCOMM '89, ACM, 1989, pp. 1-12.
6. Guerin, R., Peris, V., "Quality-of-service in packet networks: basic mechanisms and directions", Computer Networks, Vol. 31, No. 3, February 11, 1999, p. 169-189.
7. Stiliadis, D., Varma, A., "Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms", IEEELACM Trans. Networking, Vol. 6, No. 6, Oct., 1998, pp. 611-624.
8. Saha, D., Mukherjee, S., Tripathi, S.K., "Carry-Over Round Robin: A Simple Cell Scheduling Mechanism for ATM Networks", IEEE/ACM Trans. Networking, Vol. 6, No. 6, Dec. 1998, pp.779-796.