Online packet scheduling with bounded delay and lookahead
Authors:
- Martin BöhmMBMartin Böhm
- Marek ChrobakMCMarek Chrobak
- Łukasz JeżŁJŁukasz Jeż
- Fei LiFLFei Li
- Jiří SgallJSJiří Sgall
- Pavel VeselýPVPavel Veselý
- 1 July 2019
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 776, 95-113
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- GA CR (17-09142S)
- GAUK (634217)
- NSF (CCF-1217314, CCF-1536026)
- Polish National Science Center (2016/21/D/ST6/02402)
- NSF (CCF-1216993)
This publication has 8 references indexed in Scilit:
- Considering Suppressed Packets Improves Buffer Management in Quality of Service SwitchesSIAM Journal on Computing, 2012
- A survey of buffer management policies for packet switchesACM SIGACT News, 2010
- Improved online algorithms for buffer management in QoS switchesACM Transactions on Algorithms, 2007
- Online competitive algorithms for maximizing weighted throughput of unit jobsJournal of Discrete Algorithms, 2006
- Buffer Overflow Management in QoS SwitchesSIAM Journal on Computing, 2004
- Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?Algorithmica, 2003
- Online Scheduling with Lookahead: Multipass Assembly LinesINFORMS Journal on Computing, 1998
- On the Influence of Lookahead in Competitive Paging AlgorithmsAlgorithmica, 1997