Randomizing Link State Message Age Fields to Prevent LSA Storms
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Large networks using link-state protocols like OSPF face instability and resource overload due to synchronized refreshes of link state advertisements (LSAs), leading to LSA storms that can cause retransmissions, loss of adjacency, and customer traffic loss, particularly affecting nodes with less powerful processors.
Innovation Solution
Setting the age field of link state messages to a random value during initial generation to de-synchronize refresh instances, preventing synchronized LSA storms and ensuring stable network operations in large networks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If link state advertisements are refreshed at synchronized intervals, then network topology information remains consistent across all nodes, but LSA storms occur causing resource overload and network instability
Solution Approach 1:
The patent applies periodic action by implementing random intervals between LSA refreshes instead of fixed synchronized intervals. Each node determines a random time period before refreshing its LSAs, which desynchronizes the periodic refresh actions across the network while still maintaining regular update cycles. This resolves the contradiction by preserving the consistency benefits of periodic updates while eliminating the harmful synchronized LSA storms.
Solution Approach 2:
The patent introduces asymmetry by having each node use different random refresh intervals rather than symmetric synchronized timing. The asymmetry in refresh timing across nodes prevents simultaneous LSA generation while maintaining individual node consistency. This asymmetric approach eliminates the synchronized storm condition while preserving network-wide topology synchronization over time.
2Speed
If link state advertisements are refreshed frequently, then network topology updates are timely, but processor workload increases causing nodes to fall behind and lose adjacency
Solution Approach 1:
The patent applies dynamics by making the LSA refresh interval variable rather than fixed. Each node dynamically determines its refresh timing based on random values, allowing the system to adapt refresh rates to individual node capabilities and network conditions. This dynamic approach maintains timely topology updates while preventing processor overload by avoiding synchronized peak workloads.
3Ease of operation
If the age field is set to zero for all LSAs, then LSA freshness is easily tracked, but synchronized refreshes occur causing LSA storms
Solution Approach 1:
The patent applies parameter changes by modifying the age field initialization approach. Instead of always setting age to zero, the patent introduces random age values or random delays before refreshing LSAs. This parameter variation maintains the ease of tracking LSA freshness while preventing synchronized refreshes, as nodes with different random parameters will refresh at different times even when receiving LSAs with the same age field values.
Data Source
AI summary
A node having a memory storing a network topology and a routing table. The node also having a processing device programmed to generate a link state message and during the generating of the link state message, set a value of an age field of the link state message to a random value.