Lower and Upper Bounds on FIFO Buffer Management in QoS Switches

DOI10.1007/11841036_33zbMath1131.68317OpenAlexW2593786213MaRDI QIDQ5449541

Matthias Westermann, Matthias Englert

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.2530

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

Buffer Management for Packets with Processing Times ⋮ Measuring the problem-relevant information in input ⋮ Scheduling with deadlines and buffer management with processing requirements ⋮ The loss of serving in the dark ⋮ Improved competitive performance bounds for CIOQ switches ⋮ Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms ⋮ Buffer management for colored packets with deadlines ⋮ Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers ⋮ Optimal Buffer Management for 2-Frame Throughput Maximization

This page was built for publication: Lower and Upper Bounds on FIFO Buffer Management in QoS Switches