Improved competitive guarantees for QoS buffering

DOI10.1007/s00453-005-1158-xzbMath1086.68506OpenAlexW2120354662MaRDI QIDQ818829

Rob van Stee, Yishay Mansour, Alexander Kesselman

Publication date: 21 March 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/4101

zbMATH Keywords

quality of serviceFIFO model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (13)

Better bounds for online \(k\)-frame throughput maximization in network switches ⋮ Tight Analysis of Priority Queuing for Egress Traffic ⋮ A near-optimal memoryless online algorithm for FIFO buffering two packet classes ⋮ Bounded delay packet scheduling in a bounded buffer ⋮ The loss of serving in the dark ⋮ Collecting weighted items from a dynamic queue ⋮ An optimal lower bound for buffer management in multi-queue switches ⋮ Comparison-based buffer management in QoS switches ⋮ Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms ⋮ Buffer management for colored packets with deadlines ⋮ An experimental study of new and known online packet buffering algorithms ⋮ Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers ⋮ Lower and upper bounds on FIFO buffer management in QoS switches

This page was built for publication: Improved competitive guarantees for QoS buffering