Online computation and competitive analysis
Online computation and competitive analysis
Optimal smoothing schedules for real-time streams (extended abstract)
Proceedings of the nineteenth annual ACM 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
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
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
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
Competitive buffer management for shared-memory switches
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
From the editor: This issue's column contains an expository article by Leah Eppstein and Rob Van Stee on models and algorithms for buffer management in QofS networks. This area has seen a flurry of activity in the last four years. In spite of good progress, several fundamental, easy-to-state problems remain open. Many thanks to Leah and Rob for this timely contribution.