Ring Network Node Recovery via Priority-Based Link Status
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ring-based networks face challenges in recovery time and scalability due to limitations in existing protocols, such as misjudgments during network overload and large topology issues, leading to inefficient packet recovery and potential single point failures.
Innovation Solution
A distributed recovery method where each node in the network has priority values for adjacent nodes, allowing for the transmission of link-down and link-up packets with specific priority values to quickly identify and resolve errors, thereby forming forward or blocked links to ensure efficient network recovery without repeated processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a detection signal is sent out periodically with timeout trigger mechanism, then network recovery can be detected, but misjudgment occurs easily under network overload conditions
Solution Approach 1:
The patent applies preliminary action by pre-configuring priority values in each node before failure occurs. When a link failure happens, nodes with higher priority values automatically become active without needing complex real-time detection signals or timeout mechanisms. This eliminates misjudgment under overload conditions while maintaining simple detection.
2Reliability
If the recovered control packet is looped around the whole ring-based network and each node clears its filtering database, then network topology is updated, but recovery efficiency is low because recovery waits for the last node
Solution Approach 1:
The patent applies preliminary action by pre-configuring priority values in each node before failure occurs. When a link failure happens, nodes with higher priority values automatically become active without needing complex real-time detection signals or timeout mechanisms. This eliminates misjudgment under overload conditions while maintaining simple detection.
Solution Approach 2:
The patent segments the recovery process by allowing nodes to independently clear their filtering databases based on their priority values rather than waiting for a centralized control packet to complete a full loop. High-priority nodes can activate and clear their databases immediately, parallelizing the recovery process across multiple nodes simultaneously.
3Reliability
If master switch priority setting procedure is used to determine backup master switch, then network paralysis is avoided, but the procedure is complicated and time-consuming
Solution Approach 1:
The patent applies preliminary action by pre-configuring priority values in each node before failure occurs. When a link failure happens, nodes with higher priority values automatically become active without needing complex real-time detection signals or timeout mechanisms. This eliminates misjudgment under overload conditions while maintaining simple detection.
Solution Approach 2:
The patent enables self-service by allowing nodes to automatically determine their activation status based on pre-configured priority values without requiring complex master switch election procedures. Each node independently evaluates its own priority value and activates or remains blocked accordingly, eliminating the need for complicated priority setting and election protocols.
Data Source
AI summary
A recovery method for ring-based network comprises following steps: when an error occurs at first node, second and third nodes adjacent to the first node transmit a link-down packet respectively; after the first node is repaired, the first, second and third nodes transmit a link-up packet respectively, and each link-up packet includes a priority value of the first, second or third node; the priority values of the first, second and third nodes are compared with each link-up packet to enter the ring port of the first node, the second node or the third node into a forward status or a blocked status; and a forward link or a blocked link is formed among the ring ports of the first, second and third nodes.