TY - GEN
T1 - Scheduling multipacket frames with frame deadlines
AU - Jeż, Łukasz
AU - Mansour, Yishay
AU - Patt-Shamir, Boaz
N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - We consider scheduling information units called frames, each with a delivery deadline. Frames consist of packets, which arrive on-line in a roughly-periodic fashion, and compete on allocation of transmission slots. A frame is deemed useful only if all its packets are delivered before its deadline. Using standard techniques, one can derive polylog-competitive algorithms for this model; in this paper we study special cases which allow for better results. Specifically, we present constant-competitive algorithms for two important cases: in one, the value of a frame is proportional to its size and all frames have (roughly) the same period, and in the other, each frame may have its own period but all frames have the same value and size. The former result also implies better polylog-competitive algorithm for the general case.
AB - We consider scheduling information units called frames, each with a delivery deadline. Frames consist of packets, which arrive on-line in a roughly-periodic fashion, and compete on allocation of transmission slots. A frame is deemed useful only if all its packets are delivered before its deadline. Using standard techniques, one can derive polylog-competitive algorithms for this model; in this paper we study special cases which allow for better results. Specifically, we present constant-competitive algorithms for two important cases: in one, the value of a frame is proportional to its size and all frames have (roughly) the same period, and in the other, each frame may have its own period but all frames have the same value and size. The former result also implies better polylog-competitive algorithm for the general case.
UR - https://www.scopus.com/pages/publications/84950349723
U2 - 10.1007/978-3-319-25258-2_6
DO - 10.1007/978-3-319-25258-2_6
M3 - منشور من مؤتمر
SN - 9783319252575
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 76
EP - 90
BT - Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings
A2 - Scheideler, Christian
PB - Springer Verlag
T2 - 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015
Y2 - 14 July 2015 through 16 July 2015
ER -