DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks

Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due to their simplicity, ease of deployment and versatility. The unstructured network topology, however, contains many cyclic paths which introduce numerous duplicate messages in the system. While such messages can be identified and ignored, they still consume a large proportion of the bandwidth and other resources, causing bottlenecks in the entire network. In this paper we describe DCMP, a dynamic, fully decentralized protocol which reduces significantly the duplicate messages by eliminating unnecessary cycles. As queries are transmitted through the peers, DCMP identifies the problematic paths and attempts to break the cycles, while maintaining the connectivity of the network. In order to preserve the fault resilience and load balancing properties of unstructured P2P systems, DCMP avoids creating a hierarchical ...

• Type: Journal
• Year: 2008
• Where: TPDS
• Authors: Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras
• Keywords: Duplicate Messages, TPDS 2008, Two-layer Super-peer Implementations, Unstructured P2p Systems