An experimental study of new and known online packet buffering algorithms

DOI10.1007/s00453-008-9230-yzbMath1208.68238MaRDI QIDQ973006

Susanne Albers, Tobias Jacobs

Publication date: 28 May 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9230-y

zbMATH Keywords

performance analysis; online algorithm; algorithm engineering; packet buffering; network switch

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W27: Online algorithms; streaming algorithms

Related Items

An optimal lower bound for buffer management in multi-queue switches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved competitive guarantees for QoS buffering
• Competitive on-Line switching policies
• Competitive paging with locality of reference
• Maximizing throughput in multi-queue switches
• Competitive queue policies for differentiated services
• Loss-bounded analysis for differentiated services
• Buffer Overflow Management in QoS Switches
• An experimental study of online scheduling algorithms
• Algorithms – ESA 2004
• Automata, Languages and Programming
• On the Performance of Greedy Algorithms in Packet Buffering
• Scheduling policies for CIOQ switches
• Bounds for Certain Multiprocessing Anomalies
• STACS 2005
• Management of multi-queue switches in QoS networks