Authors: G. Khataniar; D. Goswami
Addresses: Department of Computer Science and Engineering, Indian Institute of Technology Guwahati, Guwahati 781039, India. ' Department of Computer Science and Engineering, Indian Institute of Technology Guwahati, Guwahati 781039, India
Abstract: Unstructured overlays have the disadvantage that queries may take a long time to find required data or it does not guaranty to locate an existing data item. We present an organised network architecture for unstructured peer-to-peer systems where nodes are added to the network in a systematic way to efficiently utilise the node resources. This network architecture is characterised by O(logm n) network diameter and O(logm n) messages for node joining and node failure, where n is the number of nodes in the network and m is the number of children of a node. Purely decentralised systems like Gnutella route the query in an environment where the node capabilities are not identified. Whereas the proposed hierarchical unstructured p2p (HUP) routes the query towards the high capable nodes. This organisation of nodes improves the probability of query success rate than that of purely unstructured systems.
Keywords: unstructured overlays; token; super nodes; normal nodes; time-to-live; TTL; overlay networks; P2P networks; peer-to-peer networks; query success rate; node capabilities.
International Journal of Communication Networks and Distributed Systems, 2012 Vol.9 No.1/2, pp.37 - 61
Published online: 30 Aug 2014 *Full-text access for editors Access for subscribers Purchase this article Comment on this article