Policy-Based Backup Path Filtering in Packet Switching Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current packet switching networks face inefficiencies in determining backup paths due to dynamic topology, leading to excessive calculations and resource usage when considering all neighboring routers for loop-free alternative routes, especially in large networks with numerous neighboring nodes.
Innovation Solution
Implementing policy-based filtering to reduce the number of next-hop candidates for backup paths, focusing on architectural roles, security levels, and regional considerations, thereby determining a shorter-path, loop-free backup route and reducing the number of calculations required.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all neighboring routers are considered for backup paths in dynamic network topology, then backup path reliability is improved, but calculation complexity and resource usage increase significantly
Solution Approach 1:
The patent segments the set of all neighboring routers into multiple groups based on policy criteria (architectural roles, security levels, regional considerations). This segmentation reduces the search space for backup path calculation while maintaining reliability by ensuring that valid backup candidates are not excluded. Each segment represents a filtered subset of neighbors that meet specific policy requirements.
Solution Approach 2:
The patent applies local quality by assigning different policy attributes to different neighboring routers (e.g., edge router vs. core router roles, different security levels). This allows the system to treat different neighbors differently based on their specific characteristics, filtering out inappropriate candidates locally rather than applying a uniform approach to all neighbors.
2Adaptability or versatility
If all neighboring routers are considered for backup paths, then path selection flexibility is improved, but processing time increases
Solution Approach 1:
The patent performs preliminary filtering of neighboring routers based on policy criteria before the actual backup path calculation is needed. By pre-establishing which neighbors are valid backup candidates based on architectural roles, security levels, and regional considerations, the system reduces processing time during runtime while maintaining path selection flexibility among the pre-validated candidates.
3Productivity
If comprehensive policy filtering is applied to reduce next-hop candidates, then resource efficiency is improved, but path selection adaptability may be reduced
Solution Approach 1:
The patent changes the parameters used for path selection by introducing policy-based filtering criteria (architectural roles, security levels, regional considerations) in addition to traditional metrics. This allows the system to efficiently filter candidates based on hard policy constraints while still maintaining adaptability within the filtered set by considering multiple next-hop candidates that meet the policy criteria.
Data Source
AI summary
In one embodiment, candidate routing backup paths are limited based on policy considerations. In one embodiment, a smaller plurality of next-hop candidates is established by policy filtering a plurality of next-hop candidates for backing up one or more routes over one or more links to a first packet switching device in a network, with the smaller plurality of next-hop candidates consisting of fewer next-hops than in the plurality of next-hop candidates. A shortest-path, loop free backup route is determined for each of the plurality of routes by considering each of the smaller plurality of next-hop candidates and not all of the plurality of next-hop candidates. This routing information corresponding to each of said determined shortest-path, loop free backup routes for use in backing up corresponding routes is installed in a routing data structure.