Nearly optimal FIFO buffer management for DiffServ

DOI10.1145/571825.571851zbMath1292.68034OpenAlexW2037223718MaRDI QIDQ5170874

Zvi Lotker, Boaz Patt-Shamir

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/571825.571851

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Maximizing throughput in multi-queue switches ⋮ The network as a storage device: dynamic routing with bounded buffers ⋮ Measuring the problem-relevant information in input ⋮ A near-optimal memoryless online algorithm for FIFO buffering two packet classes ⋮ Online competitive algorithms for maximizing weighted throughput of unit jobs

This page was built for publication: Nearly optimal FIFO buffer management for DiffServ