Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks

We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k players, each holding a counter n i that gets incremented over time, and the goal is to track an ε -approximation of thei...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 81; no. 6; pp. 2222 - 2243
Main Authors:	Huang, Zengfeng, Yi, Ke, Zhang, Qin
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2019 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Communication Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Finishes Lower bounds Mathematics of Computing Randomization Theory of Computation Tracking problem Continuous distributed tracking Distributed streaming Randomized algorithms
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!