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

DOI10.1016/J.TCS.2011.11.039MaRDI QIDQ391237zbMATH OpenOpenAlexFDO

Authors 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

buffer managementcompetitive analysisonline algorithmpacket scheduling

Mathematics Subject Classification ID

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

Recommendations

• A near-optimal memoryless online algorithm for FIFO buffering two packet classes
• Nearly optimal FIFO buffer management for two packet classes.
• Nearly optimal FIFO buffer management for DiffServ
• Online buffer management for transmitting packets with processing cycles
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Better online buffer management
• Buffer Overflow Management in QoS Switches
• Improved competitive guarantees for QoS buffering
• Improved online algorithms for buffer management in QoS switches
• Loss-bounded analysis for differentiated services
• Lower and upper bounds on FIFO buffer management in QoS switches
• Nearly optimal FIFO buffer management for DiffServ
• Optimal smoothing schedules for real-time streams

Cited in

(4)

• A near-optimal memoryless online algorithm for FIFO buffering two packet classes
• Randomized two-valued bounded delay online buffer management
• Nearly optimal FIFO buffer management for two packet classes.
• 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

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