OSPF Unsynchronized Adjacency Management for Mobile Ad-hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Mobile Ad-hoc Networks, the overhead of maintaining full database exchanges between routers leads to unnecessary traffic and reduced network throughput, as OSPF protocols require synchronized databases for all neighbors, which is not desirable due to prohibitive costs and lost forwarding paths.
Innovation Solution
Implement a method that delays database synchronization between nodes if a new neighboring node is already reachable in the shortest path data structure, allowing OSPF updates to be flooded only when necessary, using indicators like the 'unsynchronized bit' or new link types to manage unsynchronized adjacencies and reduce traffic.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If full database synchronization is performed with all neighboring nodes, then routing reliability is improved, but network traffic overhead increases and throughput decreases
Solution Approach 1:
The patent segments the database synchronization process into selective synchronization. Instead of synchronizing with all neighbors, the router identifies and synchronizes only with neighbors that are not reachable through alternative paths. This is achieved by dividing neighbors into two categories: those requiring full DB exchange (unsynchronized neighbors) and those that can be ignored (reachable neighbors via other paths).
Solution Approach 2:
The patent applies partial action by performing database synchronization only when necessary, rather than universally with all neighbors. The router executes a modified SPF algorithm to determine which neighbors require synchronization, thereby performing only the necessary partial synchronization action to maintain routing reliability while avoiding excessive traffic.
2Loss of energy
If database synchronization is delayed, then unnecessary OSPF packet transmission is reduced, but routing information may become stale
Solution Approach 1:
The patent performs preliminary action by executing a modified SPF algorithm before database synchronization to pre-determine reachability. This preliminary computation identifies which neighbors can be safely ignored, allowing the router to delay synchronization without losing critical routing information, as the preliminary analysis ensures only necessary synchronizations are postponed.
Solution Approach 2:
The patent implements feedback mechanisms where the router continuously monitors the shortest path data structure and updates reachability determinations. When topology changes occur, the feedback loop re-evaluates which neighbors require synchronization, ensuring routing information remains fresh while minimizing unnecessary packet transmission through dynamic adjustments.
3Productivity
If unsynchronized adjacencies are used for data plane forwarding, then network throughput is improved, but routing protocol complexity increases
Solution Approach 1:
The patent introduces dynamic behavior to the OSPF protocol by allowing adjacencies to exist in different states (synchronized or unsynchronized) and dynamically managing them based on reachability. The router dynamically determines which adjacencies can be used for data plane forwarding without full DB exchange, thereby improving throughput while managing complexity through stateful differentiation.
Solution Approach 2:
The patent applies local quality by treating different adjacencies differently based on their specific characteristics (reachability status). Not all adjacencies are treated uniformly; instead, the router applies differentiated policies where unsynchronized but reachable adjacencies enable forwarding while synchronized adjacencies maintain full protocol compliance, thus optimizing throughput locally without compromising overall protocol stability.
Data Source
AI summary
A method and apparatus for managing network communication that operate on the idea that if a new neighboring node is already reachable as represented in a shortest path data structure that the local node consults, there is no urgency in doing a full database synchronization between the local node and the neighboring node. The present invention delays database synchronization as long as possible to reduce unnecessary OSPF packets traversing communication links between nodes of the network. Since unsynchronized neighbors remain in 2-way state, OSPF updates are not flooded over the corresponding interfaces.