Network Area Abstraction for Link State Database Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network routing protocols face performance degradation due to the inclusion of extensive link state information in databases, which increases storage requirements and processing complexity, especially in large network topologies.
Innovation Solution
The method involves abstracting subareas within a network, allowing routing to occur without requiring the entire network topology to be maintained in link state databases, by representing subareas as virtual devices within the network, thereby reducing the need for extensive link state information storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If comprehensive link state information is included in routing databases, then routing accuracy and completeness is improved, but storage requirements and processing complexity increases
Solution Approach 1:
The patent divides the network into hierarchical levels (Level 1 areas and Level 2 areas) and segments the link state information accordingly. Level 1 routers maintain detailed topology only within their own area, while Level 2 routers maintain aggregated information about multiple areas. This segmentation allows routing accuracy to be maintained within each segment while reducing overall processing complexity and storage requirements across the entire network.
Solution Approach 2:
The patent introduces a hierarchical dimension to the traditional flat routing database structure. By organizing routing information across multiple levels (intra-area routing at Level 1, inter-area routing at Level 2), the system maintains comprehensive routing capability without requiring every router to process all network topology information simultaneously, thus reducing processing complexity while preserving routing accuracy.
2Measurement precision
If comprehensive link state information is included in routing databases, then routing accuracy and completeness is improved, but storage requirements increases
Solution Approach 1:
The patent segments the network topology into discrete areas, allowing each router to store link state information only for its local area rather than the entire network. Level 1 routers store detailed topology for their own area, while Level 2 routers store summarized information about multiple areas. This segmentation dramatically reduces storage requirements while maintaining routing accuracy through the hierarchical structure.
Solution Approach 2:
The patent extracts and separates detailed link state information from the global routing database. By removing the requirement for every router to maintain complete network topology and instead storing only locally relevant information in distributed databases, the system achieves comprehensive routing capability with minimal storage requirements at each node.
3Device complexity
If area abstraction is implemented, then storage and processing demands are reduced, but routing information completeness may be compromised
Solution Approach 1:
The patent introduces Area Border Routers (ABRs) as intermediary devices that maintain the connection between Level 1 and Level 2 routing domains. ABRs perform the critical function of translating and redistributing routing information between the detailed local topology and the aggregated global topology, ensuring that routing information completeness is maintained despite the abstraction and segmentation of the network.
Solution Approach 2:
The patent creates simplified copies of the network topology at different hierarchical levels. Level 2 routers maintain a copy of the network topology that is aggregated from multiple Level 1 areas, while Level 1 routers maintain detailed copies of their local area topology. These copied representations preserve essential routing information while reducing processing demands through the abstraction hierarchy.
Data Source
AI summary
A method and network device for embedded area abstraction. Specifically, the method and network device described herein implement the abstraction of one or more subareas of an area within a network implementing a link state protocol. Abstraction of a given subarea of a given area within a network may provide for routing using network devices in the given subarea without requiring that the network devices, in the complement of the given subarea within the given area, maintain link state information respective to the entire network topology of the given subarea.