Implementing scheduling algorithms in high-speed networks

IEEE Journal on Selected Areas in Communications

Volumn 17, Issue 6, 1999, Pages 1145-1158

  Stephens, Donpaul C ^a,b   Bennett, Jon C R ^c,d   Zhang, Hui ^e  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Ascend Communications   (United States)

^c HARVARD UNIVERSITY   (United States)

^d Xylan Corp   (United States)

^e Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); INTERNET; NETWORK PROTOCOLS; PACKET NETWORKS; QUEUEING NETWORKS; ROUTERS; SCHEDULING; SORTING; TELECOMMUNICATION TRAFFIC;

GENERALIZED PROCESSOR SHARING; HIGH SPEED ROUTER; PACKET FAIR QUEUEING ALGORITHMS; VIRTUAL TIME FUNCTION;

VOICE/DATA COMMUNICATION SYSTEMS;

EID: 0032638975     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.772449     Document Type: Article

References (26)

1. J. C. R. Bennett, "Method and a scheduler for controlling when a server provides service to an entity," U.S. Patent 5 828 879, Oct. 1998.
2. _, "Method and a scheduler for controlling when a server provides service with rate control to an entity," U.S. Patent 5 845 115, Dec. 1998.
3. J. C. R. Bennett, D. C. Stephens, and H. Zhang, "High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks," in Proc. IEEE ICNP'97, Atlanta, GA, pp. 7-14.
4. J. C. R. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms, in Proc. ACM-SIGCOMM'96, Palo Alto, CA, pp. 143-156.
5. 2Q: Worst-case fair weighted queueing," in Proc. IEEE INFOCOM'96, San Francisco, CA, pp. 120-128.
6. J. C. R. Bennett, F. Zhou, R. J. Brownhill, and M. N. Gammukhi, "Digital network including mechanism for grouping virtual message transfer paths having similar transfer service rates to facilitate efficient scheduling of transfers thereover," EU Patent EP0800296, Oct. 1997.
7. H. Chao, "Architecture design for regulating and scheduling user's traffic in ATM networks," in Proc. ACM SIGCOMM'92, Baltimore, MD, pp. 77-87.
8. A. Charny, K. K. Ramakrishnan, and A. G. Lauck, "Scalability issues for distributed explicit rate allocation in ATM networks," in IEEE INFOCOM'96, San Francisco, CA, pp. 1198-1205.
9. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," J. Internetworking Res. Experience, pp. 3-26, Oct. 1990.
10. S. J. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOMM'94, Toronto, Canada, pp. 636-646.
11. P. Goyal, H. M. Vin, and H. Chen, "Start-time fair queueing: A scheduling algorithm for integrated services," in Proc. ACM-SIGCOMM'96, Palo Alto, CA, pp. 157-168.
12. S. Keshav, "A control-theoretic approach to flow control," in Proc. ACM SIGCOMM'91, Zurich, Switzerland, pp. 3-15.
13. A. Parekh, "A generalized processor sharing approach to flow control in integrated services networks," Ph.D. dissertation, MIT, Cambridge, MA, Feb. 1992.
14. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control - The single node case," IEEE/ACM Trans. Networking, vol. 1, pp. 344-357, June 1993.
15. J. L. Rexford, A. G. Greenberg, and F. G. Bonomi, "Hardware-efficient fair queueing architectures for high-speed networks," in IEEE INFOCOM'96, San Francisco, CA, pp. 638-646.
16. S. Suri, G. Varghese, and G. Chandranmenon, "Leap forward virtual clock," in Proc. INFOCOMM '97, Kobe, Japan, pp. 557-565.
17. H. Sariowan, R. L. Cruz, and G. C. Polyzos, "Scheduling for quality of service guarantees via service curves," in Proc. Int. Conf. Computer Commun. and Networks (ICCN) 1995, pp. 512-520.
18. S. Shenker, "Making greed work in networks: A game theoretical analysis of switch service disciplines," in Proc. ACM SIGCOMM '94, London, U.K., pp. 47-57.
19. M. Shreedhar and G. Varghese, "Efficient fair queueing using deficit round robin," in Proc. SIGCOMM'95, Boston, MA, pp. 231-243.
20. D. Stiliadis and A. Varma, "Design and analysis of frame-based fair queueing: A new traffic scheduling algorithm for packet-switched networks," in Proc. ACM SIGMETRICS'96, pp. 104-115.
21. _, "A general methodology for designing efficient traffic scheduling and shaping algorithms," in Proc. IEEE INFOCOM'97, Kobe, Japan.
22. I. Stoica, H. Abdel-Wahab, K. Jeffay, S. Baruah, J. Gehrke, and G. Plaxton, "A proportional share resource allocation for real-time, time-shared systems," in Proc. IEEE RTSS '96, pp. 288-289.
23. I. Stoica, H. Zhang, and T. S. E. Ng, "A hierarchical fair service curve algorithm for link-sharing, real-time and priority services," in Proc. ACM-SIGCOMM 97, Cannes, France, Aug. 1997.
24. G. R. Wright and W. R. Stevens, TCP/IP Illustrated Volume 2: The Implementation. Reading, MA: Addison-Wesley, ch. 24, 1995, pp. 807-812.
25. G. G. Xie and S. S. Lam, "An efficient channel scheduler for real-time traffic," Univ. Texas, Austin, Tech. Rep. TR-95-29, July 1995.
26. H. Zhang and D. Ferrari, "Rate-controlled service disciplines," J. High Speed Networks, vol. 3, no. 4, pp. 389-412, 1994.