Iterative Shortest Path Routing for Network Latency Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network latencies in data centers and networks are limited by per-hop queuing, switching, and propagation delays, which restrict the maximum data transmission rate and can lead to bottlenecks and inefficiencies in routing.
Innovation Solution
A computer-implemented method and system that uses a routing determination module to identify data flows with bandwidth demands and iteratively determine a routing allocation by finding the shortest paths and allocating bandwidth along these paths, with the option to obtain residual graphs when initial bandwidth demands are not met, allowing proactive traffic allocation across multiple routes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If traditional per-hop routing is used, then network infrastructure is simple to manage, but network latency increases due to queuing, switching, and propagation delays
Solution Approach 1:
The patent performs preliminary routing determination by computing shortest paths and allocating bandwidth before data transmission begins. The routing determination module proactively establishes optimal routes and reserves bandwidth resources in advance, eliminating the need for reactive per-hop routing decisions during data flow, thereby reducing queuing and switching delays without requiring complex real-time routing infrastructure
Solution Approach 2:
The patent segments the network routing problem into discrete shortest path computations between source-destination pairs. By breaking down the overall routing task into individual path-finding operations using graph algorithms, the system achieves efficient routing determination that reduces latency while maintaining manageable computational complexity through modular processing
2Productivity
If bandwidth is allocated along shortest paths, then data transmission speed increases, but network bottlenecks may occur when bandwidth demand exceeds available capacity
Solution Approach 1:
The patent implements a feedback mechanism where the routing determination module iteratively computes shortest paths, allocates bandwidth, and evaluates whether bandwidth demands are satisfied. When bandwidth requirements are not met on initial shortest paths, the system receives feedback and adjusts routing allocations by finding alternative paths or redistributing bandwidth, ensuring reliable bandwidth satisfaction while maintaining high data transmission rates
Solution Approach 2:
The patent employs dynamic routing allocation that adapts to bandwidth availability and demand. The system dynamically adjusts path selection and bandwidth distribution based on real-time network conditions and flow requirements, transitioning from static per-hop routing to a flexible, demand-driven allocation mechanism that prevents bottlenecks while maximizing transmission productivity
3Reliability
If iterative routing allocation is performed, then bandwidth demand satisfaction improves, but computational time increases
Solution Approach 1:
The patent performs preliminary shortest path computations and bandwidth allocations before actual data transmission. By pre-determining optimal routes and reserving bandwidth resources in advance, the iterative routing allocation ensures bandwidth demand satisfaction without incurring computational delays during active data flow, as the routing decisions are already established
Solution Approach 2:
The patent skips iterative computation for subsequent data flows by reusing routing allocations from previous flows when network conditions remain similar. Once optimal paths are established for one flow, the system rapidly applies similar routing decisions to subsequent flows without repeating the full iterative process, thereby ensuring bandwidth satisfaction while minimizing computational time loss
Data Source
AI summary
Systems and methods for managing computer network activity are disclosed. A data flow to be transmitted between a source node and a destination node can be identified. An initial graph representing the computer network can be determined. A shortest path between the source node and the destination node can be identified based on the graph. Bandwidth can be allocated to communication links along the shortest path between the source node and the destination node. It can be determined whether a bandwidth requirement associated with the data flow is satisfied by the allocated bandwidth. A residual graph can be determined. The steps of identifying a shortest path between the source node and the destination node based on the residual graph and allocating bandwidth to communication links along the shortest path between the source node and the destination node can be repeated.