The DLT priority sampling is essentially optimal
From MaRDI portal
Publication:2931379
DOI10.1145/1132516.1132539zbMath1301.68166MaRDI QIDQ2931379
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132539
integral formula; internet traffic; telescopic sums; network measurement; priority sampling; subset sum estimate
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68M11: Internet topics
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Space-efficient estimation of statistics over sub-sampled streams, Optimal sampling from sliding windows, Weighted sampling without replacement from data streams, The query complexity of estimating weighted averages