Online packet scheduling with bounded delay and lookahead

DOI10.4230/LIPICS.ISAAC.2016.21MaRDI QIDQ4636503zbMATH OpenFDO

Authors Martin Böhm, Łukasz Jeż, Fei Li, Jiří Sgall, Pavel Veselý, Marek Chrobak

Publication date 19 April 2018

Full work available at URL https://arxiv.org/abs/1606.09395

zbMATH Keywords

buffer managementonline algorithmonline schedulinglookahead

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Online packet scheduling with bounded delay and lookahead
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• Online scheduling of packets with agreeable deadlines
• A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue

Cited in

(8)

• A Constant Approximation Algorithm for Scheduling Packets on Line Networks
• A \(\phi\)-competitive algorithm for scheduling packets with deadlines
• Online scheduling of packets with agreeable deadlines
• A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• Online packet scheduling with bounded delay and lookahead
• Packetized MPC with dynamic scheduling constraints and bounded packet dropouts

This page was built for publication: Online packet scheduling with bounded delay and lookahead

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636503)