Discovery through Gossip
Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman,, Zhifeng Sun

TL;DR
This paper analyzes gossip-based discovery processes in dynamic networks, providing tight bounds on their convergence times in both undirected and directed cases, with implications for large-scale distributed systems.
Contribution
It offers the first rigorous analysis of two natural gossip-based discovery processes in dynamic networks, establishing tight bounds on their convergence times.
Findings
Undirected networks: O(n log^2 n) rounds for convergence.
Directed networks: O(n^2 log n) rounds for convergence.
Lower bounds match the upper bounds up to logarithmic factors.
Abstract
We study randomized gossip-based processes in dynamic networks that are motivated by discovery processes in large-scale distributed networks like peer-to-peer or social networks. A well-studied problem in peer-to-peer networks is the resource discovery problem. There, the goal for nodes (hosts with IP addresses) is to discover the IP addresses of all other hosts. In social networks, nodes (people) discover new nodes through exchanging contacts with their neighbors (friends). In both cases the discovery of new nodes changes the underlying network - new edges are added to the network - and the process continues in the changed network. Rigorously analyzing such dynamic (stochastic) processes with a continuously self-changing topology remains a challenging problem with obvious applications. This paper studies and analyzes two natural gossip-based discovery processes. In the push…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPeer-to-Peer Network Technologies · Mobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks
