Abstract
Finding an efficient and scalable solution for range query to discover the contents in the presence of transient node populations and heterogeneity among them is a well-known challenging problem in peer-to-peer (P2P) systems. Transient node population results in high churn rate and hence requires frequent updates in routing table, while heterogeneity causes unfair distribution of resources as well as responsibilities among nodes. We propose an overlay structure based on m- binary search tree (BST) that provides an efficient and scalable solution for point and range query. We arrange the whole key space in lexicographic order and divide it into different key intervals. Each key interval is assigned to a BST. We have achieved intra-group and inter-group query processing in O(log |G <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</sub> |) messages, where |G <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</sub> | is the number of nodes in the destination group. Our approach results in less overhead to update the routing table even in the case of high churn rate.
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.
