Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
From MaRDI portal
Publication:4907579
DOI10.1137/110856745zbMath1257.68078OpenAlexW2075737586MaRDI QIDQ4907579
Matthias Westermann, Matthias Englert
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
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (7)
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ Non-preemptive buffer management for latency sensitive packets ⋮ Randomized two-valued bounded delay online buffer management ⋮ Online packet scheduling with bounded delay and lookahead ⋮ Comparison-based buffer management in QoS switches ⋮ Online packet scheduling for CIOQ and buffered crossbar switches ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead
This page was built for publication: Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches