Abstracted Network Link Metric Computation for Route Planning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network technologies lack a method for computing link metric information for abstracted network links, which is essential for route planning across provider networks, as existing procedures do not account for resource availability in underlying networks.
Innovation Solution
A method is introduced to compute metric information for abstracted links by receiving resource availability information from network elements, constructing a spanning tree using the 'shortest widest path' algorithm, and transforming this information into metric data for client network elements, allowing for optimal route selection without exposing the underlying network topology.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If an abstracted network map with fewer nodes is used to represent the provider network, then route searching and comparison become faster, but the accuracy of resource availability information may be compromised
Solution Approach 1:
The patent introduces abstracted network links as intermediaries that aggregate multiple physical links between network elements. These abstracted links serve as mediators that preserve resource availability information while simplifying the network representation. The abstraction layer maintains accuracy by computing metric information that reflects the aggregate resource capacity of underlying physical links, allowing fast route searching without sacrificing resource availability precision.
Solution Approach 2:
The patent transforms detailed physical link resource information into aggregated metric information for abstracted links. By changing the parameter representation from individual link capacities to composite metric values that reflect total available resources, the system achieves both computational efficiency and accuracy. The metric information is computed to preserve the essential resource availability characteristics while operating at the abstracted level.
2Measurement precision
If detailed network topology information is provided to client network elements, then route planning accuracy improves, but network scalability and security are reduced
Solution Approach 1:
The patent extracts only the essential resource availability information needed for route planning while removing detailed topology information from the abstracted network map. Client network elements receive metric information about resource capacity without exposing the actual physical network structure. This extraction approach maintains route planning accuracy by providing sufficient resource data while enabling scalability by hiding complex topology details.
Solution Approach 2:
The abstracted network map acts as an intermediary layer between the detailed physical network and client network elements. It provides route planning information without exposing the actual network topology, thus maintaining security and scalability. The intermediary preserves necessary resource availability data while filtering out sensitive structural information.
3Measurement precision
If the abstracted network map is updated frequently to reflect network changes, then route planning accuracy is maintained, but system complexity and processing overhead increase
Solution Approach 1:
The patent implements a dynamic update mechanism where metric information for abstracted links is updated based on changes in the underlying physical network. The system dynamically adjusts the abstraction level and update frequency based on network conditions and change detection. This dynamic approach maintains route planning accuracy by updating information when necessary while reducing unnecessary processing overhead by avoiding constant full-scale updates.
Data Source
AI summary
A method and apparatus for associating metric information with an abstracted link of an abstracted network map that includes certain network elements (NEs) of a data transport network involves computing routes through the data transport network between the NEs of the abstracted network map. The routes may be computed using the shortest widest path algorithm. The routes from an NE are exchanged with the other NEs of the abstracted network map, so that an edge NE receives the resource availability information of all optimal routes between pairs of NEs in the abstracted network map. The edge NE then transforms the resource availability of a corresponding optimal route into metric information of an abstracted link. The metric information is sent to a client associated with the abstracted network map to permit the client to make routing decisions.