Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers

IEEE/ACM Transactions on Networking

Volumn 12, Issue 4, 2004, Pages 681-693

  Lenzini, Luciano ^a   Mingozzi, Enzo ^a   Stea, Giovanni ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PACKET NETWORKS; QUALITY OF SERVICE; QUEUEING NETWORKS; SCHEDULING;

ACTIVE LIST QUEUE METHOD; DEFICIT ROUND ROBIN; SCHEDULING ALGORITHMS;

DATA COMMUNICATION SYSTEMS;

EID: 4644299281     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.833131     Document Type: Article

References (27)

1. L. Lenzini, E. Mingozzi, and G. Stea, "Aliquem: A novel DRR implementation to achieve better latency and fairness at O(1) complexity," in Proc. 1Oth Int. Workshop on Quality of Service (IWQoS), Miami Beach, FL, May 2002, pp. 77-86.
2. H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. IEEE, vol. 83, pp. 1374-1396, Oct. 1995.
3. D. Stiliadis and A. Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," IEEE/ACM Trans. Networking, vol. 6, pp. 675-689, Oct. 1998.
4. D. Stiliadis, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," Univ. California, Santa Cruz, Tech. Rep. CRL-95-38, July 1995.
5. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single node case,IEEE/ACM Trans. Networking, vol. 1, pp. 344-357, June 1993.
6. S. J. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM, Toronto, Canada, June 1994, pp. 636-646.
7. M. Shreedhar and G. Varghese, "Efficient fair queueing using deficit round-robin," IEEE/ACM Trans. Networking, vol. 4, pp. 375-385, June 1996.
8. S. Suri, G. Varghese, and G. Chandranmenon, "Leap forward virtual clock: A new fair queueing scheme with guaranteed delay and throughput fairness," in Proc. IEEE INFOCOM, Kobe, Japan, Apr. 1997, pp. 557-565.
9. P. Goyal, H. M. Vin, and H. Cheng, "Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks," IEEE/ACM Trans. Networking, vol. 5, pp. 690-704, Oct. 1997.
10. J. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms," IEEE/ACM Trans. Networking, vol. 5, pp. 675-689, Oct. 1997.
11. F. Toutain, "Decoupled generalized processor sharing: A fair queuing principle for adaptive multimedia applications," in Proc. IEEE INFOCOM, San Francisco, CA, Mar.-Apr. 1998, pp. 291-298.
12. D. Saha, S. Mukherjee, and K. Tripathi, "Carry-over round-robin: A simple cell scheduling mechanism for ATM networks," IEEE/ACM Trans. Networking, vol. 6, pp. 779-796, Dec. 1998.
13. S.-C. Tsao and Y.-D. Lin, "Pre-order deficit round-robin: A new scheduling algorithm for packet switched networks," Comput. Netw., vol. 35, pp. 287-305, Feb. 2001.
14. G. Chuanxiong, "SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks," in Proc. ACM SIGCOMM, San Diego, CA, Aug. 2001, pp. 211-222.
15. A. Francini, F. M. Chiussi, R. T. Clancy, K. D. Drucker, and N. E. Idirene, "Enhanced weighted round-robin schedulers for accurate bandwidth distribution in packet networks," Comput. Netw., vol. 37, pp. 561-578, Nov. 2001.
16. S. S. Kanhere, H. Sethu, and A. B. Parekh, "Fair and efficient packet scheduling using elastic round-robin," IEEE Trans. Parallel Dist. Syst., vol. 13, pp. 324-336, Mar. 2002.
17. L. Lenzini, E. Mingozzi, and G. Stea, "A unifying service discipline for providing rate-based guaranteed and fair queueing services based on the timed token protocol," IEEE Trans. Computers, vol. 51, pp. 1011-1025, Sept. 2002.
18. L. Lenzini, "Packet timed token service discipline: A scheduling algorithm based on the dual-class paradigm for providing QoS in integrated services networks," Comput. Netw., vol. 39, pp. 363-384, July 2002.
19. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, "An architecture for differentiated services," The Internet Society, RFC 2475, Dec. 1998.
20. B. Davie et al., "An expedited forwarding PHB (Per-Hop Behavior ," The Internet Society, RFC 3246, Mar. 2002.
21. A. Charny et al., "Supplemental information for the new definition of the EF PHB (Expedited Forwarding Per-Hop Behavior)," The Internet Society, RFC 3247, Mar. 2002.
22. P. Van Emde Boas, R. Kaas, and E. Zijlstra, "Design and implementation of an efficient priority queue," Math. Syst. Theory, vol. 10, pp. 99-127, 1977.
23. K. Mehlhorn, Data Structures and Algorithms I: Sorting and Searching (EATCS Monographs on Theoretical Computer Science). New York: Springer-Verlag, 1984.
24. A. Brodnik, S. Carlsson, J. Karlsson, and J. I. Munro, "Worst case constant time priority queue," in Proc. 12th ACM/SIAM Symp. Discrete Algorithms, Washington, DC, Jan. 2001, pp. 523-528.
25. The Network Simulator - ns-2, http://www.isi.edu/nsnam/ns/.
26. L. Lenzini, E. Mingozzi, and G. Stea, "Full exploitation of the Deficit Round-Robin capabilities by efficient implementation and parameter tuning," Univ. of Pisa, Italy, Tech. Rep., Oct. 2003.
27. S. S. Kanhere and H. Sethu, "On the latency bound of pre-order deficit round-robin," in Proc. IEEE Conf. Local Computer Networks, Tampa, FL, Nov. 2002, pp. 508-517.