Scheduling multipacket frames with frame deadlines

We consider scheduling information units called frames, each with a delivery deadline. Frames consist of packets, which arrive online 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. We focus on a “proportional” variant, where the value of each frame is proportional to its size, but the sizes and periods of the frames are arbitrary. We give a constant-competitive algorithm for this setting, assuming bounded jitter and some slack in the frames’ deadlines, the latter of which is necessary. Using standard techniques, our algorithm yields polylog-competitive algorithms for general instances with slack and bounded jitter.

[1]  Sanjoy K. Baruah,et al.  On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.

[2]  Jirí Sgall,et al.  Online Scheduling of Jobs with Fixed Start Times on Related Machines , 2014, Algorithmica.

[3]  Boaz Patt-Shamir,et al.  Competitive buffer management with packet dependencies , 2013, Theor. Comput. Sci..

[4]  Boaz Patt-Shamir,et al.  Overflow management with multipart packets , 2012, Comput. Networks.

[5]  Boaz Patt-Shamir,et al.  Online Set Packing , 2012, SIAM J. Comput..

[6]  Gerhard J. Woeginger,et al.  On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..

[7]  Gabriel Scalosub,et al.  Bounded delay scheduling with packet dependencies , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[8]  Jörg Liebeherr,et al.  Buffer Management for Aggregated Streaming Data with Packet Dependencies , 2013, IEEE Trans. Parallel Distributed Syst..

[9]  Bala Kalyanasundaram,et al.  Maximizing job completions online , 1998, J. Algorithms.

[10]  Joseph Naor,et al.  Efficient online scheduling for deadline-sensitive jobs: extended abstract , 2013, SPAA.

[11]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[12]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[13]  Yossi Azar,et al.  Buffer Management for Packets with Processing Times , 2015, ESA.

[14]  Lukasz Jez,et al.  Online scheduling of bounded length jobs to maximize throughput , 2012, J. Sched..

[15]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.