• Login
    View Item 
    •   SMARTech Home
    • College of Computing (CoC)
    • College of Computing Technical Reports
    • View Item
    •   SMARTech Home
    • College of Computing (CoC)
    • College of Computing Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

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

    Thumbnail
    View/Open
    GIT-CC-03-20.pdf (177.9Kb)
    Date
    2003
    Author
    Xu, Jun
    Zhao, Qi
    Metadata
    Show full item record
    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.
    URI
    http://hdl.handle.net/1853/6502
    Collections
    • College of Computing Technical Reports [506]

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Statistics

    View Usage StatisticsView Google Analytics Statistics
    facebook instagram twitter youtube
    • My Account
    • Contact us
    • Directory
    • Campus Map
    • Support/Give
    • Library Accessibility
      • About SMARTech
      • SMARTech Terms of Use
    Georgia Tech Library266 4th Street NW, Atlanta, GA 30332
    404.894.4500
    • Emergency Information
    • Legal and Privacy Information
    • Human Trafficking Notice
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    © 2020 Georgia Institute of Technology