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

DOI10.1016/J.TCS.2011.11.039zbMATH Open1352.68290OpenAlexW2170955173MaRDI QIDQ391237FDOQ391237

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)

Cites Work

• Lower and upper bounds on FIFO buffer management in QoS switches
• Title not available (Why is that?)
• Buffer Overflow Management in QoS Switches
• Optimal smoothing schedules for real-time streams
• Improved competitive guarantees for QoS buffering
• Title not available (Why is that?)
• Loss-bounded analysis for differentiated services
• Improved online algorithms for buffer management in QoS switches
• Nearly optimal FIFO buffer management for DiffServ

Cited In (3)

• 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)