On the Performance of Greedy Algorithms in Packet Buffering
From MaRDI portal
Publication:5470691
DOI10.1137/S0097539704446268zbMath1122.90035OpenAlexW2067963342MaRDI QIDQ5470691
Susanne Albers, Markus Schmidt
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539704446268
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General topics in the theory of algorithms (68W01)
Related Items (13)
The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ Buffer Management for Packets with Processing Times ⋮ Essential Traffic Parameters for Shared Memory Switch Performance ⋮ Better bounds for online \(k\)-frame throughput maximization in network switches ⋮ Scheduling with deadlines and buffer management with processing requirements ⋮ Tight Analysis of Priority Queuing for Egress Traffic ⋮ Improved competitive performance bounds for CIOQ switches ⋮ An optimal lower bound for buffer management in multi-queue switches ⋮ Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing ⋮ Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms ⋮ An experimental study of new and known online packet buffering algorithms ⋮ Online packet scheduling for CIOQ and buffered crossbar switches ⋮ Admission control in shared memory switches
This page was built for publication: On the Performance of Greedy Algorithms in Packet Buffering
