Lower and upper bounds on FIFO buffer management in QoS switches
From MaRDI portal
Publication:1016522
DOI10.1007/S00453-008-9236-5zbMath1189.68026OpenAlexW2116240509MaRDI QIDQ1016522
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
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (14)
The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ Essential Traffic Parameters for Shared Memory Switch Performance ⋮ Better bounds for online \(k\)-frame throughput maximization in network switches ⋮ Non-preemptive buffer management for latency sensitive packets ⋮ Tight Analysis of Priority Queuing for Egress Traffic ⋮ Competitive buffer management with packet dependencies ⋮ A near-optimal memoryless online algorithm for FIFO buffering two packet classes ⋮ Bounded delay packet scheduling in a bounded buffer ⋮ An optimal lower bound for buffer management in multi-queue switches ⋮ Comparison-based buffer management in QoS switches ⋮ Online packet scheduling for CIOQ and buffered crossbar switches ⋮ Online Submodular Maximization with Preemption ⋮ Admission control in shared memory switches ⋮ Online scheduling FIFO policies with admission and push-out
Cites Work
- Unnamed Item
- Improved competitive guarantees for QoS buffering
- Nearly optimal FIFO buffer management for two packet classes.
- Competitive queue policies for differentiated services
- Loss-bounded analysis for differentiated services
- Buffer Overflow Management in QoS Switches
- Optimal smoothing schedules for real-time streams (extended abstract)
- Automata, Languages and Programming
- Management of multi-queue switches in QoS networks
This page was built for publication: Lower and upper bounds on FIFO buffer management in QoS switches
