• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.619-622
• /
• 2009

P2P networks are undergoing rapid progress and inspiring numerous developments by gossip-based protocol. Gossip-based protocols for group communication have attractive scalability and reliability properties. We propose a self-organizing algorithm in the sense that the size of neighbor list achieved without any node knowing the group size. We also propose an efficient mechanism to reduce the redundancy of the system by backing up the nodes in the neighbor list. We present the design, theoretical analysis, and a detailed evaluation of the proposed algorithm and its refinements.