Maximizing throughput in multi-queue switches

DOI10.1007/s00453-005-1190-xzbMath1117.68014OpenAlexW2160702061MaRDI 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

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (14)

The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ Essential Traffic Parameters for Shared Memory Switch Performance ⋮ Better bounds for online \(k\)-frame throughput maximization in network switches ⋮ Tight Analysis of Priority Queuing for Egress Traffic ⋮ Improved competitive performance bounds for CIOQ switches ⋮ An optimal lower bound for buffer management in multi-queue switches ⋮ Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing ⋮ Station assignment with reallocation ⋮ 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 ⋮ The matroid cup game ⋮ Admission control in shared memory switches ⋮ Online scheduling FIFO policies with admission and push-out

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

This page was built for publication: Maximizing throughput in multi-queue switches