Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler

Computer Communication Review

Volumn 34, Issue 4, 2004, Pages 269-280

  Valente, Paolo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Computational Complexity; Data Structures; Packet Scheduling; Quality of Service

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; LOGARITHMIC AMPLIFIERS; PACKET NETWORKS; PROGRAM PROCESSORS; QUALITY OF SERVICE; REAL TIME SYSTEMS; SCHEDULING;

GENERALIZED PROCESSOR SHARING (GPS); LOGARITHMIC COMPLEXITY; PACKET SCHEDULING; REAL-TIME ADAPTIVE APPLICATION;

QUEUEING NETWORKS;

EID: 21844438294     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1030194.1015497     Document Type: Conference Paper

References (24)

1. A. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control - the single node case", in Proceedings of INFOCOM '92, 1992.
2. D. Stiliadis and A.Varma, "Rate-proportional servers: 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, 1996.
4. I. Stoica, H. Abdel-Wahab. "Earliest Eligible Virtual Deadline First: A Flexible and Accurate Mechanism for Proportional Share Resource Allocation", in Technical Report 95-22, Department of Computer Science, Old Dominion University, November 1995.
5. J. C. R. Bennett e H.Zhang, "Hierarchical packet fair queueing algorithms", in Proceedings of ACM SIGMETRICS '96, 1996.
6. D. Stiliadis and A. Varma, "Efficient Fair Queueing Algorithms for Packet Switched Networks," in IEEE/ACM Transactions on Networking, 1998.
7. D. Stiliadis and A. Varma, "A general methodology for designing efficient traffic scheduling and shaping algorithms", in IEEE INFOCOM'97, 1997.
8. S. Suri, G. Varghese and G. Chandramenon, "Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness", in Proceedings of IEEE INFOCOM'97, 1997.
9. S. Golestani. "A self-clocked fair queueing scheme for broadband applications", in Proceedings of IEEE INFOCOM'94, 1994.
10. P. Goyal, H.M. Vin, and H. Chen. "Start-time Fair Queueing: A scheduling algorithm for integrated services." In Proceedings of the SIGCOMM 96, 1996.
11. M. Shreedhar and G. Varghese. "Efficient fair queueing using deficit round robin", in Proceedings of SIGCOMM'95, 1995.
12. C. Waldspurger. "Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management", PhD thesis, Massachusetts Inst. of Technology, 1995.
13. J. Xu and R. J. Lipton. "On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms", in Proceedings of ACM SIGCOMM '02, 2002.
14. A. G. Greenberg and N. Madras, "How Fair is Fair Queueing?", Journal of the Association for Computing Machinery 39, 1992.
15. Qi Zhao, Jun Xu, "On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling", in Proceedings of IEEE INFOCOM'04, 2004.
16. D. E. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, 1973.
17. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. The MIT Press, 1991.
18. L. Devroye. "A note on the average depth of tries", in Computing, 28:367-371, 1982.
19. D.C. Stephens, J.C. Bennett and H. Zhang, "Implementing scheduling algorithms in high-speed networks" in IEEE JSAC Special Issue on High Performance Switches/Routers, 1999.
20. V. Firoiu, J. Le Boudec, D. Towsley, Z. Zhang. "Advances in Internet Quality of Service", Technical report DSC200149, EPFL-DI-ICA, October 2001.
21. 〈www.isi.edu/nsnam/ns/〉.
22. 〈advanced.comms.agilent.com/insight/2001-08/Questions/traffic_gen. htm〉.
23. 〈www.cisco.com〉.
24. 〈www-tkn.ee.tu-berlin.de/research/trace/trace.html〉.