Virtual Network Node Link Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed systems with peer-to-peer networks lacking centralized storage or control, existing technologies face challenges in maintaining balanced network loads and self-organization, leading to inefficient link management and potential overload.
Innovation Solution
A method for operating virtual networks where each node maintains a list of addresses, allowing for link adjustments by inserting or removing addresses based on predetermined conditions, ensuring balanced link numbers and self-organization through message exchanges like AddLink, ChangeLink, and Notify messages.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If nodes maintain a fixed number of links in peer-to-peer networks, then network structure stability is improved, but network load balancing deteriorates due to inability to adapt to node failures and joins
Solution Approach 1:
The patent implements dynamic link management where nodes can add and remove links based on network conditions. The system transitions from static link counts to dynamic adjustment, allowing nodes to adapt their connectivity as other nodes join or leave the network, thereby maintaining both structural stability and load balancing.
Solution Approach 2:
Nodes autonomously manage their own link lists by receiving AddLink, ChangeLink, and Notify messages from other nodes. Each node independently decides whether to add, remove, or replace links based on its current link count and received messages, enabling self-organizing behavior without centralized control.
2Adaptability or versatility
If nodes allow unlimited link additions, then network connectivity and adaptability are improved, but network overload and complexity increase
Solution Approach 1:
The patent changes the parameter of link count from unlimited to bounded by a predetermined maximum. Nodes maintain links up to this maximum threshold, preventing network overload while preserving adaptability. The system dynamically adjusts the actual number of links within this parameter bound based on network conditions.
Solution Approach 2:
The system uses feedback mechanisms through Notify messages that inform nodes when their link count reaches the maximum. This feedback triggers link removal operations, creating a self-regulating system that maintains connectivity within safe bounds and prevents overload conditions.
3Productivity
If nodes frequently adjust links to maintain balance, then load distribution is improved, but message overhead and system complexity increase
Solution Approach 1:
Link adjustments occur periodically triggered by specific events rather than continuously. Nodes respond to AddLink, ChangeLink, and Notify messages at discrete intervals, adjusting links only when necessary. This event-driven periodic action reduces message overhead compared to continuous adjustment while maintaining load distribution efficiency.
Solution Approach 2:
Nodes autonomously process link adjustment messages and perform adjustments only when their link count falls outside acceptable bounds. This self-service approach minimizes unnecessary message exchanges and system complexity by acting only when required, rather than maintaining constant communication overhead.
Data Source
AI summary
Each node of a virtual network can store only a predetermined number of address links to other nodes. In response to receiving a link request between a first node and a second node, it is determined whether both the first and second nodes have less than the predetermined numbering their lists. If this condition is satisfied, the address of the first node is inserted into the second node's list and the address of the second node is inserted into the first node's list. If this condition is not satisfied, it is determined whether the first node list has at least two less than the predetermined number and, if so, then the link between the second and third nodes is broken and they are instead newly linked to the first node.