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

DOI10.1007/978-3-540-78773-0_22zbMATH Open1136.68349OpenAlexW1544516749MaRDI QIDQ5458533FDOQ5458533

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)

Cites Work

• Title not available (Why is that?)
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• On the k -server conjecture
• Improved competitive guarantees for QoS buffering
• STACS 2005
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• On the performance of greedy algorithms in packet buffering
• Management of multi-queue switches in QoS networks

Cited In (6)

• Buffer management of multi-queue QoS switches with class segregation
• Tight Analysis of Priority Queuing for Egress Traffic
• Randomized two-valued bounded delay online buffer management
• Online packet scheduling for CIOQ and buffered crossbar switches
• 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

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)