Maximizing throughput in multi-queue switches
From MaRDI portal
Publication:2369876
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
- scientific article; zbMATH DE number 2079410 (Why is no real title available?)
- scientific article; zbMATH DE number 2080979 (Why is no real title available?)
- scientific article; zbMATH DE number 1754640 (Why is no real title available?)
- scientific article; zbMATH DE number 2119707 (Why is no real title available?)
- An optimal deterministic algorithm for online \(b\)-matching
- An optimal service policy for buffer systems
- Buffer overflow management in QoS switches
- Competitive queue policies for differentiated services
- Loss-bounded analysis for differentiated services
- Management of multi-queue switches in QoS networks
- Nearly optimal FIFO buffer management for DiffServ
- On the performance of greedy algorithms in packet buffering
- The zero-one principle for switching networks
Cited in
(18)- A numerical study of the upper bound of the throughput of a crossbar switch utilizing MiMa-algorithm
- Improved competitive performance bounds for CIOQ switches
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- The matroid cup game
- Algorithms – ESA 2004
- Tight Analysis of Priority Queuing for Egress Traffic
- The impact of processing order on performance: a taxonomy of semi-FIFO policies
- An optimal lower bound for buffer management in multi-queue switches
- An experimental study of new and known online packet buffering algorithms
- Better bounds for online \(k\)-frame throughput maximization in network switches
- Essential traffic parameters for shared memory switch performance
- Station assignment with reallocation
- Online scheduling FIFO policies with admission and push-out
- Competitive on-Line switching policies
- Admission control in shared memory switches
- Online packet scheduling for CIOQ and buffered crossbar switches
- Throughput of the set of ring channels. II: Ring 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)
