גיל אינציגר

Many networking applications require timely access to recent network measurements, which can be captured using a sliding window model. Maintaining such measurements is a challenging task due to the fast line speed and scarcity of fast memory in routers. In this work, we study the impact of allowing slack in the window size on the asymptotic requirements of sliding window problems. That is, the algorithm can dynamically adjust the window size between W and W(1+τ) where τ is a small positive parameter. We demonstrate this model's attractiveness by showing that it enables e cient algorithms to problems such as Maximum and General-Summing that require (W) bits even for constant factor approximations in the exact sliding window model. Additionally, for problems that admit sub-linear approximation algorithms such as Basic-Summing and Count-Distinct, the slack model enables a further asymptotic improvement. The main focus of our paper [4] is on the widely studied Basic-Summing problem of computing the sum of the last W integers from (0, 1 . . ., R) in a stream. While it is known that (W log R) bits are needed in the exact window model, we show that approximate windows allow an exponential space reduction for constant τ. Specifically, for τ = (1), we present a space lower bound of (log(RW)) bits. Additionally, we show an (log (W/)) lower bound for RW additive approximations and a (log (W/) + log log R) bits lower bound for (1 + ) multiplicative approximations. Our work is the first to study this problem in the exact and additive approximation settings. For all settings, we provide memory optimal algorithms that operate in worst case constant time. This strictly improves on the work of [12] for (1 + )-multiplicative approximation that requires O(^{− 1} log (RW) log log (RW)) space and performs updates in O(log (RW)) worst case time. Finally, we show asymptotic improvements for the Count-Distinct, General-Summing and Maximum problems.