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

1. 3 A Novel Searching Technique by Detecting Stable Nodes in Peer-to-Peer Networks Sabbir Ahmed, ID 6124050300-9 Graduate School of Science and Engineering Ritsumeikan University BKC Noji Higashi 1-1-1 Kusatsu, 525-8577 Shiga, Japan

2. Outline • Introduction & Motivation • Architecture Overview • Existing Search Techniques • Proposed Method • Evaluation • Conclusion

3. Introduction • Peer-to-Peer networks are unstable and dynamic in nature • Nodes join and leave the network frequently because they only care about their self interests. • Main problems are • the inefficient searching in distributed resources which create huge network traffic • interruption during data retrieval from the unstable nodes • Our proposed Searching Algorithm first detects the Stable Nodes & then execute searching only to those stable nodes among the millions of active nodes

4. Architecture Overview Based on control over data location and network topology Peer-to-Peer Network is classified as follows: Peer-to-Peer Networks • Loosely Structured • Unstructured • Highly Structured Decentralized Centralized Figure1: P2P network structure

5. Existing Search Techniques • k-walker random walk • Two-level k-walker random walk • Iterative deepening • Local indices based search • Modified random BFS • Adaptive probabilistic search • Routing indices based search • Dominating set based search • Directed BFS • Intelligent search , etc

6. Proposed Method(1) • The basic approach is • Collect the Stability Ratio of each node to detect the node stability records • Route the Query only to those nodes with good stability record • OBJECTIVES • Reduce the number of nodes those process • a query • & • Uninterrupted retrieval of data

7. Proposed Method(2) Stability Ratio The ratio that shows the duration of active mode of a node(uptime) in percentage is called the Stability Ratio (SR). Stability Ratio = uptime attime if n=30 days & time interval in hour, then c Example: Node B %

8. Proposed Method(4) A Query routing is efficient than flooding

9. Evaluation(1) • In Gnutella protocol when a user A submits a query his node sends some sequential messages in structured format- Step1. the A node sends a Ping message to its neighbors Step2. Each node receives the Ping message, reply a Ping Response, and forward the message to neighbors. Step3. Flood the Query to all the neighbors using breadth-first traversal (BFS) Step4.A Receives all Query Hits Step5. A Download the data using HTTP protocol .

10. Evaluation(2) • In our proposed algorithm the Step3will be modified • Modified Step3. Route the Query to the subset of neighbors (S) with high Stability Ratio. • SR • Table. Ping Response Message format

11. Evaluation(3) • Average cumulative bandwidth & processing cost increased with the number of nodes that process a query

12. Evaluation(4) • The probability of satisfaction is ensured up to a certain level of SR consideration

13. Conclusion • Since we cannot force a peer to remain online until a file is completely downloaded, so it is important to choose a node, which is trustworthy by nature • Our searching algorithm is faster, reduces network traffic and ensure un-interruption during data retrieval thus it improves the present searching techniques • Our current work is concern about the recall rate, In future we wish to work with precision rate which measures the percentage of correct results to a query

14. Thank You