Peer-to-peer membership management for gossip-based protocols
作者： A.J. Ganesh , A.-M. Kermarrec , L. Massoulie
关键词: Distributed computing 、 Theoretical computer science 、 Protocol (science) 、 Node (networking) 、 Computer science 、 Peer-to-peer 、 Reliability (computer networking) 、 Gossip protocol 、 Gossip 、 Communication in small groups
摘要: Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic gossip schemes studied so far typically assume that each member has full knowledge of the global membership chooses targets uniformly at random. requirement impairs their applicability to very large-scale groups. In this paper, we present SCAMP (Scalable Membership protocol), a novel peer-to-peer protocol which operates in fully decentralized manner provides with partial view membership. Our is self-organizing sense size views naturally converges value required support algorithm reliably. This function size, but achieved without any node knowing size. We propose additional mechanisms achieve balanced sizes even highly unbalanced subscription patterns. design, theoretical analysis, detailed evaluation basic its refinements. Simulation results show guarantees provided by are comparable previous based on knowledge. scale experiments attests protocol.
acm.org
sci-hub.se 参考文章(28)
Keith Marzullo, Stefano Masini, Meng Lin, Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks University of California at San Diego. ,(1999)
Tal Anker, Gregory V Chockler, Danny Dolev, Idit Keidar, None, Scalable group membership services for novel applications. Networks in Distributed Computing. pp. 23- 42 ,(1997)
I. Csiszar, Information theoretic methods in probability and statistics international symposium on information theory. pp. 2- ,(1997) , 10.1109/ISIT.1997.612917
Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Laurent Massoulié, SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication Lecture Notes in Computer Science. pp. 44- 55 ,(2001) , 10.1007/3-540-45546-9_4
Meng-Jang Lin, Keith Marzullo, Directional Gossip: Gossip in a Wide Area Network european dependable computing conference. pp. 364- 379 ,(1999) , 10.1007/3-540-48254-7_25
Meng-Jang Lin, Keith Marzullo, Stefano Masini, Gossip versus Deterministically Constrained Flooding on Small Networks Lecture Notes in Computer Science. pp. 253- 267 ,(2000) , 10.1007/3-540-40026-5_17
Robbert van Renesse, Yaron Minsky, Mark Hayden, A gossip-style failure detection service Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing. pp. 55- 70 ,(2009) , 10.1007/978-1-4471-1283-9_4
Qixiang Sun, D.C. Sturman, A gossip-based reliable multicast for large-scale high-throughput applications dependable systems and networks. pp. 347- 358 ,(2000) , 10.1109/ICDSN.2000.857559
Idit Keidar, Jeremy Sussman, Keith Marzullo, Danny Dolev, None, A client-server oriented algorithm for virtually synchronous group membership in WANs international conference on distributed computing systems. pp. 356- 365 ,(2000) , 10.1109/ICDCS.2000.840947
L.F. Cabrera, M.B. Jones, M. Theimer, Herald: achieving a global event notification service Proceedings Eighth Workshop on Hot Topics in Operating Systems. pp. 87- 92 ,(2001) , 10.1109/HOTOS.2001.990066