Principal, Lord Ayyappa Institute of Engineering and Technology, Kanchipuram, India
Online published on 21 November, 2017.
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 p2p network 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 I 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 paths to break the cycles, while maintaining the connectivity of the network. With the information collected during this process distributed maintenance is performed efficiently even if peers quit the system without notification. DCMP can be easily implemented in various existing P2P systems.
Network protocols, distributed systems, p2p
