Bounded delay packet scheduling in a bounded buffer

DOI10.1016/j.orl.2010.05.012zbMath1202.90133OpenAlexW1984915031MaRDI QIDQ613334

Stanley P. Y. Fung

Publication date: 20 December 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.05.012

zbMATH Keywords

schedulingonline algorithmsbuffer management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Scheduling packets with values and deadlines in size-bounded buffers

Cites Work

• Unnamed Item
• Unnamed Item
• Improved competitive guarantees for QoS buffering
• Lower and upper bounds on FIFO buffer management in QoS switches
• Online scheduling with partial job values: does timesharing or randomization help?
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Analysis of queueing policies in QoS switches
• The zero-one principle for switching networks
• Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
• Buffer Overflow Management in QoS Switches
• Automata, Languages and Programming
• Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers
• Management of multi-queue switches in QoS networks

This page was built for publication: Bounded delay packet scheduling in a bounded buffer