English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Peer-to-Peer (P2P) networks as distributed solutions are used in a variety ofapplications. Based on the type of routing for queries among their nodes, theyare classified into three groups: structured, unstructured and small-world P2Pnetworks. Each of these categories has its own applications and benefits.Structured networks by using Distributed Hash Tables (DHT) can forward requestsearch queries more efficiently. These networks usually organize a specifictopology and make a geometrical shape. A circular topology is a prevalentdesign which was first introduced by Chord. In this paper, we propose BSROne, acircular structured P2P design which attempts to consider several shortcomingsin 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. Byremoving the real connections between nodes and tying all of them withsuper-nodes, we could reduce the number of overheads that are essential tomaintain the connectivity between nodes in such networks. Furthermore, we gavethe network an ability to scale up by introducing one layer above super-nodes.We achieved this by emulating the design of binary search algorithm forsupreme-nodes. In this paper, at first we introduce a design where fixedsuper-nodes with unlimited resources are given to the distributed network. Inthe next step, we explain how it can manage to work as a P2P application. Wefinally discuss the possibility of removing the scalability issue in a P2Penvironment for our design.

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