Considering suppressed packets improves buffer management in quality of service switches

DOI10.1137/110856745zbMATH Open1257.68078OpenAlexW2075737586MaRDI QIDQ4907579FDOQ4907579

Authors: Matthias Englert, Matthias Westermann 

Publication date: 4 February 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110856745

Recommendations

• Considering suppressed packets improves buffer management in QoS switches
• Comparison-based buffer management in QoS switches
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Algorithms – ESA 2004
• Management of multi-queue switches in QoS networks

zbMATH Keywords

buffer managementquality of servicesuppressed packets

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited In (8)

• Non-preemptive buffer management for latency sensitive packets
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
• Comparison-based buffer management in QoS switches
• Considering suppressed packets improves buffer management in QoS switches
• Randomized two-valued bounded delay online buffer management
• Online packet scheduling for CIOQ and buffered crossbar switches
• Online packet scheduling with bounded delay and lookahead

This page was built for publication: Considering suppressed packets improves buffer management in quality of service switches

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