An optimal online algorithm for packet scheduling with agreeable deadlines
From MaRDI portal
Recommendations
- Online scheduling of packets with agreeable deadlines
- A -competitive algorithm for scheduling packets with deadlines
- A comprehensive study of an online packet scheduling algorithm
- A comprehensive study of an online packet scheduling algorithm
- Improved online algorithms for buffer management in QoS switches
Cited in
(20)- Online buffer management for transmitting packets with processing cycles
- Comparison-based buffer management in QoS switches
- Collecting weighted items from a dynamic queue
- A universal randomized packet scheduling algorithm
- Improved randomized online scheduling of intervals and jobs
- Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
- Online packet scheduling with bounded delay and lookahead
- The loss of serving in the dark
- Online scheduling of packets with agreeable deadlines
- Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
- A comprehensive study of an online packet scheduling algorithm
- A Constant Approximation Algorithm for Scheduling Packets on Line Networks
- An optimal lower bound for buffer management in multi-queue switches
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
- A -competitive algorithm for scheduling packets with deadlines
- Optimally Handling Commitment Issues in Online Throughput Maximization
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- Buffer management for colored packets with deadlines
- Randomized competitive algorithms for online buffer management in the adaptive adversary model
This page was built for publication: An optimal online algorithm for packet scheduling with agreeable deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921743)
