Non-preemptive buffer management for latency sensitive packets

DOI10.1007/s10951-016-0474-0zbMath1375.90076OpenAlexW2331271457MaRDI QIDQ2400042

Joseph (Seffi) Naor, Moran Feldman

Publication date: 25 August 2017

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0474-0

zbMATH Keywords

online algorithmsdual fittinglatency sensitive packetsnon-preemptive buffering problems

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Communication networks in operations research (90B18)

Related Items (2)

Non-preemptive buffer management for latency sensitive packets ⋮ A polynomial-time approximation scheme for the airplane refueling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower and upper bounds on FIFO buffer management in QoS switches
• Online scheduling with partial job values: does timesharing or randomization help?
• A universal randomized packet scheduling algorithm
• Non-preemptive buffer management for latency sensitive packets
• Online scheduling of packets with agreeable deadlines
• Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
• Improved online algorithms for buffer management in QoS switches
• STACS 2004
• Management of multi-queue switches in QoS networks

This page was built for publication: Non-preemptive buffer management for latency sensitive packets