Competitive buffer management with packet dependencies
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2079410 (Why is no real title available?)
- Adversarial queuing theory
- Algorithms and Computation
- Automata, Languages and Programming
- Buffer Overflow Management in QoS Switches
- Competitive queue policies for differentiated services
- Lower and upper bounds on FIFO buffer management in QoS switches
- On the complexity of approximating \(k\)-set packing
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Optimal smoothing schedules for real-time streams (extended abstract)
- Priority encoding transmission
- Rate vs. buffer size -- greedy information gathering on the line
- The network as a storage device: dynamic routing with bounded buffers
- The zero-one principle for switching networks
Cited in
(13)- Buffer management for packets with processing times
- Optimal buffer management for 2-frame throughput maximization
- TCP is competitive with resource augmentation
- Competitive router scheduling with structured data
- scientific article; zbMATH DE number 2172789 (Why is no real title available?)
- Scheduling multipacket frames with frame deadlines
- Better bounds for online \(k\)-frame throughput maximization in network switches
- Online scheduling with interval conflicts
- Non-preemptive buffer management for latency sensitive packets
- Scheduling multipacket frames with frame deadlines
- STACS 2005
- Scheduling with deadlines and buffer management with processing requirements
- Overflow management with self-eliminations
This page was built for publication: Competitive buffer management with packet dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388119)