On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Online computation and competitive analysis
Online computation and competitive analysis
Analytical approximations for real values of the Lambert W-function
Mathematics and Computers in Simulation
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
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
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Design and Buffer Sizing of TCAM-Based Pipelined Forwarding Engines
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive queue management for latency sensitive packets
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of new and known online packet buffering algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
| Hi-index | 0.00 |
We study a variant of Naor's [23] online packet buffering model: We are given a (non-preemptive) fifo buffer (e.g., in a network switch or a router) and packets that request transmission arrive over time. Any packet has an intrinsic value R and we have to decide whether to accept or reject it. In each time-step, the first packet in the buffer (if any) is transmitted and our benefit of it is equal to its intrinsic value minus the time it spent in the buffer. The objective is to maximize the total benefit. From a worst-case perspective, Fiat et al. [14] gave a threshold algorithm with a competitive ratio equal to the golden ratio *** ≈ 1.618. Due to the insensitivity of the algorithms towards the input, it was conjectured that this competitive ratio is too pessimistic for packet sequences occurring in practice. In this paper, we treat this conjecture from an analytical and experimental point of view. In the analytical part, we assume Poisson arrivals and compute a threshold for this algorithm depending on the arrival rate *** and the value R of the packets. This also yields bounds on the (expected) competitive ratio of the algorithm. We discover the phenomenon that the ratio converges to one if R grows or *** moves away from one. Thus (for fixed R ) we have that the largest competitive ratios occur for *** = 1. In that case, the bound is essentially $R / (R - \sqrt{R})$ and gives values smaller than *** for R *** 8. In a second, experimental, part of our study, we compared the competitive ratios achieved by the two threshold algorithms on actual network traffic with our theoretical prediction (which assumes Poisson arrivals). It turns out that the prediction and the measured ratios for our threshold are consistent, where the prediction even tends to be pessimistic. Furthermore, the measured ratios with our threshold where substantially smaller than *** and even almost everywhere below the ratios achieved with the threshold of [14].