An Experimental Study of New and Known Online Packet Buffering Algorithms
From MaRDI portal
Recommendations
- An experimental study of new and known online packet buffering algorithms
- On the performance of greedy algorithms in packet buffering
- On the Performance of Greedy Algorithms in Packet Buffering
- Packet buffering: Randomization beats deterministic algorithms
- An optimal lower bound for buffer management in multi-queue switches
Cited in
(8)- Improved competitive performance bounds for CIOQ switches
- On the performance of greedy algorithms in packet buffering
- Resource Management in Large Networks
- On the Performance of Greedy Algorithms in Packet Buffering
- Packet buffering: Randomization beats deterministic algorithms
- Online packet switching
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- An experimental study of new and known online packet buffering algorithms
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 Q3527264)