SRLG Single-Point Failure Detection with Fiber Route Fragment Grids
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Identifying shared risk link groups (SRLGs) that share a common segment and are susceptible to simultaneous failure is computationally intensive and not amenable to parallel processing, posing challenges in preventing network downtime and data loss in fiber optic networks.
Innovation Solution
The solution involves dividing fiber paths into fragments, applying rectangular equidistant projection, and using a global grid to efficiently compare and identify overlapping segments by generating a table of cumulative overlap distances, facilitating parallel processing and routing decisions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If comprehensive analysis of KMZ data is performed to identify overlapping fiber routes, then identification accuracy of SRLG single points of failure is improved, but computational complexity increases and parallel processing becomes difficult
Solution Approach 1:
The patent segments the continuous KMZ coordinate data into discrete path fragments with a maximum number of coordinates each. This segmentation transforms the comprehensive analysis problem into manageable subtasks that can be processed independently, enabling parallel processing while maintaining identification accuracy through systematic comparison of fragmented path segments.
Solution Approach 2:
The patent applies rectangular equidistant projection to transform geographic coordinates into a standardized coordinate system, adding a dimensional transformation layer. This projection approach simplifies the spatial comparison problem by converting complex geographic relationships into standardized coordinate comparisons, reducing computational complexity while preserving overlap detection accuracy.
2Productivity
If fiber paths are divided into fragments and processed through rectangular equidistant projection, then parallel processing capability is improved, but processing steps and system complexity increase
Solution Approach 1:
By dividing fiber paths into standardized fragments with maximum coordinate limits, the system enables independent processing of each fragment across multiple processors. This segmentation creates natural parallelization units that can be distributed and processed simultaneously, significantly improving productivity through parallel computation of overlap distances.
Solution Approach 2:
The patent introduces standardized parameters including maximum coordinate count per fragment, geographic tolerance values, and grid cell dimensions. These parameter changes transform the processing approach into a systematic framework that balances parallel processing capability with manageable complexity through configurable thresholds and standardized data structures.
3Productivity
If a global grid system is implemented to organize path fragments, then comparison efficiency is improved, but data structure complexity and memory requirements increase
Solution Approach 1:
The patent superimposes a global grid system with standardized cell dimensions over the geographic coordinate space, transforming continuous spatial relationships into discrete grid cell assignments. This dimensional transformation enables efficient indexing and retrieval of path fragments by their grid cell locations, dramatically improving comparison efficiency while the grid structure provides an organized framework for managing data complexity.
Data Source
AI summary
Rectangular equidistant projection is applied to coordinates for path fragments of a plurality of fiber optic routes. A bounding box is generated for each path fragment. For each cell of a grid of cells where its bounding box overlaps with a bounding box created by the cell, each path fragment is placed into the cell of the global grid. For any cell with more than one path fragment, each path fragment inside the cell is compared to every other path fragment in that cell. For any path fragment with overlapping bounding boxes, the length of the overlap is saved. A table of cumulative overlap distances between path fragments is generated to identify overlapping segments and cumulative lengths of the overlap distances.