Adaptive Skip Graph Framework for Peer-to-Peer Networks: Search Time Complexity Analysis

With the enormous growth of number of nodes in a peer-to-peer (P2P) network, establishing a direct connection between two communicating nodes is a challenging task. It is mandatory to have a strong connection between different nodes for data sharing among P2P networks. Hence, this paper presents a modified data structure, named as Adaptive Skip Graph, a variant of a probabilistic data structure, skip list, which establishes a direct connection between two frequently communicating nodes by changing the membership vector of the caller node once the threshold is crossed. The proposed approach reduces the search time complexity of skip graph (O(log n)) substantially for the scenario where a node 'x' is repeatedly queried by a certain node 'y'. The results obtained using the proposed scheme are validated by experiments performed on a large set of nodes.