A phi-COMPETITIVE ALGORITHM FOR SCHEDULING PACKETS WITH DEADLINES
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10455543" target="_blank" >RIV/00216208:11320/22:10455543 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=WQsK0c3KUK" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=WQsK0c3KUK</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/21M1469753" target="_blank" >10.1137/21M1469753</a>
Alternative languages
Result language
angličtina
Original language name
A phi-COMPETITIVE ALGORITHM FOR SCHEDULING PACKETS WITH DEADLINES
Original language description
In the online packet scheduling problem with deadlines (PacketSchD, for short), the goal is to schedule transmissions of packets that arrive over time in a network switch and need to be sent across a link. Each packet has a deadline, representing its urgency, and a nonnegative weight, which represents its priority. Only one packet can be transmitted in any time slot, so if the system is overloaded, some packets will inevitably miss their deadlines and be dropped. In this scenario, the natural objective is to compute a transmission schedule that maximizes the total weight of packets that are successfully transmitted. The problem is inherently online, with the scheduling decisions made without the knowledge of future packet arrivals. The central problem concerning PacketSchD that has been a subject of intensive study since 2001 is to determine the optimal competitive ratio of online algorithms, namely the worst-case ratio between the optimum total weight of a schedule (computed by an offline algorithm) and the weight of a schedule computed by a (deterministic) online algorithm. We solve this open problem by presenting a phi-competitive online algorithm for PacketSchD (where phi approximate to 1.618 is the golden ratio), matching the previously established lower bound.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
SIAM Journal on Computing
ISSN
0097-5397
e-ISSN
1095-7111
Volume of the periodical
51
Issue of the periodical within the volume
5
Country of publishing house
US - UNITED STATES
Number of pages
66
Pages from-to
1626-1691
UT code for WoS article
000883719100006
EID of the result in the Scopus database
2-s2.0-85142063199