An optimal service policy for buffer systems
Journal of the ACM (JACM)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Loss-bounded analysis for differentiated services
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Nearly optimal FIFO buffer management for DiffServ
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling policies for CIOQ switches
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Universal stability results for greedy contention-resolution protocols
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A survey of buffer management policies for packet switches
ACM SIGACT News
One to rule them all: a general randomized algorithm for buffer management with bounded delay
ESA'11 Proceedings of the 19th European conference on Algorithms
Hi-index | 0.00 |
We discuss packet switching for single-queue, multi-queue buffers and CIOQ buffers. We evaluate the algorithms by competitive analysis. We also mention the zero-one principle that applies to general switching networks.