Packet buffering: Randomization beats deterministic algorithms

DOI10.1007/978-3-540-31856-9_24MaRDI QIDQ5710683zbMATH OpenOpenAlexFDO

Authors Markus Schmidt

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106485

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Recommendations

• On the performance of greedy algorithms in packet buffering
• On the Performance of Greedy Algorithms in Packet Buffering
• A universal randomized packet scheduling algorithm
• An Experimental Study of New and Known Online Packet Buffering Algorithms
• An experimental study of new and known online packet buffering algorithms
• Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
• On randomizing the sending times in TCP and other window based algorithms
• Competitive buffer management with packet dependencies

Cited in

(21)

• The best and worst packet transmission policies
• Online packet scheduling for CIOQ and buffered crossbar switches
• A universal randomized packet scheduling algorithm
• Online packet-routing in grids with bounded buffers
• The loss of serving in the dark
• Better bounds for online \(k\)-frame throughput maximization in network switches
• One to rule them all: a general randomized algorithm for buffer management with bounded delay
• Better bounds for online \(k\)-frame throughput maximization in network switches
• An Experimental Study of New and Known Online Packet Buffering Algorithms
• Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
• On the performance of greedy algorithms in packet buffering
• An \(O(\log n)\)-competitive online centralized randomized packet-routing algorithm for lines
• Resource Management in Large Networks
• An optimal lower bound for buffer management in multi-queue switches
• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
• An optimal lower bound for buffer management in multi-queue switches
• Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
• On the Performance of Greedy Algorithms in Packet Buffering
• Buffer management for colored packets with deadlines
• Randomized competitive algorithms for online buffer management in the adaptive adversary model
• An experimental study of new and known online packet buffering algorithms

This page was built for publication: Packet buffering: Randomization beats deterministic algorithms

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