Lower and upper bounds on FIFO buffer management in QoS switches

DOI10.1007/S00453-008-9236-5MaRDI QIDQ1016522zbMATH OpenOpenAlexFDO

Authors Matthias Englert, Matthias Westermann

Publication date 6 May 2009

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-008-9236-5

zbMATH Keywords

online algorithmsbuffer managementquality of servicecomputer networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Comparison-based FIFO buffer management in QoS switches
• Nearly optimal FIFO buffer management for DiffServ
• Nearly optimal FIFO buffer management for two packet classes.
• Buffer overflow management in QoS switches

Cites work

• scientific article; zbMATH DE number 2079410 (Why is no real title available?)
• Automata, Languages and Programming
• Buffer Overflow Management in QoS Switches
• Competitive queue policies for differentiated services
• Improved competitive guarantees for QoS buffering
• Loss-bounded analysis for differentiated services
• Management of multi-queue switches in QoS networks
• Nearly optimal FIFO buffer management for two packet classes.
• Optimal smoothing schedules for real-time streams (extended abstract)

Cited in

(21)

• A near-optimal memoryless online algorithm for FIFO buffering two packet classes
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Online scheduling FIFO policies with admission and push-out
• Algorithms – ESA 2004
• Non-preemptive buffer management for latency sensitive packets
• The impact of processing order on performance: a taxonomy of semi-FIFO policies
• Comparison-based buffer management in QoS switches
• Comparison-based FIFO buffer management in QoS switches
• Essential traffic parameters for shared memory switch performance
• Considering suppressed packets improves buffer management in QoS switches
• Tight Analysis of Priority Queuing for Egress Traffic
• Bounded delay packet scheduling in a bounded buffer
• Online packet scheduling for CIOQ and buffered crossbar switches
• Better bounds for online \(k\)-frame throughput maximization in network switches
• Competitive buffer management with packet dependencies
• An optimal lower bound for buffer management in multi-queue switches
• Nearly optimal FIFO buffer management for two packet classes.
• Buffer overflow management in QoS switches
• Buffer Overflow Management in QoS Switches
• Online submodular maximization with preemption
• Admission control in shared memory switches

This page was built for publication: Lower and upper bounds on FIFO buffer management in QoS switches

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