Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers

DOI10.1007/11785293_4MaRDI QIDQ5757880zbMATH OpenOpenAlexFDO

Authors Nir Levy, Yossi Azar

Publication date 7 September 2007

Published in Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11785293_4

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
• Bounded delay packet scheduling in a bounded buffer
• Online scheduling of packets with agreeable deadlines

Cited in

(9)

• Scheduling multipacket frames with frame deadlines
• Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
• On a buffer problem for packetized voice with an N-periodic strongly interchangeable input process
• Scheduling multipacket frames with frame deadlines
• Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
• Optimal multiplexing on a single link: delay and buffer requirements
• Packetized MPC with dynamic scheduling constraints and bounded packet dropouts
• On the Age of Information With Packet Deadlines
• Bounded delay packet scheduling in a bounded buffer

This page was built for publication: Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757880)