Online packet scheduling with bounded delay and lookahead
From MaRDI portal
Publication:2419122
DOI10.1016/j.tcs.2019.01.013zbMath1423.68082OpenAlexW2911984265MaRDI QIDQ2419122
Łukasz Jeż, Fei Li, Pavel Veselý, Martin Böhm, Marek Chrobak, Jiří Sgall
Publication date: 29 May 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6790/
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead
Cites Work
- On the influence of lookahead in competitive paging algorithms
- Online scheduling with partial job values: does timesharing or randomization help?
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Online Scheduling with Lookahead: Multipass Assembly Lines
- Buffer Overflow Management in QoS Switches
- Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
- Improved online algorithms for buffer management in QoS switches
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item