Loopless Path Determination in Data Network Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data network routing technologies face inefficiencies in determining the set of lowest cost paths between a source and destination network node, particularly in dynamic conditions, and often include paths with loops that lead to redundant data transmission.
Innovation Solution
A method and system that retrieve map data of network nodes and links with associated costs, determine the set of lowest cost paths by excluding loops, and explore paths to identify the optimal routes, ensuring loopless paths are considered for efficient data transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional routing technologies are used to determine paths between network nodes, then routing functionality is provided, but paths with loops are included leading to redundant data transmission and reduced efficiency
Solution Approach 1:
The patent extracts and removes loops from the set of determined paths by detecting when a path returns to a previously visited node and excluding such paths from the final routing set, thereby eliminating redundant data transmission while maintaining complete routing functionality
Solution Approach 2:
The patent performs preliminary loop detection and exclusion during the path determination process itself, rather than after paths are established. The system identifies and eliminates loops before routing decisions are made, preventing redundant transmission from occurring in the first place
2Measurement precision
If all possible paths are explored to find lowest cost paths, then optimal routing is achieved, but computational complexity and time increase
Solution Approach 1:
The patent extracts and removes loop-containing paths from the exploration set, reducing the number of paths that need to be evaluated while maintaining the ability to find all valid lowest cost paths. This decreases computational complexity without sacrificing optimization accuracy
Solution Approach 2:
The patent performs partial path exploration by focusing only on simple (loopless) paths rather than exploring all possible paths including those with loops. This partial exploration is sufficient to find optimal routing solutions while significantly reducing computational burden
3Productivity
If loopless paths are enforced in routing, then redundant transmission is eliminated, but the constraint increases path determination complexity
Solution Approach 1:
The path determination algorithm serves itself by automatically detecting and excluding its own loop-containing paths during the exploration process. The system uses its own path traversal information to identify loops and filter them out, eliminating the need for separate external loop detection mechanisms
Solution Approach 2:
The patent uses feedback from the path exploration process itself - when a path returns to a previously visited node, this feedback triggers automatic exclusion of that path. The system continuously monitors path progression and uses this information to enforce the loopless constraint dynamically during path determination
Data Source
AI summary
Systems and methods for optimizing traffic in a data network are provided. Network traffic may be optimized by associating costs with data links that connect network nodes. The method includes determining a set of lowest cost paths between a source network node and a destination network node. Paths that contain loops may be excluded from the set of lowest cost paths. Exploration of certain paths may also be delayed or prevented entirely.