Maximizing throughput in multi-queue switches

DOI10.1007/s00453-005-1190-xzbMath1117.68014MaRDI QIDQ2369876

Arik Litichevskey, Yossi Azar

Publication date: 21 June 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-005-1190-x

Mathematics Subject Classification ID

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, 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, Station assignment with reallocation, 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, Improved competitive performance bounds for CIOQ switches, Tight Analysis of Priority Queuing for Egress Traffic, Essential Traffic Parameters for Shared Memory Switch Performance

Cites Work

• An optimal deterministic algorithm for online \(b\)-matching
• Competitive queue policies for differentiated services
• On the performance of greedy algorithms in packet buffering
• The zero-one principle for switching networks
• An optimal service policy for buffer systems
• Nearly optimal FIFO buffer management for DiffServ
• Buffer overflow management in QoS switches
• Management of multi-queue switches in QoS networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item