OSPF Aggregate Generation Minimizing Path Selection Error
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Address aggregation in Open Shortest Path First (OSPF) networks leads to information loss and sub-optimal routing due to the aggregation of subnet addresses, resulting in path selection errors between the actual forwarding path and the shortest path.
Innovation Solution
A method and apparatus that generate a minimum number of aggregates for a given network area while bounding the path selection error, using a theorem to determine the error based on border routers, subnets, and their distances, allowing for dynamic adjustment and trade-offs between the number of aggregates and the error bound.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If address aggregation is performed to reduce router computational overheads and memory requirements, then router resource consumption is reduced, but path selection error increases due to information loss
Solution Approach 1:
The patent changes the parameter of aggregation granularity by dynamically selecting different aggregate levels based on the calculated path selection error. Instead of using fixed aggregation, the system adjusts the aggregation parameter (error bound) to optimize the balance between reducing router overhead and maintaining routing precision.
Solution Approach 2:
The patent introduces dynamic aggregate selection where the set of aggregates is not fixed but determined dynamically based on network topology and error requirements. The system continuously evaluates and selects aggregates that minimize path selection error while maintaining resource efficiency, making the aggregation process adaptive rather than static.
2Measurement precision
If more aggregates are generated to reduce path selection error, then routing precision is improved, but router memory requirements and computational overhead increase
Solution Approach 1:
The patent uses a centralized aggregate selection process that computes the optimal set of aggregates and then distributes this information to all routers. Instead of each router independently computing aggregates (which would be computationally expensive), one router generates the aggregate set and others use it, reducing overall computational overhead while maintaining routing precision.
Solution Approach 2:
The patent performs aggregate selection in advance as a preliminary step before actual routing operations. By pre-computing the optimal aggregate set based on network topology, the system avoids repeated computational overhead during routing decisions, while ensuring that the aggregates are optimized for minimal path selection error.
3Loss of energy
If address aggregation is performed to reduce network bandwidth consumption, then network efficiency is improved, but information loss increases leading to sub-optimal routing
Solution Approach 1:
The patent optimizes the aggregation parameter (error bound) to find the optimal level of aggregation that minimizes both bandwidth consumption and information loss. By adjusting this parameter, the system achieves the right balance where aggregation provides bandwidth efficiency while the path selection error remains within acceptable limits.
Solution Approach 2:
The patent incorporates feedback mechanisms where the path selection error is calculated and used to adjust the aggregate selection. The system evaluates the actual routing paths taken and uses this feedback to refine aggregate choices, ensuring that information loss is minimized while maintaining the bandwidth efficiency benefits of aggregation.
Data Source
AI summary
A method and apparatus for generating at least one aggregate (e.g., a set of aggregates) for a given area of a network such that the number of aggregates is minimized subject to a maximum acceptable path selection error are disclosed. One operational benefit of the present method is that network administrators can select aggregates for an area based solely on the topology of the area without worrying about remaining areas of the OSPF network. Another benefit is that the present method enables trade-offs between the number of aggregates and the bound on the path selection error.