Design Of Very Efficient Lookup Algorithms For A Low Diameter Hierarchical Structured Peer-To-Peer Network

In this work, we have considered a new hierarchical non-DHT based architecture for Peer-to-Peer (P2P) networks in which at each level of the hierarchy existing networks are all structured and each such network has the diameter of 1 overlay hop. Such low diameters have immense importance in designing very efficient data lookup algorithms. The mathematical model based on the Chinese Remainder Theorem has been used to define the neighborhood relations among peers to obtain the above-mentioned diameters. In this work, we present very efficient intra-group as well as inter-group data look up algorithms with O(1) time complexity exploiting the above mentioned low diameter features of the P2P system. Besides, we present very efficient algorithms related to peers joining with new and existing resource types.