A near-optimal memoryless online algorithm for FIFO buffering two packet classes

DOI10.1016/J.TCS.2011.11.039zbMath1352.68290OpenAlexW2170955173MaRDI QIDQ391237

Fei Li

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.039

zbMATH Keywords

competitive analysisbuffer managementonline algorithmpacket scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved competitive guarantees for QoS buffering
• Lower and upper bounds on FIFO buffer management in QoS switches
• Loss-bounded analysis for differentiated services
• Buffer Overflow Management in QoS Switches
• Improved online algorithms for buffer management in QoS switches
• Optimal smoothing schedules for real-time streams
• Nearly optimal FIFO buffer management for DiffServ

This page was built for publication: A near-optimal memoryless online algorithm for FIFO buffering two packet classes