A Communication Network, a Method of Routing Data Packets in Such Communication Network and a Method of Locating and Securing Data of a Desired Resource in Such Communication Network

Simple SummaryContent extracted from patent full text and abstract with AI.

The invention relates to a highly scalable communication network architecture and corresponding routing and data location methods. It introduces a peer-to-peer network where nodes are logically arranged in a series of concentric rings, each following a specific topology based on De Bruijn graphs. This structure allows extremely efficient data packet routing and resource location, while maintaining high resilience, optimal resource distribution, and low management cost even as the network grows or experiences churn (nodes joining and leaving). The design ensures that both data lookup and routing are performed with minimal hops and the routing tables remain small regardless of the network size.

Use CasesContent extracted from patent full text and abstract with AI.

• Peer-to-peer (P2P) file sharing networks and distributed storage systems.
• Decentralized cloud storage or content delivery networks (CDNs).
• Efficient routing overlay for IoT device communication.
• Decentralized social networks or messaging platforms.
• Federated identity or naming services in large networks.
• Blockchain or distributed ledger peer management and data discovery.

BenefitsContent extracted from patent full text and abstract with AI.

• Highly scalable architecture capable of supporting very large numbers of nodes with efficient routing and resource location.
• Network resilience and fault-tolerance, even in the face of high churn (frequent node joins and leaves).
• Consistent and balanced distribution of network resources and responsibilities among peers, avoiding load concentration.
• Minimized routing tables and deterministic management cost per node, regardless of overall network size, reducing memory and communication overhead.
• Fast lookup and routing operations, typically with fewer hops than existing P2P protocols like Chord.
• Logical (overlay) network representation means it can be implemented on top of existing physical infrastructure, such as the Internet.

Technical Classifications (CPCs)

Inventors & Applicants

Patent Abstract

Summary The invention regards a communication network comprising a plurality of network nodes, wherein the network nodes are logically arranged to form a plurality of concentric rings, all rings except the outermost ring being with high probability fully constructed; the number of nodes on each fully constructed ring being dD, wherein d denotes the base of an integer having D digits, D = 1, and wherein D also denotes the ring number, D starting with the value 1 for the innermost ring; each node being identified by an identification number unique in the network, said identification number having D digits, D = 1, and D denoting the ring number on which the node is located, and the value of each digit being between 0 and d-1; and each node of a given fully constructed ring is allowed to route data packets to one node in the next inner ring, to d nodes in the next outer ring, if the next outer ring is fully constructed, and to at least d nodes on the same ring. The invention further regards a method of locating and securing data of a desired resource in such communication network and a method of locating and securing data of a desired resource in such communication network.