Amortized efficiency of list update and paging rules
Communications of the ACM
Loss-bounded analysis for differentiated services
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitve buffer management for shared-memory switches
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive on-line switching policies
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A near optimal scheduler for switch-memory-switch routers
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
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
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Randomized qeue management for DiffServ
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
ACM SIGACT News
An improved algorithm for CIOQ switches
ACM Transactions on Algorithms (TALG)
A tight bound on online buffer management for two-port shared-memory switches
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches
IEICE - Transactions on Information and Systems
Resource Management in Large Networks
Algorithmics of Large and Complex Networks
Buffer management for colored packets with deadlines
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A survey of buffer management policies for packet switches
ACM SIGACT News
An experimental study of new and known online packet buffering algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Geometric aspects of online packet buffering: an optimal randomized algorithm for two buffers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Multiplexing packets with arbitrary deadlines in bounded buffers
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
An optimal lower bound for buffer management in multi-queue switches
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The loss of serving in the dark
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the problem of buffering unit value data packets in multi-queue network switches where each of the switch's input ports is equipped with a buffer of limited capacity. At these ports, packets arrive online and can be stored within the space limitations or must be discarded. Our objective is the maximization of the number of forwarded packets where, per time step, at most one packet from the set of buffers can be transmitted to the output port. In this paper, we give a technique for transforming any randomized algorithm for unit buffers into a randomized algorithm for buffers with arbitrary capacities while maintaining the competitiveness. We present the first randomized online algorithm that beats the deterministic lower bound of e/(e – 1) ≈ 1.58. It is 3/2-competitive and thus nearly matches the randomized lower bound of 1.46. For buffers with 2 queues having large capacities, we show a lower bound of 16/13 ≈ 1.23 for any online algorithm and prove that the competitive ratio of greedy algorithms is 9/7 ≈ 1.29, improving the best previously known upper bound of 3/2.