Telecom Path Selection Algorithm Balancing Distance and Diversity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing algorithms for selecting multiple paths in telecommunications networks fail to effectively balance distance and diversity requirements, often prioritizing one over the other, leading to suboptimal path selection that may not utilize network redundancy efficiently or provide adequate protection against faults.
Innovation Solution
A heuristic-based algorithm that determines paths by combining a distance component and a diversity component, represented by the number of common links, to select paths that minimize overall distance and maximize diversity, using a modified Dijkstra algorithm to find a set of k paths that optimize both criteria.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Use of energy by moving object
If multiple paths are selected based on shortest path algorithms to minimize distance, then resource usage is reduced, but path diversity is insufficient leading to vulnerability to single faults
Solution Approach 1:
The patent segments the path selection process into multiple phases: first selecting the shortest path, then selecting additional paths that maximize diversity from the first path. This segmentation allows the system to achieve both resource efficiency (through shortest path selection) and fault tolerance (through diverse alternative paths) by dividing the single path selection problem into sequential multiple path selection steps.
Solution Approach 2:
The patent changes the selection parameter from purely distance-based (shortest path) to a composite parameter that includes both distance and diversity metrics. By modifying the path selection criterion to consider both the length of the path and its divergence from previously selected paths, the system can balance resource usage and reliability simultaneously.
2Reliability
If alternative paths are selected to maximize diversity, then fault tolerance is improved, but distance increases occupying larger network resources
Solution Approach 1:
The patent applies partial diversity rather than complete diversity. Instead of requiring alternative paths to be completely disjoint from the shortest path, the system selects paths with partial diversity - enough to provide fault tolerance but not so much as to unnecessarily increase distance. This partial action approach achieves adequate fault protection while minimizing resource consumption.
3Adaptability or versatility
If k-shortest path algorithms are used to find multiple paths, then path options increase, but diversity between paths is not effectively ensured
Solution Approach 1:
The patent incorporates feedback from previously selected paths into the selection of subsequent paths. Each new path is evaluated based on its diversity relative to all previously selected paths, creating a feedback loop that continuously optimizes for diversity. This feedback mechanism ensures that the k paths selected are not merely the k shortest paths, but rather k paths that collectively maximize diversity.
Data Source
Figure 1a~1b
Figure 2a
Figure 2b
AI summary
Embodiments described herein provide methods and apparatus for transmitting data between a source node (P23) and a destination node (P55) in a telecommunications network comprising a network of nodes, wherein a plurality of possible paths between the source node and destination node are available. The method comprises determining a first path (401) from the plurality of possible paths, wherein the first path comprises a path with a smallest distance between the source node and the destination node in the plurality of paths; adding the first path to a set of paths; determining a next path based on a cost of the next path, wherein the cost of the next path (402) comprises a first component indicating a distance between the source node and the destination node in the next path, and a second component representative of common links between nodes in the next path and links between nodes in paths already in the set of paths; adding the next path to the set of paths; wherein the step of determining the next path comprises determining the next path such that the cost of the next path is a lowest cost of compared to costs of other paths in the plurality of possible paths; and configuring transmission of the data from the source node to the destination node using paths in the set of paths.