1 / 12

EEC – 289Q Project Presentation

This presentation explores the Time-Oriented Interlink Locator (TOIL) algorithm for peer-to-peer resource sharing. The algorithm addresses the challenge of locating target nodes within a network, minimizing search overhead. Using Round Trip Time (RTT) as a selection hint, TOIL employs a random walk strategy, optimizing node search in distributed environments. We detail experimental evaluations with 100-node and 600-node graphs, highlighting performance comparisons and hit rates. Insights on network topology influence and suggestions for improvements are also discussed, emphasizing TOIL's potential in resource-sharing applications.

zubin
Télécharger la présentation

EEC – 289Q Project Presentation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EEC – 289Q Project Presentation Time-Oriented Interlink Locator (TOIL) Wen-Fu Kao, Ying Yu Tai, Howard Che-Hao Chang Instructor: Dr. Chen-Nee Chuah

  2. Motivation and Limitation • Peer-to-Peer resource sharing among existing network infrastructure is desired • Request node doesn’t know where the target node is • Caused huge amount of network loading for searching the target

  3. A B D C F G E Random Walk • Qin Lv et al. (ACM SIGMETRICS 2002) claims it has the best performance • Choose successor randomly • Every walker chooses only one link • Stops when TTL=0

  4. TOIL Algorithm • Use RTT as the hint for selecting the nodes • Only search the top three nodes • Distributed, Breadth first • Stops when TTL=0

  5. A B D C F G E TOIL Link Selection A B D C F G E

  6. TOIL Searching Tree A B A D B C C A F E G A G C F C E C G

  7. Experimental Method • Simulation for 100 nodes and 600 nodes graph • Generated by the GT-ITM • Matlab for simulating the k random walker • A C program for simulating TOIL • Exhaustive searches all possible path to see the best and the worst case

  8. Network Topology 100 Node Graph 600 Node Graph

  9. Performance Comparison Ⅰ • TOIL becomes stable when reaching enough TTL 100 Nodes Hit Rate 600 Nodes Hit Rate

  10. Performance Comparison Ⅱ • Exponential growth vs. Linear growth • TOIL is a ternary tree 100 Nodes Traffic Load 600 Nodes Traffic Load

  11. Performance Comparison Ⅲ • Hit Time Ratio (HTR)=T2/T1 • T1=E[hit time|walker finds the shortest path to the target for a given TTL] • T2=E[hit time|TOIL finds the shortest path to the target for a given TTL] 600 Nodes Hit Time Ratio

  12. Conclusion and Future Work • TOIL has the potential; needs further improvement • The performance of TOIL depends on the network topology • Possible modification of TOIL • Binary vs. Ternary Tree • Replace one of the nodes into a randomly selected one from physically connected neighbors • Choose only one node instead of k nodes after certain TTL

More Related