Scheduling Multipacket Frames with Frame Deadlines

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.

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

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

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

[4]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance [scheduling problems] , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

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

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

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

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

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

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

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

[13]  Boaz Patt-Shamir,et al.  Online set packing and competitive scheduling of multi-part tasks , 2010, PODC '10.