Abstract
AbstractPeer‐to‐peer (P2P) solutions are powerful distributed networks that are used in different kinds of applications. An important challenge for these networks is how search queries take place among users. A prominent solution for efficient search queries with a reasonable time is to use distributed hash tables in a structured design. Current methodologies of structured networks either provide a network with O(logN) routing time or exclusively reach O(1) without the possibility of routing. Based on different situations, each of these infrastructures has its applicability. In this paper, we propose binary search routing equivalent, a circular design for structured P2P networks. Our main goal is to make a flexible network infrastructure for routing. By considering trade‐offs between the size of distributed hash tables, overheads over churn and routing time, binary search routing equivalent can find objects without routing or route for at worst case O(logN). For this purpose, we emulate the methodology of binary search for P2P networks. Copyright © 2015 John Wiley & Sons, Ltd.
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 callMore From: Transactions on Emerging Telecommunications Technologies
Disclaimer: 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.
