Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers

DOI10.1007/978-3-642-02158-9_23zbMath1246.68268OpenAlexW1544216698MaRDI QIDQ3638455

Fei Li

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_23

Mathematics Subject Classification ID

Internet topics (68M11) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Bounded delay packet scheduling in a bounded buffer ⋮ Scheduling packets with values and deadlines in size-bounded buffers

Cites Work

• Online scheduling with partial job values: does timesharing or randomization help?
• Competitive queue policies for differentiated services
• Buffer Overflow Management in QoS Switches
• Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
• Algorithms – ESA 2004
• Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers