Resources searching method for unstructured peer-to-peer networks based on shortcuts between subtrees
Hai-liang GUO · Journal of Computer Applications · 2012
Through studying resources searching methods of unstructured Peer-to-Peer(P2P) network,a new P2P overlay network was proposed.Using a multi-way balanced tree topology,the network created shortcuts between the added node and each subtree of the root when a new node inserted,which forwarded first-hop of a query message only,and then query messages could be forwarded in parallel in each subtree of the root without relying on the root.Compared with the performance of Gnutella and Random Walks network in simulation,the proposed network had lower messages redundancy ratio,higher resource searching success ratio and lower average searching time complexity.The analytical results show that the proposed network is efficient and feasible for searching resources.