Buffer Overflow Management in QoS Switches
From MaRDI portal
Publication:4651481
DOI10.1137/S0097539701399666zbMath1112.90025OpenAlexW2095073910MaRDI QIDQ4651481
Boaz Patt-Shamir, Zvi Lotker, Yishay Mansour, M. I. Sviridenko, Baruch Schieber, Alexander Kesselman
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539701399666
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (38)
The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ Measuring the impact of adversarial errors on packet scheduling strategies ⋮ A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ Serving in the Dark should be done Non-Uniformly ⋮ 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 ⋮ Randomized two-valued bounded delay online buffer management ⋮ Scheduling with deadlines and buffer management with processing requirements ⋮ Tight Analysis of Priority Queuing for Egress Traffic ⋮ Competitive buffer management with packet dependencies ⋮ A comprehensive study of an online packet scheduling algorithm ⋮ A near-optimal memoryless online algorithm for FIFO buffering two packet classes ⋮ Bounded delay packet scheduling in a bounded buffer ⋮ Online packet scheduling with bounded delay and lookahead ⋮ The loss of serving in the dark ⋮ Collecting weighted items from a dynamic queue ⋮ Scheduling packets with values and deadlines in size-bounded buffers ⋮ Online buffer management for transmitting packets with processing cycles ⋮ Online stochastic optimization under time constraints ⋮ An optimal lower bound for buffer management in multi-queue switches ⋮ Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing ⋮ Comparison-based buffer management in QoS switches ⋮ Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms ⋮ Online ascending auctions for gradually expiring items ⋮ Buffer management for colored packets with deadlines ⋮ An experimental study of new and known online packet buffering algorithms ⋮ A universal randomized packet scheduling algorithm ⋮ Randomized competitive algorithms for online buffer management in the adaptive adversary model ⋮ Randomized Algorithms for Buffer Management with 2-Bounded Delay ⋮ Overflow management with self-eliminations ⋮ Overflow management with self-eliminations ⋮ Lower and upper bounds on FIFO buffer management in QoS switches ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead ⋮ Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers ⋮ Admission control in shared memory switches ⋮ Optimal Buffer Management for 2-Frame Throughput Maximization ⋮ Online scheduling FIFO policies with admission and push-out
This page was built for publication: Buffer Overflow Management in QoS Switches
