Ring Network Node Clique Aggregation via Self-Checking Pairs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed, fault-tolerant communication systems, particularly those using TDMA schemes and ring network topologies, are vulnerable to the formation of multiple TDMA 'cliques' due to differing power-on times among network nodes, which can lead to synchronization issues and potential failures in safety-critical applications.
Innovation Solution
A system where nodes communicate with both neighbor nodes and their neighbors' neighbors, allowing for clique detection and synchronization message prioritization, enabling nodes to defect to a higher-priority clique, form temporary self-checking pairs, and propagate synchronization messages to maintain network integrity and synchronization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If nodes in a ring network are powered on at different times, then network startup is flexible and gradual, but multiple TDMA cliques form causing synchronization issues
Solution Approach 1:
The system performs preliminary actions by establishing self-checking pairs before full network operation. When a node boots, it immediately forms a self-checking pair with its neighbor, creating a synchronized foundation before other nodes join. This preliminary synchronization prevents clique formation by ensuring the first node is ready to receive and propagate synchronization messages from subsequent nodes.
Solution Approach 2:
Self-checking pairs act as intermediaries that bridge different parts of the network. The first self-checking pair serves as a mediator that receives synchronization messages from later-booting nodes and propagates them to earlier nodes, preventing isolation and ensuring all nodes eventually synchronize without forming permanent cliques.
2Reliability
If nodes communicate with both neighbor nodes and neighbor's neighbor nodes, then clique detection and synchronization improve, but communication overhead and complexity increase
Solution Approach 1:
The communication process is segmented into distinct phases: initial neighbor communication for basic connectivity, then neighbor's-neighbor communication specifically for clique detection and synchronization message propagation. This segmentation allows the system to use extended communication only when needed for synchronization, reducing overall complexity while maintaining reliability.
Solution Approach 2:
Different communication patterns are applied to different parts of the network based on their synchronization needs. Nodes that have formed self-checking pairs use a simplified communication mode, while nodes detecting potential cliques activate the extended neighbor's-neighbor communication pattern. This local differentiation reduces overall system complexity while ensuring synchronization reliability where needed.
3Productivity
If nodes defect to higher-priority cliques, then network convergence to optimal synchronization is achieved, but network instability and reconfiguration overhead occur
Solution Approach 1:
The system implements periodic synchronization message transmission where nodes send and receive synchronization messages at regular intervals. This periodic action allows nodes to gradually detect clique structures and make informed defection decisions based on accumulated information rather than immediate reactions, reducing unnecessary reconfigurations while maintaining convergence speed.
Solution Approach 2:
Nodes use feedback from received synchronization messages to determine whether to defect to higher-priority cliques. The feedback mechanism includes priority information and clique identification that allows nodes to make intelligent decisions about defection timing and target selection, minimizing unnecessary reconfigurations while ensuring eventual convergence to the optimal synchronization state.
Data Source
AI summary
In one embodiment, a system comprises a plurality of nodes that are communicatively coupled to one another. Each of the plurality of nodes, in the absence of any faults, is communicatively coupled to at least a first neighbor node and a first neighbor's neighbor node and a second neighbor node and a second neighbor's neighbor node. When at least a first clique and a second clique exist within the plurality of nodes and a first node included in the first clique successfully receives a synchronization message associated with the second clique from the first neighbor node of the first node and the first neighbor's neighbor node of the first node, the first node does the following. The first node defects to the second clique and synchronizes to the synchronization message. The first node also communicates a join message to at least the second neighbor node of the first node and the second neighbor's neighbor node of the first node. The join message indicates that the second neighbor node and the second neighbor's neighbor node should defect to the second clique and listen for a subsequent synchronization message from the second clique to which the second neighbor node and the second neighbor's neighbor node should synchronize.