Area-Local Label-Mapping LSAs for Edge Device Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for distributing edge-device labels across routing areas in computer networks lead to redundant FIB and LSDB entries, increased memory consumption, and latency due to the inability to aggregate ASBR addresses, resulting in inefficient routing computations and unnecessary network bandwidth usage.
Innovation Solution
Separate distribution of edge-device labels using novel label-mapping LSAs, which are generated by area border devices and confined to a single routing area, allowing for conventional edge-device address summarization and aggregation, reducing memory consumption and improving routing efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If edge-device labels are distributed across routing areas using conventional methods, then routing information is propagated, but redundant FIB and LSDB entries are created, increasing memory consumption
Solution Approach 1:
The patent segments the routing information distribution by introducing separate label-mapping LSAs that are confined to individual routing areas, distinct from the conventional inter-area label distribution. This segmentation allows each routing area to maintain only the labels relevant to its edge devices, eliminating redundant label entries in other areas' FIBs and LSDBs, thereby reducing memory consumption while preserving routing information propagation.
Solution Approach 2:
The patent extracts the label distribution function from the conventional inter-area routing information propagation mechanism. By separating label distribution into dedicated label-mapping LSAs that are area-local, the patent removes redundant label information from being propagated across all routing areas, thus reducing the quantity of routing data stored in memory without compromising the ability to propagate necessary routing information.
2Reliability
If edge-device labels are distributed across routing areas, then routing information is available, but route aggregation of ASBR addresses cannot be performed, increasing FIB lookup time
Solution Approach 1:
The patent segments label distribution into area-local label-mapping LSAs, which enables ASBR address aggregation at area boundaries. By confining label information to specific routing areas, the patent allows summary LSAs to aggregate multiple ASBR addresses into single entries in the FIB, reducing the number of lookup operations required and thereby decreasing FIB lookup time while maintaining routing information availability through the segmented label-mapping mechanism.
Solution Approach 2:
The patent merges multiple ASBR address entries into aggregated summary LSAs at area boundaries. By combining multiple specific ASBR addresses into a single aggregated route entry in the FIB, the patent reduces the number of individual lookups required, thus decreasing FIB lookup time while the segmented label-mapping LSA mechanism ensures that routing information remains available through the appropriate area-local label mappings.
3Ease of operation
If conventional inter-area summarization is used for edge-device addresses, then routing is simplified, but edge-device labels cannot be distributed, reducing network performance
Solution Approach 1:
The patent segments the routing information distribution into two independent mechanisms: conventional inter-area summarization for routing simplification and area-local label-mapping LSAs for label distribution. This segmentation allows both functions to operate simultaneously without interference, maintaining routing simplification through summary LSAs while improving network performance through efficient area-local label distribution that enables route aggregation and reduces FIB lookup time.
Solution Approach 2:
The patent introduces label-mapping LSAs as an intermediary mechanism that bridges the gap between conventional inter-area summarization and modern label switching requirements. This intermediary allows routing simplification to be maintained through traditional summary LSAs while simultaneously enabling high-performance label distribution through the area-local label-mapping mechanism, thus achieving both routing ease and network performance.
4Reliability
If labels are distributed across all routing areas, then complete routing information is available, but LSA looping occurs and network bandwidth is wasted
Solution Approach 1:
The patent segments label distribution into area-local label-mapping LSAs that are confined to individual routing areas. This segmentation prevents LSA looping by ensuring that label information does not propagate across area boundaries multiple times, thereby eliminating redundant transmissions and wasting network bandwidth. Each routing area receives only the label information it needs locally, maintaining routing information completeness through the segmented approach while reducing network bandwidth consumption.
Solution Approach 2:
The patent applies preliminary anti-action by confining label-mapping LSAs to area-local scope, which preemptively prevents LSA looping before it can occur. By limiting the propagation scope of label information to within individual routing areas, the patent eliminates the possibility of LSAs circulating across multiple areas and consuming network bandwidth, thus preventing the harmful effect of LSA looping while maintaining complete routing information availability through the segmented distribution mechanism.
Data Source
AI summary
A system and method are provided for separately distributing edge-device labels and routing information across routing areas of a computer network. Because the edge-device labels are distributed separately from network routing information, the process of distributing the edge-device labels does not preclude conventional edge-device address summarizations. Illustratively, a novel “label mapping” LSA is employed for distributing the edge-device labels across routing areas. The label-mapping LSA may be embodied as an area-scope OSPF opaque LSA (type 10) or an IS-IS LSP containing TLVs of area scope. Advantageously, the present invention is generally applicable whenever label values are allocated to edge devices in a multi-area computer network and data is “tunneled” through the network from one edge device to another.