Paper detail

BSROne: Binary Search with Routing of O(1); A Scalable Circular Design for Distributed Networks

Peer-to-Peer (P2P) networks as distributed solutions are used in a variety of applications. Based on the type of routing for queries among their nodes, they are classified into three groups: structured, unstructured and small-world P2P networks. Each of these categories has its own applications and benefits. Structured networks by using Distributed Hash Tables (DHT) can forward request search queries more efficiently. These networks usually organize a specific topology and make a geometrical shape. A circular topology is a prevalent design which was first introduced by Chord. In this paper, we propose BSROne, a circular structured P2P design which attempts to consider several shortcomings in the current networks. In our proposed method, we want to achieve O(1) routing time without requiring all of the nodes to know about each other. By removing the real connections between nodes and tying all of them with super-nodes, we could reduce the number of overheads that are essential to maintain the connectivity between nodes in such networks. Furthermore, we gave the network an ability to scale up by introducing one layer above super-nodes. We achieved this by emulating the design of binary search algorithm for supreme-nodes. In this paper, at first we introduce a design where fixed super-nodes with unlimited resources are given to the distributed network. In the next step, we explain how it can manage to work as a P2P application. We finally discuss the possibility of removing the scalability issue in a P2P environment for our design.