Online buffer management for transmitting packets with processing cycles
From MaRDI portal
Recommendations
Cites work
- An optimal online algorithm for packet scheduling with agreeable deadlines
- Buffer Overflow Management in QoS Switches
- Buffer management for packets with processing times
- Competitive buffer management for shared-memory switches
- Considering suppressed packets improves buffer management in QoS switches
- FIFO queueing policies for packets with heterogeneous processing
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Online scheduling FIFO policies with admission and push-out
- Optimal smoothing schedules for real-time streams
- Optimal smoothing schedules for real-time streams (extended abstract)
- Randomized algorithm for agreeable deadlines packet scheduling
- Searching in the plane
Cited in
(8)- A comprehensive study of an online packet scheduling algorithm
- A near-optimal memoryless online algorithm for FIFO buffering two packet classes
- Non-preemptive buffer management for latency sensitive packets
- A near-optimal memoryless online algorithm for FIFO buffering two packet classes
- Competitive buffer management with packet dependencies
- Scheduling with deadlines and buffer management with processing requirements
- Buffer management for packets with processing times
- Know when to persist: deriving value from a stream buffer (extended abstract)
This page was built for publication: Online buffer management for transmitting packets with processing cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708032)