Comparison of Different Search Algorithms in Unstructured Decentralized Peer-to-Peer Network

Summary

Peer-to-Peer (P2P) networks are decentralized systems where each participant functions as both a client and a server, allowing for direct resource sharing without a central server. This structure provides advantages in scalability, fault tolerance, and security as the nodes within the network can leave and join freely. There are challenges that remain due to the lack of a global index or hierarchy when searching for resources within this structure. For example, when a node requests to find a peer or file, there is not a generalized structure between everyone which can lead to inefficiencies, scalability limitations, and query failures (lookup misses). This research is important because there exists many different approaches for searching within an unstructured decentralized P2P network such as random walks, flooding, and probabilistic approaches. Understanding the strengths and weaknesses of these methods as well as the capability of finding other participants within a network is important to improving search efficiency, scalability and resource consumption.

Schedule