Notvia Repair Paths for Loop Prevention in Data Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Data communications networks face loops during routing transitions due to temporary desynchronization of link state databases and forwarding information, leading to inefficient packet forwarding when a node fails and lacks repair capability.
Innovation Solution
The implementation of a method and apparatus that assigns additional 'notvia' addresses to each interface, allowing nodes to compute and use repair paths around failed components by encapsulating packets with these addresses, ensuring delivery without relying on the failed node, and enabling any notvia-capable node to perform proxy repairs even if adjacent nodes lack the capability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If link state databases and forwarding information are updated during routing transitions, then network adaptability is improved, but loops can occur due to temporary desynchronization
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing repair paths in the forwarding information base before failures occur. When a loop is detected during routing transitions, these pre-computed repair paths are immediately activated to redirect traffic around the loop, preventing the loop from propagating without requiring real-time database synchronization.
Solution Approach 2:
The patent introduces repair paths as an intermediary mechanism between the link state database and forwarding information. These repair paths act as a mediator that decouples the forwarding decision from the potentially inconsistent database state, allowing packets to be redirected around loops using pre-computed alternative routes while the database synchronizes.
2Reliability
If repair capability is implemented at adjacent nodes, then loop prevention is improved, but device complexity increases
Solution Approach 1:
The patent applies universality by designing a repair mechanism that can be implemented by any node in the network, not just adjacent nodes. Any node with forwarding capability can compute and use repair paths, distributing the loop prevention function across multiple nodes rather than requiring specialized capability at specific locations, thereby reducing overall system complexity.
3Speed
If normal forwarding is used during routing transitions, then forwarding speed is maintained, but loops can form due to database desynchronization
Solution Approach 1:
The patent applies preliminary action by pre-computing repair paths and storing them in the forwarding information base before failures or loops occur. This allows the network to maintain high forwarding speeds by immediately switching to pre-computed repair paths when loops are detected, without requiring slow real-time database synchronization or complex loop detection algorithms during packet forwarding.
Data Source
AI summary
An apparatus for forwarding data in a data communications network having as components nodes and links there between, the apparatus being arranged to forward data to a receiving node via a primary path the apparatus further having a repair capability of computing a repair path around a failure component in the primary path to an address having a repair identifier for the receiving node not via the failure component, the apparatus being arranged to forward data to the receiving node via the repair path upon failure of the failure component if a node in the primary path to the receiving node does not have said repair capability.