Paper Title
A Comparative Study Of Gossip Membership Protocol

Abstract— Gossip protocol is one of the most scalable and reliable protocol for message dissemination in a large network where nodes joins and leaves the network frequently. A node propagated a message by choosing a random subset of other nodes. The random choice of gossip target provides resilience to random failure and enables decentralized operation. The probabilistic gossip schemes assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. This global membership knowledge imposes huge memory and synchronization overhead that affects the ability of the protocol, so membership protocol us introduced that maintained a partial view instead of global view. In this paper we have compared two membership protocols i.e. SCAMP and CYCLON. The performance metrics are Average path length and Average cluster coefficient