Akash Jajoo
Niraj Chowdhary
- Extract Tapestry_Algorithm to you local machine
- Go to Project 3/tapestry folder via command prompt
- Type mix run proj3.exs arg1 arg2
Here,
arg1 is the number of nodes involved
arg2 Number of request per node.
Output: Maximum number of hops taken to find the requested file.
- Here every node in the network has their own 16 bit long identifier
- Each node maintains a finger table which is the key value pair, just like hash map, that points to the neighbours it knows about.
- Neighbour is selected on basis of prefix matching, whichever has the longest prefix matching is chosen as the next node to hop to.
- The above proecess continues until desired object is found and it takes O(logn) time.
The above screenshot demonstrates the working output of 100 and 1000 nodes handling 2 requests and 4 request per node respectively. For 100 nodes the maximum no. of hops is 2 to find an object and for 1000 nodes it is 4.