Nearly optimal FIFO buffer management for DiffServ

DOI10.1145/571825.571851MaRDI QIDQ5170874zbMATH OpenOpenAlexFDO

Authors 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) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Recommendations

• Nearly optimal FIFO buffer management for two packet classes.
• Almost Tight Bounds for Reordering Buffer Management
• Almost tight bounds for reordering buffer management
• New Approximations for Reordering Buffer Management
• Optimal management of dynamic buffer caches
• About optimal management of FIFO-queues in two-level memory
• Algorithms and Computation
• A near-optimal memoryless online algorithm for FIFO buffering two packet classes
• A near-optimal memoryless online algorithm for FIFO buffering two packet classes
• Efficient buffering for concurrent disk and tape I/O

Cited in

(16)

• Lower and upper bounds on FIFO buffer management in QoS switches
• Nearly optimal FIFO buffer management for two packet classes.
• Maximizing throughput in multi-queue switches
• The network as a storage device: dynamic routing with bounded buffers
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• scientific article; zbMATH DE number 1726624 (Why is no real title available?)
• Comparison-based FIFO buffer management in QoS switches
• Competitive buffer management with packet dependencies
• A near-optimal memoryless online algorithm for FIFO buffering two packet classes
• FIFO queueing policies for packets with heterogeneous processing
• A near-optimal memoryless online algorithm for FIFO buffering two packet classes
• Measuring the problem-relevant information in input
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Buffer overflows of merging streams
• Improved competitive guarantees for QoS buffering
• Buffer minimization with conflicts on a line

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

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