An Experimental Study of New and Known Online Packet Buffering Algorithms

DOI10.1007/978-3-540-75520-3_66MaRDI QIDQ3527264zbMATH OpenOpenAlexFDO

Authors Susanne Albers, Tobias Jacobs

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_66

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Algorithms in computer science (68W99)

Recommendations

• An experimental study of new and known online packet buffering algorithms
• On the performance of greedy algorithms in packet buffering
• On the Performance of Greedy Algorithms in Packet Buffering
• STACS 2005
• An optimal lower bound for buffer management in multi-queue switches

Cited in

(8)

• Improved competitive performance bounds for CIOQ switches
• On the performance of greedy algorithms in packet buffering
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Approximation and Online Algorithms
• On the Performance of Greedy Algorithms in Packet Buffering
• An experimental study of new and known online packet buffering algorithms
• Resource Management in Large Networks
• STACS 2005

This page was built for publication: An Experimental Study of New and Known Online Packet Buffering Algorithms

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