Buffer Overflow Management in QoS Switches
From MaRDI portal
Publication:4651481
DOI10.1137/S0097539701399666zbMath1112.90025MaRDI 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)
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing, Online scheduling FIFO policies with admission and push-out, Measuring the impact of adversarial errors on packet scheduling strategies, Better bounds for online \(k\)-frame throughput maximization in network switches, 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, 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, Bounded delay packet scheduling in a bounded buffer, Buffer management for colored packets with deadlines, Randomized competitive algorithms for online buffer management in the adaptive adversary model, An experimental study of new and known online packet buffering algorithms, Lower and upper bounds on FIFO buffer management in QoS switches, Online buffer management for transmitting packets with processing cycles, Comparison-based buffer management in QoS switches, Collecting weighted items from a dynamic queue, Scheduling packets with values and deadlines in size-bounded buffers, Online stochastic optimization under time constraints, A universal randomized packet scheduling algorithm, Online ascending auctions for gradually expiring items, 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, Online packet scheduling with bounded delay and lookahead, Randomized two-valued bounded delay online buffer management, Optimal Buffer Management for 2-Frame Throughput Maximization, Tight Analysis of Priority Queuing for Egress Traffic, Serving in the Dark should be done Non-Uniformly, Buffer Management for Packets with Processing Times, Essential Traffic Parameters for Shared Memory Switch Performance, Randomized Algorithms for Buffer Management with 2-Bounded Delay, Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
