Hierarchical Routing Bandwidth Pruning Threshold
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing hierarchical routing techniques in communication networks often result in suboptimal routing due to the selection of routes with insufficient bandwidth and excessive delay, as clusters advertise either minimum weight paths or widest paths, leading to inefficient route optimization.
Innovation Solution
The method involves clusters advertising constrained minimum weight paths, which are selected based on a bandwidth pruning threshold, ensuring paths with the smallest weight that meet or exceed the threshold, thereby improving route selection and scalability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If clusters advertise minimum weight paths, then routing optimization is improved, but bandwidth sufficiency deteriorates
Solution Approach 1:
The patent changes the routing parameter from simple minimum weight to constrained minimum weight by introducing a bandwidth threshold parameter. Clusters advertise paths that satisfy both the weight minimization objective and the bandwidth constraint, transforming the routing decision from a single-parameter optimization to a multi-parameter constrained optimization problem.
Solution Approach 2:
The patent introduces dynamic bandwidth threshold adjustment mechanisms where clusters can adaptively set and update bandwidth pruning thresholds based on network conditions. This allows the routing system to dynamically balance between optimization and bandwidth sufficiency requirements.
2Reliability
If clusters advertise widest paths, then bandwidth sufficiency is improved, but routing optimization deteriorates
Solution Approach 1:
The patent transforms the routing advertisement from a single widest-path metric to a constrained minimum weight path metric that incorporates both weight and bandwidth parameters. This dual-parameter approach allows simultaneous consideration of routing optimization and bandwidth sufficiency.
3Measurement precision
If detailed cluster topology is advertised, then routing precision is improved, but network scalability deteriorates
Solution Approach 1:
The patent extracts only the essential routing information (constrained minimum weight paths meeting bandwidth thresholds) from the complete cluster topology and advertises this condensed set externally. Internal detailed topology remains private, reducing advertisement overhead while maintaining sufficient routing precision.
Solution Approach 2:
The patent segments routing information into internal detailed topology (not advertised) and external aggregated topology (advertised with constrained minimum weight paths). This segmentation allows precise internal routing while maintaining scalable external routing through aggregated views.
Data Source
AI summary
Methods and apparatus for hierarchical routing in communication networks are disclosed. An example hierarchical routing method for a communication network disclosed herein comprises determining a plurality of constrained weighted paths to connect pairs of border nodes of a cluster in the communication network, each constrained weighted path having a respective bandwidth and a respective weight, a constrained weighted path for a pair of border nodes of the cluster being selected, based on a bandwidth threshold, from a set of possible paths capable of connecting the pair of border nodes, and advertising the plurality of constrained weighted paths determined for the cluster.