See this document in CiteSeerX!

On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling  (Make Corrections)  
Qi (George) Zhao, Jun (Jim) Xu



  Home/Search   Context   Related

 
View or download:
gatech.edu/~jx/reprints/gps_track.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  gatech.edu/~jx/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Packet scheduling is an important mechanism to provide QoS guarantees in data networks. A scheduling algorithm generally consists of two functions: one estimates how the GPS (General Processor Sharing) clock progresses with respect to the real time; the other decides the order of serving packets based on an estimation of their GPS start/finish times. In this work, we answer important open questions concerning the computational complexity of performing the first function. We systematically study ... (Update)

Active bibliography (related documents):   More   All
1.1:   On the Computational Complexity of Maintaining GPS Clock and.. - Xu, Zhao (2003)   (Correct)
0.6:   On the Computational Complexity of Maintaining GPS Clock in.. - Zhao, Xu (2004)   (Correct)
0.2:   Improving Node Behavior in a QoS Control Environment for .. - Wolfinger, Wolf, Le..   (Correct)

Similar documents based on text:   More   All
0.1:   Large-Scale IP Traceback in High-Speed Internet: Practical.. - Li, Sung, Xu, Li (2004)   (Correct)
0.1:   Space-Code Bloom Filter for Efficient Traffic Flow Measurement - Kumar, Xu, Li, Wang (2003)   (Correct)
0.1:   Data Streaming Algorithms for Efficient and Accurate.. - Kumar, Sung, Xu, Wang (2004)   (Correct)

BibTeX entry:   (Update)

@misc{ zhao-computational,
  author = "Qi (George) Zhao and Jun (Jim) Xu",
  title = "On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling",
  url = "citeseer.ist.psu.edu/664609.html" }
Citations (may not include all citations):
1312   A generalized processor sharing approach to flow control in .. (context) - Parekh, Gallager - 1993
790   Analysis and simulation of a fair queueing algorithm (context) - Demers, Keshav et al. - 1990
292   Service disciplines for guaranteed performance service in pa.. - Zhang - 1995
250   A self-clocked fair queueing scheme for broadband applicatio.. (context) - Golestani - 1994
121   Start-time fair queuing: A scheduling algorithm for integrat.. - Goyal, Vin et al. - 1996
108   Introduction to the Theory of Computation (context) - Sipser - 1997
90   or which way to the information age (context) - Turner, in - 1986
90   Latency-rate servers: a general model for analysis of traffi.. - Stiliadis, Varma - 1996
31   Hierarchical packet fair queuing algorithms (context) - Bennett, Zhang - 1997
30   worst-case fair weighted fair queuing (context) - Bennett, Zhang - 1996
18   How fair is fair queuing (context) - Greenberg, Madras - 1992
13   On fundamental tradeoffs between delay bounds and computatio.. - Xu, Lipton - 2002
7   Design and analysis of frame-based fair queuing: A new traff.. (context) - Stiliadis, Varma - 1996
4   Quality of Service Control in High-Speed Networks (context) - Chao, Guo - 2001
2   A lower bound of on linear search programs for the knapsack .. (context) - Dobkin, Lipton - 1978

Documents on the same site (http://www.cc.gatech.edu/~jx/):   More
Cost-Effective Flow Table Designs for High-Speed Routers.. - Xu, Singhal (2002)   (Correct)
Prefix-Preserving IP Address Anonymization.. - Xu, Fan, Ammar, Moon (2002)   (Correct)
Sustaining Availability of Web Services under Distributed Denial.. - Xu, Lee (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC