On the computational complexity of maintaining GPS clock in packet scheduling

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2004, Pages 2383-2392

  Zhao, Qi ^a   Xu, Jun ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GPS CLOCK; PACKET SCHEDULING; SCHEDULING ALGORITHMS;

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; GLOBAL POSITIONING SYSTEM; QUALITY OF SERVICE; SCHEDULING;

PACKET NETWORKS;

EID: 8344242918     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. 2q: worst-case fair weighted fair queuing. In IEEE INFOCOM'96, March 1996.
2. J. Bennett and H. Zhang. Hierarchical packet fair queuing algorithms. IEEE/ACM Transactions on Networking, 5:675-689, 1997.
3. H. Chao and X. Guo. Quality of Service Control in High-Speed Networks, Wiley, 2001.
4. A. Deniers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Internetworking: Research and Experience, pages 3-26, 1990.
5. 2 on linear search programs for the knapsack problem. J. Comput. Syst. Sci., 16:413-417, 1978.
6. S. Golestani. A self-clocked fair queueing scheme for broadband applications. In Proc. of lnfocom'94, June 1994.
7. P. Goyal, H. Vin, and H. Cheng. Start-time fair queuing: A scheduling algorithm for integrated servicespacket switching networks. In CS-TR-96-02, Dpet. of Computer Science, Univ. of Texas, Austin, 1996.
8. A. Greenberg and N. Madras. How fair is fair queuing? Journal of the ACM. 39(3):568-598, 1992.
9. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE/ACM Transaction on Networking, 1(3):344-357, June 1993.
10. M. Sipser. Introduction to the Theory of Computation. PWS, 1997.
11. D. Stiliadis and A. Varma. Design and analysis of frame-based fair queuing: A new traffic scheduling algorithm for packet switched networks. In Proc. of ACM Sigmettics '96, pages 104-115, May 1996.
12. D. Stiliadis and A. Varma. Latency-rate servers: a general model for analysis of traffic scheduling algorithms. In Proc. of Infocom'96, March 1996.
13. J. Turner. New directions in communications (or which way to the information age?). IEEE Communications Magazine, 24:8-15, October 1986.
14. J. Xu and R. Lipton. On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. In Proc. of ACM SIGCOMM 2002, August 2002.
15. H. Zhang. Service disciplines for guaranteed performance service in packet switching networks. Proceedings of the IEEE, 83(10), October 1995.