Amortized efficiency of list update and paging rules
Communications of the ACM
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Page migration algorithms using work functions
Journal of Algorithms
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lower and upper bounds on FIFO buffer management in QoS switches
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Packet buffering: randomization beats deterministic algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A survey of buffer management policies for packet switches
ACM SIGACT News
An optimal lower bound for buffer management in multi-queue switches
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Buffer overflow management with class segregation
Information Processing Letters
| Hi-index | 0.00 |
We study packet buffering, a basic problem occurring in network switches. We construct an optimal 16/13-competitive randomized online algorithm PB for the case of two input buffers of arbitrary sizes. Our proof is based on geometrical transformations which allow to identify the set of sequences incurring extremal competitive ratios. Later we may analyze the performance of PB on these sequences only.