Byzantine-Resilient Counting in Networks
Byzantine-Resilient Counting in Networks
We present two distributed algorithms for the Byzantine counting problem, which is concerned with estimating the size of a network in the presence of a large number of Byzantine nodes.In an n-node network (n is unknown), our first algorithm, which is deterministic, finishes in O(log n) rounds and is time-optimal. …