The following pages link to STACS 2005 (Q5710683):
Displaying 13 items.
- Better bounds for online \(k\)-frame throughput maximization in network switches (Q346256) (← links)
- An optimal lower bound for buffer management in multi-queue switches (Q476433) (← links)
- Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms (Q528490) (← links)
- Buffer management for colored packets with deadlines (Q693758) (← links)
- Randomized competitive algorithms for online buffer management in the adaptive adversary model (Q719250) (← links)
- An experimental study of new and known online packet buffering algorithms (Q973006) (← links)
- The best and worst packet transmission policies (Q1130116) (← links)
- Online packet scheduling for CIOQ and buffered crossbar switches (Q1799227) (← links)
- A universal randomized packet scheduling algorithm (Q2017873) (← links)
- Online packet-routing in grids with bounded buffers (Q2408091) (← links)
- The loss of serving in the dark (Q2680226) (← links)
- Resource Management in Large Networks (Q3637319) (← links)
- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers (Q5458533) (← links)