The impact of processing order on performance: a taxonomy of semi-FIFO policies
From MaRDI portal
Publication:2361355
Recommendations
Cites work
- An experimental study of new and known online packet buffering algorithms
- An improved algorithm for CIOQ switches
- Best effort and priority queuing policies for buffered crossbar switches
- Buffer Overflow Management in QoS Switches
- Competitive queue policies for differentiated services
- Essential traffic parameters for shared memory switch performance
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1559527 (Why is no real title available?)
- Improved competitive performance bounds for CIOQ switches
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Lower and upper bounds on FIFO buffer management in QoS switches
- Maximizing throughput in multi-queue switches
- Nonclairvoyant scheduling
- On the Performance of Greedy Algorithms in Packet Buffering
- Online scheduling FIFO policies with admission and push-out
- Online Scheduling to Minimize Average Stretch
- Optimal smoothing schedules for real-time streams
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- Predictive scheduling of network processors.
Cited in
(2)
This page was built for publication: The impact of processing order on performance: a taxonomy of semi-FIFO policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361355)