Braided Ring Byzantine Agreement With Self-Checking Node Pairs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing networks face challenges in consistently delivering data among nodes while tolerating faults and minimizing hardware and software overhead, particularly in scenarios with Byzantine errors and non-colluding failures, which are not adequately addressed by classical solutions.
Innovation Solution
A braided ring network topology with full-duplex bi-directional links and self-checking pairs of nodes that compare and relay data streams, using hop counts to ensure integrity and prevent masquerading, while maintaining flexible self-checking pair associations to tolerate multiple failures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If classical fault-tolerance solutions are implemented, then reliability is improved, but device complexity and overhead increase
Solution Approach 1:
The network is segmented into self-checking pairs of nodes, where each pair independently verifies data integrity. This segmentation allows fault tolerance to be achieved at a local level rather than requiring complex global verification mechanisms, thereby improving reliability while minimizing overhead.
Solution Approach 2:
Nodes perform preliminary self-checking of data streams before relaying them to other nodes. By checking data integrity in advance (comparing data streams from self-checking pairs and verifying hop counts), the system prevents corrupted data from propagating through the network, achieving fault tolerance without requiring complex post-delivery verification.
2Reliability
If data verification mechanisms are added, then reliability is improved, but loss of time increases
Solution Approach 1:
The self-checking verification process operates continuously and inline with data transmission rather than as a separate batch process. Nodes compare data streams and verify hop counts as part of the normal data relay operation, ensuring data integrity without introducing significant delays to the overall data delivery timeline.
Data Source
Figure 1
Figure 2
Figure 3A~3B
AI summary
In an example, a node in a network includes four ports coupled to respective nodes via respective links. Two of the ports are coupled to respective nodes via respective near links and two of the port are coupled to respective nodes via respective skip links. The node further includes a processor configured to compare first and second data streams, sourced from a self-checking pair of nodes, received in a first direction and to compare third and fourth data streams, sourced from the self-checking pair of nodes, received in a second direction. The processor is configured to relay the second data stream in the first direction and fourth data stream in the second direction and a hop count at the end of the respective data stream that is indicative of integrity of the respective data stream.