Brief announcement: A stable and robust membership protocol

Abstract

In this paper, we summarize the core ideas of our stable and robust membership protocol, which is fully decentralized. After convergence, each node of the overlay graph has expected in- and out-degrees scaling logarithmically with the size of the network (around 2ln (n)), and that the diameter of the overlay graph remains at ln(n)/ln(2ln(n)) + O(1). Our protocol restores the desirable properties of the overlay network from an arbitrary state, which might result from a massive but temporary disruption. © 2011 Springer-Verlag.