Searching Technique in Peer-to-Peer Networks by Detecting Stable Nodes

Peer-to-Peer networking systems have proved their promising effort over client-server systems through various Internet applications. Efficiency of these systems’ enormous storage and processing capacity largely depends on searching and information retrieval techniques. We expose searching constraints from a different point of view in a dynamic network, where nodes churn rate is very high. Only successful searching does not ensure successful retrieval of data if those sources are not stable. Thus our objective is to identify relatively unfailing data sources among the millions of nodes in a network.