Decentralized Data Network Routing via Tree Structure Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing decentralized data networks face inefficiencies in routing data due to the lack of effective methods for dividing path expressions into unambiguous and ambiguous sections, which hinders efficient data forwarding and management.
Innovation Solution
A method is introduced that maps tree structures onto decentralized data networks, allowing for the division of path expressions into distinct and ambiguous sections, enabling efficient data routing by searching resources based on overall paths rather than individual node traversal, and utilizing peer-to-peer networks for scalability and reliability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If path expressions are processed node by node in decentralized data networks, then routing can be performed using existing infrastructure, but data forwarding efficiency deteriorates due to excessive traversal steps
Solution Approach 1:
The patent segments path expressions into unambiguous and ambiguous sections, allowing different processing strategies for each type. Unambiguous sections are resolved directly through resource searching, while ambiguous sections are handled through multiple possible path explorations, thereby improving forwarding efficiency without overwhelming the system with complex node-by-node traversal
Solution Approach 2:
The patent introduces an intermediary mechanism that maps tree structure paths to resources managed in the decentralized network. This intermediary layer translates high-level path expressions into actionable routing decisions, reducing the complexity of direct node-by-node traversal while maintaining routing accuracy
2Reliability
If resources are replicated multiple times in the decentralized network, then reliability improves through fault tolerance, but network complexity increases
Solution Approach 1:
The patent implements resource replication by creating copies of resources across multiple network nodes. Each resource is replicated according to predefined policies, ensuring that if one node fails, other nodes can continue to provide the same resource, thereby improving network reliability without requiring complete redundancy
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The invention relates to a method for forwarding data in a local data network. In this context, a data network is considered in which a multiplicity of network nodes in a local data network form a first layer and tree nodes in a tree structure as a second layer are mapped onto the multiplicity of network nodes on the first layer, wherein a respective tree node is characterized by an explicit path in the tree structure and each path has an explicitly associated resource managed by at least one network node in the local data network. A suitable definition of explicit and ambiguous path sections which are used for queries at tree nodes in the tree structure means that the invention allows efficient routing with as few hops as possible between the individual network nodes. This is ensured particularly by the use of a peer-to-peer network with a distributed hash table as the local data network. Peer-to-peer networks provide a high level of failsafety, scalability and reliability. A preferred area of application for the invention is control networks for power supply networks, in which a tree structure for the control of the power supply network is mapped onto a peer-to-peer network. In this case, it is also possible for a plurality of tree structures to be generated and mapped onto the peer-to-peer network, depending on the application. The tree structures may be designed according to different criteria; an example of one criterion is the geographical situation of power producers in a power supply network. Another criterion is the type of power of the individual power producers.