Extending WF2Q+ to support a dynamic traffic mix

Proceedings - First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications, AAA-IDEA 2005

Volumn 2005, Issue , 2005, Pages 26-33

  Valente, Paolo ^a  

^a SCUOLA SUPERIORE SANT ANNA   (Italy)

Author keywords

Computational complexity; Quality of service; Resource reservation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTERNET; PACKET SWITCHING; QUALITY OF SERVICE; ROUTERS; SERVERS;

DYNAMIC TRAFFIC; RESOURCE RESERVATION; WEB SERVERS;

TELECOMMUNICATION TRAFFIC;

EID: 33947681732     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AAA-IDEA.2005.7     Document Type: Conference Paper

References (13)

1. A. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control - the single node case", in Proceedings of INFOCOM '92, vol. 2, pp. 915-924, 1992.
2. D. Stiliadis and A.Varma, "Rate-proportional flows: A general methodology for fair queueing algorithms", IEEE/ACM Transactions on networking, 1996.
3. 2Q: Worst-case fair weighted fair queueing", in Proceedings of IEEE INFOCOM '96, pp. 120-128, San Francisco, CA, 1996.
4. J. C. R. Bennett e H.Zhang, "Hierarchical packet fair queueing algorithms", in Proceedings of ACM SIGMETRICS '96, pp. 143-156, 1996.
5. D. Stiliadis and A. Varma, "A general methodology for designing efficient traffic scheduling and shaping algorithms", in IEEE INFOCOM'97, Japan, 1997.
6. S. Golestani. "A self-clocked fair queueing scheme for broadband applications", in Proceedings of IEEE INFOCOM'94, pages 636-646, Toronto, CA, 1994.
7. P. Goyal, H.M. Vin, and H. Chen. "Start-time Fair Queueing: A scheduling algorithm for integrated services." In Proceedings of the ACM-SIGCOMM 96, pages 157-168, Palo Alto, CA, August 1996.
8. M. Shreedhar and G. Varghese. "Efficient fair queueing using deficit round robin", in Proceedings of SIGCOMM'95, pages 231-243, Boston, MA, 1995.
9. S. Ramabhadran, J. Pasquale. "Stratified Round Robin: A Low Complexity packet Scheduler with Bandwidth Fairness and Bounded Delay", in Proceedings of ACM SIGCOMM'03, 2003.
10. C. Waldspurger. "Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management", PhD thesis, MIT, 1995.
11. T. H. Cormen, C. E. Leiserson, and Ronald L. Rivest. Introduction to algorithms. The MIT Press, 1991.
12. Stephens, D.C.; Bennett, J.C.; Zhang, H. "Implementing scheduling algorithms in high-speed networks" in IEEE JSAC Special Issue on High Performance Switches/Routers, 1999.
13. P. Valente, "Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler", Proceedings of SIGCOMM'04, 2004.