SI-WF2Q: WF2Q approximation with small constant execution overhead

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Karsten, Martin ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PROGRAM PROCESSORS; SCHEDULING; TELECOMMUNICATION TRAFFIC; TIME SHARING SYSTEMS;

APPROXIMATION SCHEDULER; GENERAL PROCESSOR SHARING; OPTIMAL DELAY; TIMER MAINTENANCE;

QUEUEING THEORY;

EID: 39049119904     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.268     Document Type: Conference Paper

References (29)

1. 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 Transactions on Networking, vol. 1, no. 3, pp. 344-357, June 1993.
2. S. Shenker, C. Partridge, and R. Guerin, "RFC 2212 - Specification of Guaranteed Service," Sept. 1997.
3. J. C. R. Bennett, K. Benson, A. Charny, and J.-Y. L. William F. Courtney, "Delay Jitter Bounds and Packet Scale Rate Guarantee for Expedited Forwarding," IEEE/ACM Transactions on Networking, vol. 10, no. 4, pp. 529-540, Aug. 2002.
4. P. Goyal and H. M. Vin, "Generalized Guaranteed Rate Scheduling Algorithms: A Framework," IEEE/ACM Transactions on Networking, vol. 5, no. 4, pp. 561-571, Aug. 1997.
5. A. K. Parekh and R. G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case," IEEE/ACM Transactions on Networking, vol. 2, no. 2, pp. 137-150, Apr. 1994.
6. D. Stiliadis and A. Varma, "Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms," IEEE/ACM Transactions on Networking, vol. 6, no. 5, pp. 611-624, Oct. 1998.
7. S. J. Golestani, "A Self-Clocked Fair Queuing Scheme for Broadband Applications," in Proceedings of INFOCOM 1994. IEEE, June 1994, pp. 636-646.
8. A. K. Parekh, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks," Ph.D. dissertation, Massachusetts Institute of Technology, Feb. 1992.
9. 2Q: Worst-case Fair Weighted Fair Queueing," in Proceedings of INFOCOM 1996. IEEE, Mar. 1996, pp. 120-128.
10. S. Suri, G. Varghese, and G. Chandranmenon, "Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness," in Proceedings of INFOCOM 1997. IEEE, Apr. 1997, pp. 557-565, technical report with full proofs available at http://citeseer.ist.psu. edu/74110.html.
11. H. Sariowan, R. L. Cruz, and G. Polyzos, "SCED: A Generalized Scheduling Policy for Guaranteed Quality of Service," IEEE/ACM Transactions on Networking, vol. 7, no. 5, pp. 669-684, Oct. 1999.
12. I. Stoica, H. Zhang, and T. S. E. Ng, "Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Service," ACM Computer Communication Review, vol. 27, no. 4, pp. 249-262, Oct. 1997, Proceedings of SIGCOMM 1997.
13. A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm," ACM Computer Communication Review, vol. 19, no. 4, pp. 1-12, Sept. 1989, Proceedings of SIGCOMM 1989.
14. L. Zhang, "Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks," ACM Computer Communication Review, vol. 20, no. 4, pp. 19-29, Sept. 1990, Proceedings of SIGCOMM 1990.
15. P. Goyal, S. S. Lam, and H. Vin, "Determining End-to-End Delay Bounds in Heterogeneous Networks," in Network and Operating System Support for Digital Audio and Video, 5th International Workshop, NOSSDAV'95, Durham, New Hampshire, USA. Springer LNCS 1018, Apr. 1995, pp. 287-298.
16. D. Stiliadis and A. Varma, "A General Methodology for Designing Efficient Traffic Scheduling and Shaping Algorithms," in Proceedings of INFOCOM 1997. IEEE, Apr. 1997, pp. 326-335.
17. J. C. R. Bennett and H. Zhang, "Hierarchical Packet Fair Queueing Algorithms," IEEE/ACM Transactions on Networking, vol. 5, no. 5, pp. 675-689, Oct. 1997.
18. P. van Emde Boas, R. Kass, and E. Zijlstra, "Design and Implementation of an Efficient Priority Queue," Mathematical Systems Theory, vol. 10, pp. 99-127, 1977.
19. G. Varghese and A. Lauck, "Hashed and Hierarchical Timing Wheels: Data Structures for the Efficient Implementation of a Timer Facility," Operating Systems Review Special Issue: Proceedings of the Eleventh Symposium on Operating Systems Principles, Austin, TX, USA, vol. 21, no. 5, pp. 25-38, Nov. 1987.
20. D. Stiliadis and A. Varma, "Efficient Fair-Queueing Algorithms for Packet-Switched Networks," IEEE/ACM Transactions on Networking, vol. 6, no. 2, pp. 175-185, Apr. 1998.
21. P. Valente, "Exact GPS Simulation with Logarithmic Complexity, and its Application to an Optimally Fair Scheduler," ACM Computer Communication Review, vol. 34, no. 4, pp. 269-280, Oct. 2004, Proceedings of SIGCOMM 2004.
22. Q. Zhao and J. Xu, "On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling," in Proceedings of INFOCOM 2004. IEEE, Mar. 2004.
23. J. Xu and R. J. Lipton, "On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms," ACM Computer Communication Review, vol. 32, no. 4, pp. 279-292, Oct. 2002, Proceedings of SIGCOMM 2002.
24. D. C. Stephens, J. C. Bennett, and H. Zhang, "Implementing Scheduling Algorithms in High-Speed Networks," IEEE Journal on Selected Areas in Communications, vol. 17, no. 6, pp. 1145-1158, June 1999.
25. G. Chuanxiong, "SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks," ACM Computer Communication Review, vol. 31, no. 4, pp. 211-222, Oct. 2001, Proceedings of SIGCOMM 2001.
26. S. Ramabhadran and J. Pasquale, "Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay," ACM Computer Communication Review, vol. 33, no. 4, pp. 239-250, Oct. 2003, Proceedings of SIGCOMM 2003.
27. X. Yuan and Z. Duan, "FRR: a Proportional and Worst-Case Fair Round Robin Scheduler," in Proceedings of INFOCOM 2005. IEEE, Apr. 2005.
28. B. Caprita, J. Nieh, and W. C. Chan, "Group Round Robin: Improving the Fairness and Complexity of Packet Scheduling," in Proceedings of the 2005 Symposium on Architecture for Networking and Communications Systems. ACM Press, Oct. 2005, pp. 29-40.
29. 2Q Approximation with Small Constant Execution Overhead - Extended Version," University of Waterloo, Tech. Rep. CS-2006-01, Jan. 2006.