80 likes | 221 Views
Efficient File Sharing P2P Network. CS 6390 Advanced Computer Networks. Features. Building network topology Efficient searching Fast file acquiring. Efficient file searching - 1. TTL scoped based searching Specify MAXHOP
E N D
Efficient File Sharing P2P Network CS 6390 Advanced Computer Networks
Features • Building network topology • Efficient searching • Fast file acquiring
Efficient file searching - 1 • TTL scoped based searching • Specify MAXHOP • Example: node 3 will send query with MAXHOP = 2. Here, 3 will send query to 1, 5, and 6. 1 will send to 2 and 4 and not to 3 as it got the query from 3, 5 will send to 2, 8 and 9. Note that, 2 will get from both 1 and 5. Accept from 1 and reject from 5 as duplicate.
Efficient file searching - 2 • Probabilistic forwarding based searching • Specify PROBFORV • Example: node 3 will send query with PROBFORW = 70. Here, there are 70% of chances for node 1 to get the query. Same 70% chances for 5 and 6. If node 1 gets the query, there are 70% chances for nodes 2 and 4 to get the query. This process continues to flood query in the network.
Efficient file searching - 3 • Result caching • Intermediate nodes store successful responses. • Send response back to requester node on behalf of original node which has the file.
Fast file acquiring • Getting file from multiple nodes • Example, • 4 nodes give “success” response to query • The requested file will be divided in 4 parts • All 4 nodes will send respective part to requester node • Requester will merge received parts
Remember: • Query flooding should stop at some point. • SEARCHDURATION time to wait for responses. • Continue forwarding query based on constraints regardless of query result. • Query result should follow same path from where query came.