Scheduling multipacket frames with frame deadlines

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)623-634
Number of pages12
JournalJournal of Scheduling
Issue number6
StatePublished - 1 Dec 2017


  • Communication networks
  • Online algorithms
  • Scheduling


Dive into the research topics of 'Scheduling multipacket frames with frame deadlines'. Together they form a unique fingerprint.

Cite this