Title:
On the Computational Complexity of Maintaining GPS Clock and Providing Tight Delay Bounds in Packet Schedule

dc.contributor.author Xu, Jun en_US
dc.contributor.author Zhao, Qi
dc.date.accessioned 2005-06-17T17:36:53Z
dc.date.available 2005-06-17T17:36:53Z
dc.date.issued 2003 en_US
dc.description.abstract Packet scheduling is an important mechanism for providing QoS guarantees in data networks. A scheduling algorithm in general consists of two functions: one estimates how the GPS (General Processor Sharing) clock progresses with respect to the real time, and the other decides the order of serving the packets based on the estimation of their GPS start/finish times. In this work, we answer important open questions concerning the computational complexity of performing both functions. The first part of our work systematically studies the complexity of computing the GPS virtual start/finish times of the packets, which is long believed to be Ω(n) per packet but has never been proved or explicitly refuted. It also answers several other related open questions such as “whether the complexity can be lower if we only want to compute the relative order of the GPS finish times of the packets rather than their exact values?” The second part of our work studies the inherent complexity for scheduling algorithms to guarantee tight delay bounds. We extend the prior work by Xu and Lipton to a stronger and more practical computational model and explore related issues. We show rigorously that existing methodologies used in prior work will not be suitable for establishing lower bound results under the new model. en_US
dc.format.extent 182229 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/6502
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.relation.ispartofseries CC Technical Report; GIT-CC-03-20 en_US
dc.subject Quality of service
dc.subject Packet scheduling algorithms
dc.subject Delay bounds
dc.subject Computational complexity
dc.subject Linear decision tree
dc.subject General processor sharing
dc.title On the Computational Complexity of Maintaining GPS Clock and Providing Tight Delay Bounds in Packet Schedule en_US
dc.type Text
dc.type.genre Technical Report
dspace.entity.type Publication
local.contributor.corporatename College of Computing
local.relation.ispartofseries College of Computing Technical Report Series
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication 35c9e8fc-dd67-4201-b1d5-016381ef65b8
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GIT-CC-03-20.pdf
Size:
177.96 KB
Format:
Adobe Portable Document Format
Description: