C development for P2P pDHT module

o Programming Lanaguage Required: C o Required to implement pDHT based on the logic from Pastry as reference o Initialization of the Peer to Peer Network Core Module o Ability to setup a P2P network with > 100,000 nodes o Ability to route to destination with key D arrives at node with NodeID A (details of Routing will be introduced as below sections) o Routing Performance should be in less than |log2b N| steps, b = 4 o Ability to initialize ANY new node arrival o Ability to handle ANY node departure (Nodes in Pastry network may fail or depart without warning) o Node is considered as failed when its immediate neighbors in the nodeId space is no longer communicate with the node o The failure of a node that appears in the routing table of another node is detected when that node attempts to contact the failed node and there is no response o Node failures must be tolerated, the routing can be randomized o Message must always be forwarded to a node that shares a longer pre?x with the destination, or shares the same pre?x length as the current node but is numerically closer in the nodeId space than the current node o The choice among multiple nodes that satisfy the criterion can be made randomly o Ability to get the possible IP of the search from the higher level API o NodeID is computed as SHA-1 128-bit o Mutliple request should be handled as we should suppport any Internet access request o NAT tolerate o Build as an API Library o Support IPv4 / IPv6 Enquires