Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers

DOI10.1007/978-3-540-78773-0_22MaRDI QIDQ5458533zbMATH OpenOpenAlexFDO

Authors Marcin Bienkowski, Aleksander Mądry

Publication date 15 April 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-78773-0_22

zbMATH Keywords

online algorithmsnetwork problemspacket buffering

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• Considering suppressed packets improves buffer management in QoS switches
• Improved competitive guarantees for QoS buffering
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Management of multi-queue switches in QoS networks
• On the k -server conjecture
• On the performance of greedy algorithms in packet buffering
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• STACS 2005

Cited in

(6)

• Randomized two-valued bounded delay online buffer management
• Buffer management of multi-queue QoS switches with class segregation
• Tight Analysis of Priority Queuing for Egress Traffic
• An optimal lower bound for buffer management in multi-queue switches
• Online packet scheduling for CIOQ and buffered crossbar switches
• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms

This page was built for publication: Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers

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