Randomized two-valued bounded delay online buffer management
From MaRDI portal
Publication:2661627
DOI10.1016/j.orl.2021.01.010OpenAlexW3122648061MaRDI QIDQ2661627
Publication date: 7 April 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14715
Cites Work
- Online scheduling with partial job values: does timesharing or randomization help?
- Improved competitive algorithms for online scheduling with partial job values
- A universal randomized packet scheduling algorithm
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Buffer Overflow Management in QoS Switches
- Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
- A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines
- STACS 2004
This page was built for publication: Randomized two-valued bounded delay online buffer management