Hierarchical Virtualization for Scalable Traffic Engineering Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current traffic engineering routing in large networks faces challenges such as excessive information management, high memory and computation requirements, and complexity in path computations, especially in wavelength division multiplexing networks, due to the need for real-time rediscovery and redistribution of data, and the difficulty in summarizing rich traffic engineering information without losing critical details.
Innovation Solution
The method involves collapsing traffic engineering domain segments into virtual nodes with unique identifiers and detailed connectivity matrices, allowing for hierarchical virtualization and reconfiguration of access and internal links to compartmentalize and aggregate traffic engineering information, enabling scalable routing without requiring entities to know all network elements and links.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If full traffic engineering information is maintained in a flat single-area configuration, then complete routing information is available for path computation, but the database size and memory requirements become exponentially larger as the network grows
Solution Approach 1:
The patent divides the network into multiple hierarchical levels (area level and domain level). Area border nodes segment the network topology into distinct areas, and domain border nodes further segment into domains. This segmentation allows routing information to be partitioned and stored hierarchically, reducing the database size at each node while maintaining complete routing information through aggregated summaries at border nodes.
Solution Approach 2:
The patent introduces a hierarchical dimension to the traditional flat routing architecture. By adding the area and domain levels above the node level, the system transforms the single-dimensional flat structure into a multi-dimensional hierarchical structure. This allows routing information to be organized and stored efficiently across multiple levels, reducing memory requirements while preserving routing completeness.
2Measurement precision
If detailed traffic engineering information is redistributed across all network nodes in real time, then accurate path computation is enabled, but computation power requirements and processing complexity increase significantly
Solution Approach 1:
The patent enables area border nodes and domain border nodes to have detailed local traffic engineering information about their respective areas, while interior nodes only need aggregated summary information. This local quality approach allows accurate path computation at border nodes where detailed information exists, while reducing computation requirements at interior nodes that only need to make forwarding decisions based on aggregated data.
Solution Approach 2:
Area border nodes and domain border nodes act as intermediaries that aggregate and summarize traffic engineering information from their respective areas. These intermediary nodes perform the complex path computation using detailed local information, then distribute simplified routing decisions to interior nodes. This intermediary approach enables accurate path computation without requiring all nodes to have full detailed information or perform complex computations.
3Productivity
If traffic engineering information is aggregated and summarized for redistribution, then database size is reduced, but critical routing details may be lost
Solution Approach 1:
The patent segments routing information aggregation into two distinct levels: area-level aggregation by area border nodes and domain-level aggregation by domain border nodes. Each level maintains appropriate detail for its scope - area border nodes preserve details necessary for area-wide routing, while domain border nodes maintain details for inter-domain routing. This segmented aggregation prevents loss of critical information at each level while achieving overall scalability.
Solution Approach 2:
Different nodes are assigned different qualities of routing information based on their roles. Border nodes maintain detailed local information about their areas/domains and aggregated information about other areas/domains, while interior nodes receive only aggregated summary information. This local quality approach ensures that nodes have precisely the level of detail they need for their specific routing functions, preventing both information loss and excessive data storage.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for scaling Traffic Engineering, TE, routing in a network, comprising a plurality of network elements (nodes) connected in a given layer to each other via links, wherein contiguous TE domain segments, TE-SEGs, of a TE domain of said network are collapsed into virtual TE nodes, VN, each having an allocated TE domain unique identifier, VNID, and a detailed connectivity matrix, DCM, to provide a hierarchically virtualized network topology of said network.