OSPF Router Database Exchange Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for establishing full adjacency between Open Shortest Path First (OSPF) routers involve unnecessary link state database exchanges, consuming bandwidth and CPU cycles, as they use a passive approach that fails to efficiently eliminate unwanted exchanges.
Innovation Solution
An active approach is employed to deduce information about unreachable routers from link state changes, recording this information to generate a neighbor database summary list that excludes unnecessary LSAs, thereby reducing unwanted link state database exchanges and processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional passive approach is used for link state database exchange, then full adjacency can be established between OSPF routers, but unnecessary database exchanges consume link bandwidth and CPU cycles
Solution Approach 1:
The patent applies preliminary action by proactively determining reachability status of neighboring routers before initiating full database exchange. The system pre-calculates which LSAs are unnecessary to exchange based on reachability information, thereby avoiding wasteful bandwidth and CPU consumption while ensuring full adjacency is properly established.
Solution Approach 2:
The patent extracts and removes unnecessary LSAs from the database exchange process. By identifying unreachable routers and their associated LSAs beforehand, the system selectively excludes these unnecessary components from the exchange, reducing bandwidth consumption and processing overhead while maintaining the essential functionality of full adjacency establishment.
2Loss of energy
If passive approach eliminates some unnecessary exchanges, then bandwidth is saved, but about 50% of unnecessary exchanges and processes still occur
Solution Approach 1:
The patent implements feedback by continuously monitoring and utilizing reachability information about neighboring routers. This feedback mechanism allows the system to dynamically adjust which LSAs are exchanged, providing a closed-loop control that significantly reduces unnecessary exchanges (beyond the 50% reduction achieved by passive approaches) while optimizing the efficiency of adjacency establishment.
Solution Approach 2:
The system performs preliminary determination of router reachability and LSA necessity before the actual database exchange. This advance preparation enables the system to eliminate far more unnecessary exchanges compared to passive approaches that only react during the exchange process, thereby significantly improving productivity while reducing bandwidth consumption.
3Stability of the object's composition
If full database exchange is performed, then complete synchronization is achieved, but time and resources are wasted when routers are temporarily unreachable or have unchanged databases
Solution Approach 1:
The patent applies preliminary action by determining reachability status and identifying unchanged LSAs before initiating database exchange. This advance preparation prevents wasteful time consumption by skipping exchanges with unreachable routers or those with unchanged databases, while still ensuring complete synchronization is achieved when necessary.
Solution Approach 2:
The patent extracts and removes unnecessary LSAs related to unreachable routers or unchanged database entries from the exchange process. By selectively excluding these redundant components, the system significantly reduces adjacency establishment time while maintaining complete database synchronization for all necessary updates.
Data Source
AI summary
The present invention relates to systems and methods for eliminating unnecessary link state database exchanges and processes when two OSPF routers are forming a full adjacency. In particular, the invention provides methods and mechanisms for deducing information about unreachable routers from link state changes received, recording the information about the unreachable routers for a given period of time, constructing a neighbor database summary list that does not contain the LSAs that the neighbor has through using the information about the unreachable routers and reachable routers, and determining whether the neighbor router is restarted after it becomes unreachable. In addition, the present invention provides a few of options to deduce and use the information about the unreachable routers and the information in the link state database for eliminating unnecessary link state database exchanges and processes.