Abstract
The exponential growth in the number of users on internet has lead to the invention of variants of the algorithms and data structures traditionally used in peer to peer networks. Many data structures like adjacency matrix, skip webs, hash tables, skip lists and skip graphs have been proposed to represent the peer to peer networks. This paper explores usage of one of these data structures, skip graph, a variant of skip list for peer to peer networks. The existing algorithm for searching in skip graph has O(log n) time complexity which can be further decreased by using the proposed approach named as Adaptive Probabilistic Skip Graph (APSG). Modifications have been proposed in the scenario where a node is repeatedly being queried by a certain node and it has been experimentally verified that, in such scenarios, the search time is reduced to O(1). The major focus has been on optimizing the search algorithm by adding probability vector in the basic structure of the skip graph node.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
