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 \(\frac{\ln(n)}{\ln(2\ln(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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fenner, T.I., Frieze, A.M.: On the connectivity of random m-orientable graphs and digraphs. Combinatorica 2, 347–359 (1982)
Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Computers 52(2), 139–149 (2003)
Gurevich, M., Keidar, I.: Correctness of gossip-based membership under message loss. SIAM J. Comput., 3830–3859 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A.K., Kermarrec, A.M., Larmore, L.L., Le Merrer, E. (2011). Brief Announcement: A Stable and Robust Membership Protocol. In: Défago, X., Petit, F., Villain, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2011. Lecture Notes in Computer Science, vol 6976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-24550-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24549-7
Online ISBN: 978-3-642-24550-3
eBook Packages: Computer ScienceComputer Science (R0)