On the Performance of Greedy Algorithms in Packet Buffering
From MaRDI portal
Publication:5470691
DOI10.1137/S0097539704446268zbMath1122.90035MaRDI QIDQ5470691
Susanne Albers, Markus Schmidt
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
90B36: Stochastic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W01: General topics in the theory of algorithms
Related Items
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing, Better bounds for online \(k\)-frame throughput maximization in network switches, An optimal lower bound for buffer management in multi-queue switches, 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, The impact of processing order on performance: a taxonomy of semi-FIFO policies, Scheduling with deadlines and buffer management with processing requirements, Improved competitive performance bounds for CIOQ switches, Tight Analysis of Priority Queuing for Egress Traffic, Buffer Management for Packets with Processing Times, Essential Traffic Parameters for Shared Memory Switch Performance
