Pre-order Deficit Round Robin: A new scheduling algorithm for packet-switched networks

Computer Networks

Volumn 35, Issue 2-3, 2001, Pages 287-305

  Tsao, Shih Chiang ^a   Lin, Ying Dar ^b  

^a CHUNGHWA TELECOM CO LTD   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Deficit; Fair queueing; Packet scheduling; Round robin

Indexed keywords

EID: 0347034160     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(00)00172-9     Document Type: Article

References (14)

1. A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Trans. Networking (1993) 344-357.
2. 2Q: Worst fair weighted fair queueing, in: Proceedings of the IEEE INFOCOM'96, San Francisco, CA, March 1996, pp. 120-128.
3. S.J. Golestani, A self-clocked fair queueing scheme for broadband applications, in: Proceedings of the INFOCOM'94, April 1994, pp. 636-646.
4. L. Zhang, Virtual Clock: A new traffic control algorithm for packet switching, ACM Trans. Comput Systems 9 (2) (1991) 101-124.
5. M. Shreedhar, G. Varghese, Efficient fair queueing using Deficit Round Robin, IEEE/ACM Trans. Networking 4 (3) (1996) 375-385.
6. D. Stiliadis, A. Varma, Efficient fair queueing algorithms for packet-switched networks, IEEE/ACM Trans. Networking 6 (2) (1998) 175-185.
7. S. Suri, G. Varghese, G. Chandranmenon, Leap forward virtual clock: A new fair queuing scheme with guaranteed delays and throughput fairness, in: Proceedings of the INFOCOM'97, 1997, pp. 557-562.
8. D. Stiliadis, A. Varma, Latency-rate servers: A general model for analysis of traffic scheduling algorithms, IEEE/ACM Trans. Networking 6 (5) (1998) 611-624.
9. N. Matsufuru, R. Aibara, Efficient fair queueing for ATM networks using Uniform Round Robin, in: Proceedings of the INFOCOM'99, 1999, pp. 389-397.
10. M. Katevenis, S. Sidiropoulos, C. Courcoubetis, Weighted Round-Robin cell multiplexing in a general-purpose ATM switch chip, IEEE J. Selected Areas Commun. 9 (8) (1991) 1265-1279.
11. H.M. Chaskar, U. Madhow, Fair scheduling with tunable latency: A Round Robin approach, in: IEEE Globecom'99, 1999, pp. 1328-1333.
12. J.C.R. Bennett, D.C. Stephens, H. Zhang, High speed, scalable, and accurate implementation of fair queueing algorithms in ATM networks, in: Proceedings of the ICNP'97, 1997, pp. 7-14.
13. V. Nageshwara Rao, V. Kumar, Concurrent access of priority queues, IEEE Trans. Comput. 37 (12) (1988) 1657-1665.
14. J.L. Rexford, A.G. Greenberg, F.G. Bonomi, Hardware-efficient fair queueing architectures for high-speed networks, in: Proceedings of the INFOCOM '96, 1996, pp. 638-646.