A comprehensive study of an online packet scheduling algorithm
From MaRDI portal
Publication:391217
DOI10.1016/j.tcs.2012.06.002zbMath1416.68028OpenAlexW2086268226MaRDI QIDQ391217
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.002
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online scheduling with partial job values: does timesharing or randomization help?
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Buffer Overflow Management in QoS Switches
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
This page was built for publication: A comprehensive study of an online packet scheduling algorithm