Maximizing throughput in multi-queue switches
From MaRDI portal
Publication:2369876
DOI10.1007/S00453-005-1190-XzbMATH Open1117.68014OpenAlexW2160702061MaRDI QIDQ2369876FDOQ2369876
Authors: Yossi Azar, Arik Litichevskey 
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
Recommendations
- Algorithms – ESA 2004
- An optimal lower bound for buffer management in multi-queue switches
- An optimal lower bound for buffer management in multi-queue switches
- Management of multi-queue switches in QoS networks
- Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
Cites Work
- Competitive queue policies for differentiated services
- An optimal deterministic algorithm for online \(b\)-matching
- Title not available (Why is that?)
- The zero-one principle for switching networks
- Nearly optimal FIFO buffer management for DiffServ
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the performance of greedy algorithms in packet buffering
- An optimal service policy for buffer systems
- Loss-bounded analysis for differentiated services
- Buffer overflow management in QoS switches
- Management of multi-queue switches in QoS networks
Cited In (18)
- Online scheduling FIFO policies with admission and push-out
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- Algorithms – ESA 2004
- The impact of processing order on performance: a taxonomy of semi-FIFO policies
- Essential traffic parameters for shared memory switch performance
- A numerical study of the upper bound of the throughput of a crossbar switch utilizing MiMa-algorithm
- Tight Analysis of Priority Queuing for Egress Traffic
- Competitive on-Line switching policies
- Improved competitive performance bounds for CIOQ switches
- Throughput of the set of ring channels. II: Ring switches
- Online packet scheduling for CIOQ and buffered crossbar switches
- The matroid cup game
- Better bounds for online \(k\)-frame throughput maximization in network switches
- An optimal lower bound for buffer management in multi-queue switches
- An experimental study of new and known online packet buffering algorithms
- Station assignment with reallocation
- Admission control in shared memory switches
- Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
This page was built for publication: Maximizing throughput in multi-queue switches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369876)
