Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks
Antonio Cruciani

TL;DR
This paper presents a fully distributed protocol that maintains a constant-degree expander graph in dynamic peer-to-peer networks, resilient to adversarial churn up to a certain rate, ensuring robust and sparse overlay networks.
Contribution
It generalizes a recent protocol to handle adversarial churn in dynamic networks, providing provable guarantees of maintaining an expander topology under high churn rates.
Findings
Maintains a constant-degree expander with high probability.
Resilient to adversarial churn up to O(n/polylog(n)) per round.
Provides a simple, fully distributed, and provably churn-resilient protocol.
Abstract
We study the problem of maintaining robust and sparse overlay networks in fully distributed settings where nodes continuously join and leave the system. This scenario closely models real-world unstructured peer-to-peer networks, where maintaining a well-connected yet low-degree communication graph is crucial. We generalize a recent protocol by Becchetti et al. [SODA 2020] that relies on a simple randomized connection strategy to build an expander topology with high probability to a dynamic networks with churn setting. In this work, the network dynamism is governed by an oblivious adversary that controls which nodes join and leave the system in each round. The adversary has full knowledge of the system and unbounded computational power, but cannot see the random choices made by the protocol. Our analysis builds on the framework of Augustine et al. [FOCS 2015], and shows that our…
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.
