An experimental study of new and known online packet buffering algorithms

DOI10.1007/S00453-008-9230-YzbMATH Open1208.68238OpenAlexW3133674016MaRDI QIDQ973006FDOQ973006

Authors: 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

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

zbMATH Keywords

online algorithmperformance analysisalgorithm engineeringpacket bufferingnetwork switch

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

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

Cited In (8)

• An Experimental Study of New and Known Online Packet Buffering Algorithms
• The impact of processing order on performance: a taxonomy of semi-FIFO policies
• Tight Analysis of Priority Queuing for Egress Traffic
• STACS 2005
• On the Performance of Greedy Algorithms in Packet Buffering
• An optimal lower bound for buffer management in multi-queue switches
• 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 Q973006)