Randomized Algorithms for Buffer Management with 2-Bounded Delay
From MaRDI portal
Publication:3602832
Recommendations
- Randomized competitive algorithms for online buffer management in the adaptive adversary model
- One to rule them all: a general randomized algorithm for buffer management with bounded delay
- Bounded delay packet scheduling in a bounded buffer
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- An optimal algorithm for 2-bounded delay buffer management with lookahead
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2079410 (Why is no real title available?)
- Algorithms – ESA 2004
- Buffer Overflow Management in QoS Switches
- Considering suppressed packets improves buffer management in QoS switches
- On the power of randomization in on-line algorithms
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Online scheduling with partial job values: does timesharing or randomization help?
Cited in
(8)- Bounded delay packet scheduling in a bounded buffer
- Randomized two-valued bounded delay online buffer management
- One to rule them all: a general randomized algorithm for buffer management with bounded delay
- Buffered Resource Constraint: Algorithms and Complexity
- Randomized competitive algorithms for online buffer management in the adaptive adversary model
- Comparison-based buffer management in QoS switches
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- An optimal algorithm for 2-bounded delay buffer management with lookahead
This page was built for publication: Randomized Algorithms for Buffer Management with 2-Bounded Delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602832)