A peer-to-peer membership notification service

Authors:
Roberto Baldoni;Sara Tucci Piergiovanni
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Rome, Italy;Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Rome, Italy
Venue:
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Year:
2005

Citing 10
Cited 1

On the impossibility of group membership

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Group communication specifications: a comprehensive study

ACM Computing Surveys (CSUR)
Reliable Distributed Computing with the ISIS Toolkit

Reliable Distributed Computing with the ISIS Toolkit
Peer-to-Peer Membership Management for Gossip-Based Protocols

IEEE Transactions on Computers
Ad Hoc Membership for Scalable Applications

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
GROUP MEMBERSHIP IN THE EPIDEMIC STYLE

GROUP MEMBERSHIP IN THE EPIDEMIC STYLE
Lightweight probabilistic broadcast

ACM Transactions on Computer Systems (TOCS)
Overcast: reliable multicasting with on overlay network

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Churn resilience of peer-to-peer group membership: a performance analysis

IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Scribe: a large-scale and decentralized application-level multicast infrastructure

IEEE Journal on Selected Areas in Communications

Dynamic regular registers in systems with churn

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of providing a peer with a good approximation of the current group membership in a peer-to-peer (p2p) setting is a key factor to the successful usage of any application-level multicast protocol (e.g. gossip based protocols). A p2p setting makes this problem hard to be solved due to the its inherent dynamic and asynchronous nature. This paper studies the problem of implementing a fully distributed, also called p2p, Membership Notification Service (MNS) which is able to handle any number of simultaneous join and leave while allowing reliable delivering of messages among peers which remain permanently alive inside the group.