A comprehensive study of an online packet scheduling algorithm
From MaRDI portal
Recommendations
- A comprehensive study of an online packet scheduling algorithm
- Bounded delay packet scheduling in a bounded buffer
- Online scheduling of packets with agreeable deadlines
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
- Online buffer management for transmitting packets with processing cycles
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- An optimal online algorithm for packet scheduling with agreeable deadlines
- Better online buffer management
- Buffer Overflow Management in QoS Switches
- Considering suppressed packets improves buffer management in QoS switches
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- Online scheduling with partial job values: does timesharing or randomization help?
Cited in
(5)- Bounded delay packet scheduling in a bounded buffer
- Online scheduling of packets with agreeable deadlines
- Online buffer management for transmitting packets with processing cycles
- An optimal online algorithm for packet scheduling with agreeable deadlines
- A comprehensive study of an online packet scheduling algorithm
This page was built for publication: A comprehensive study of an online packet scheduling algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391217)