Notvia Address Repair Path Construction in Data Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data communication network repair methods often result in non-shortest repair paths and require additional forwarding mechanisms, leading to inefficiencies and increased computational overhead, especially when dealing with link or router failures, as they rely on neighbors to steer packets without full network awareness of the failure.
Innovation Solution
The method involves each node advertising 'notvia addresses' for every neighbor, allowing all nodes to calculate repair paths proactively, enabling encapsulation of packets to bypass failed components and ensuring delivery through normal IP forwarding without additional layers of encapsulation, thus constructing the shortest available repair path.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If existing repair methods use neighbors to steer packets around failures, then repair functionality is achieved, but the repair paths are non-shortest and computational overhead increases
Solution Approach 1:
The patent pre-calculates and stores repair paths for all possible single-node failures before they occur. Each node computes repair paths to all other nodes assuming each neighbor might fail, and stores these pre-computed paths in a repair path database. When a failure occurs, the pre-computed shortest repair path is immediately retrieved without requiring complex real-time calculations, thus achieving both shortest paths and reduced computational overhead during actual failure events.
2Reliability
If additional forwarding mechanisms are implemented for repair, then failure recovery capability is improved, but device complexity and operational overhead increase
Solution Approach 1:
The patent uses IP address copying/masking techniques to implement repair forwarding. Instead of complex additional forwarding mechanisms, it creates a virtual copy of the network topology where each node has a virtual IP address representing the network segment behind a potential failure point. Repair packets are forwarded to these virtual addresses using standard IP routing, and the underlying infrastructure automatically handles the delivery through alternative paths, thus achieving reliable failure recovery using only standard IP forwarding without additional complex mechanisms.
3Loss of time
If proactive repair path calculation is implemented at all nodes, then repair speed is improved, but network-wide computational load increases
Solution Approach 1:
The patent implements local proactive repair path calculation where each node independently computes repair paths only for its own perspective - i.e., each node calculates repair paths assuming its own neighbors might fail, not all possible failures in the entire network. This localizes the computational effort to what is necessary for each node's immediate repair needs, reducing overall network computational load while still enabling fast local repair response. The distributed nature means each node does minimal local work rather than one node doing all the work or all nodes doing exhaustive calculations.
Data Source
AI summary
A method of constructing a repair path around a non-available component in a data communications network having, as components, nodes having a network address and links there between comprises the step, performed at a participating node, of receiving from a notifying node in the network, a notification identifying the notifying node and components through which the notifying node can be reached. The method further comprises the step of deriving, from the notification, a network repair address for use in the event of non-availability of a component identified in the notification. The method further comprises the step of constructing a repair path for the repair address.


