Breaking the barrier of 2 for the competitiveness of longest queue drop
From MaRDI portal
Cites work
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
- A universal randomized packet scheduling algorithm
- Analysis of queueing policies in QoS switches
- Automata, Languages and Programming
- Better online buffer management
- Buffer Overflow Management in QoS Switches
- Competitive buffer management for shared-memory switches
- Considering suppressed packets improves buffer management in quality of service switches
- Harmonic buffer management policy for shared memory switches
- scientific article; zbMATH DE number 2079410 (Why is no real title available?)
- Improved competitive guarantees for QoS buffering
- Improved online algorithms for buffer management in QoS switches
- Lower and upper bounds on FIFO buffer management in QoS switches
- Management of multi-queue switches in QoS networks
- Maximizing throughput in multi-queue switches
- On the Performance of Greedy Algorithms in Packet Buffering
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Online packet scheduling for CIOQ and buffered crossbar switches
- Online scheduling with partial job values: does timesharing or randomization help?
- Randomized competitive algorithms for online buffer management in the adaptive adversary model
- Scheduling policies for CIOQ switches
This page was built for publication: Breaking the barrier of 2 for the competitiveness of longest queue drop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023535)
