The following pages link to (Q4471370):
Displayed 20 items.
- Better bounds for online \(k\)-frame throughput maximization in network switches (Q346256) (← links)
- Competitive buffer management with packet dependencies (Q388119) (← 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)
- Lower and upper bounds on FIFO buffer management in QoS switches (Q1016522) (← links)
- Comparison-based buffer management in QoS switches (Q1742380) (← links)
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- Maximizing throughput in multi-queue switches (Q2369876) (← links)
- Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints (Q2392745) (← links)
- Non-preemptive buffer management for latency sensitive packets (Q2400042) (← links)
- Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
- Online competitive algorithms for maximizing weighted throughput of unit jobs (Q2458928) (← links)
- Optimal Buffer Management for 2-Frame Throughput Maximization (Q2868651) (← links)
- Tight Analysis of Priority Queuing for Egress Traffic (Q2942419) (← links)
- Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints (Q3004685) (← links)
- Randomized Algorithms for Buffer Management with 2-Bounded Delay (Q3602832) (← links)
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers (Q3638455) (← links)