A distributed algorithm to estimate node counts in self-organizing ring topologies

Dennis Schwerdel, Matthias Priebe, Paul Friedrich Müller · 2011

Ring topologies are peer to peer network structures that organize the nodes in a ring. Each node knows its direct neighbors and a few other nodes but has no global view of the network. In such a network it is complicated to measure or estimate the number of participating nodes. We provide a lightweight, distributed algorithm to estimate the size of the node population. We also show how correct the estimates are with simulations.

Read the paper · More papers on PaperTik