{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article11588","name":"Give Me Some Slack: Efficient Network Measurements","abstract":"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+tau) where tau is a small positive parameter. We demonstrate this model's attractiveness by showing that it enables efficient algorithms to problems such as Maximum and General-Summing that require Omega(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.\nThe main focus of the paper 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 Omega(W log R) bits are needed in the exact window model, we show that approximate windows allow an exponential space reduction for constant tau.\nSpecifically, for tau=Theta(1), we present a space lower bound of Omega(log(RW)) bits. Additionally, we show an Omega(log (W\/epsilon)) lower bound for RW epsilon additive approximations and a Omega(log (W\/epsilon)+log log R) bits lower bound for (1+epsilon) 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 [Mayur Datar et al., 2002] for (1+epsilon)-multiplicative approximation that requires O(epsilon^(-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.","keywords":["Streaming","Network Measurements","Statistics","Lower Bounds"],"author":[{"@type":"Person","name":"Ben Basat, Ran","givenName":"Ran","familyName":"Ben Basat","affiliation":"Department of Computer Science, Technion"},{"@type":"Person","name":"Einziger, Gil","givenName":"Gil","familyName":"Einziger","affiliation":"Nokia Bell Labs"},{"@type":"Person","name":"Friedman, Roy","givenName":"Roy","familyName":"Friedman","affiliation":"Department of Computer Science, Technion"}],"position":34,"pageStart":"34:1","pageEnd":"34:16","dateCreated":"2018-08-27","datePublished":"2018-08-27","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Ben Basat, Ran","givenName":"Ran","familyName":"Ben Basat","affiliation":"Department of Computer Science, Technion"},{"@type":"Person","name":"Einziger, Gil","givenName":"Gil","familyName":"Einziger","affiliation":"Nokia Bell Labs"},{"@type":"Person","name":"Friedman, Roy","givenName":"Roy","familyName":"Friedman","affiliation":"Department of Computer Science, Technion"}],"copyrightYear":"2018","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.34","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1145\/2619239.2626316","http:\/\/arxiv.org\/abs\/1703.01166"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume6320","volumeNumber":117,"name":"43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)","dateCreated":"2018-08-27","datePublished":"2018-08-27","editor":[{"@type":"Person","name":"Potapov, Igor","givenName":"Igor","familyName":"Potapov"},{"@type":"Person","name":"Spirakis, Paul","givenName":"Paul","familyName":"Spirakis"},{"@type":"Person","name":"Worrell, James","givenName":"James","familyName":"Worrell"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article11588","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6320"}}}