Designing proficient search algorithms is a major aspect in unstructured peer-to-peer networks, because Search algorithms offer the capabilities to trace the queried resources and to route the message to the target node. Different techniques can be used to trace resources on the network. If the network is small, no intricate search techniques are needed. We can use simple broadcasting or multicasting for querying. Centralized systems with a small number of servers also do not have need of intricate query propagation techniques. However, if we want to sustain intricate queries in decentralized networks, such as unstructured P2P overlays, complicated search techniques have to be applied to query propagation to attain scalability. In this paper, we discuss the most general search algorithms and example protocols that make use of these methods and hence we illustrate the importance of search algorithms in unstructured P2P networks
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.