An Experimental Study of New and Known Online Packet Buffering Algorithms

DOI10.1007/978-3-540-75520-3_66zbMATH Open1151.68337OpenAlexW1504391490MaRDI QIDQ3527264FDOQ3527264

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

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

Mathematics Subject Classification ID

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

Cited In (8)

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

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)