An experimental study of new and known online packet buffering algorithms
From MaRDI portal
(Redirected from Publication:973006)
Recommendations
Cites work
- scientific article; zbMATH DE number 5159825 (Why is no real title available?)
- 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 932439 (Why is no real title available?)
- Algorithms – ESA 2004
- An experimental study of online scheduling algorithms
- Automata, Languages and Programming
- Bounds for Certain Multiprocessing Anomalies
- Buffer Overflow Management in QoS Switches
- Competitive on-Line switching policies
- Competitive paging with locality of reference
- Competitive queue policies for differentiated services
- Improved competitive guarantees for QoS buffering
- Loss-bounded analysis for differentiated services
- Management of multi-queue switches in QoS networks
- Maximizing throughput in multi-queue switches
- On the Performance of Greedy Algorithms in Packet Buffering
- STACS 2005
- Scheduling policies for CIOQ switches
Cited in
(8)- On the performance of greedy algorithms in packet buffering
- Approximation and Online Algorithms
- On the Performance of Greedy Algorithms in Packet Buffering
- 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
- STACS 2005
This page was built for publication: An experimental study of new and known online packet buffering algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973006)
