Source Node Dynamic Programming Bypassing Intermediary Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cloud environments provide closed ecosystems, restricting customers to using services offered by a single cloud service provider, and there is no easy way for customers to access services from different providers.
Innovation Solution
Dynamic programming of a source node with routing information allows for the bypassing of intermediary nodes, enabling communication between a source and a destination node without scaling up the number of intermediary nodes, thereby reducing network latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If intermediary nodes are used to route packets between source and destination nodes, then cloud service providers can manage traffic flow, but network latency increases and scalability is limited
Solution Approach 1:
The patent segments the routing function by separating control plane operations (performed by source nodes using dynamic programming) from data plane operations. This allows intermediary nodes to be bypassed for actual packet forwarding while still maintaining traffic management capabilities, thereby reducing latency while preserving reliability.
Solution Approach 2:
The patent introduces flow information as a mediator that enables source nodes to make intelligent routing decisions dynamically. This flow information acts as a intermediary mechanism that provides traffic management benefits without requiring physical intermediary nodes in the packet path, thus reducing latency while maintaining control.
2Adaptability or versatility
If the number of intermediary nodes is increased to handle more source nodes, then traffic management capability improves, but system complexity and latency increase
Solution Approach 1:
The patent enables source nodes to perform their own routing decisions through dynamic programming with flow information. This self-service approach eliminates the need for external intermediary nodes to manage each source node's traffic, allowing the system to scale without increasing intermediary node complexity while maintaining adaptability.
Solution Approach 2:
The patent adds a new dimension to routing by introducing flow information that captures dynamic network state. This additional dimension enables source nodes to make intelligent routing decisions without requiring more intermediary nodes, thus improving adaptability while avoiding increased system complexity.
3Loss of time
If dynamic programming with flow information is implemented at source nodes, then intermediary nodes can be bypassed reducing latency, but source node processing complexity increases
Solution Approach 1:
The patent performs preliminary computation of flow information at source nodes before packet transmission. By pre-calculating routing decisions based on dynamic programming, the system reduces real-time processing requirements and latency, while the computational complexity is managed through advance preparation rather than real-time complexity.
Data Source
AI summary
Techniques for disintermediating a network path between a source and a destination are described. In an example, the source sends a first packet destined to a destination. A network node on the network path between the source and the destination performs a network operation on this packet and generates a set of instructions indicating the network operation and parameters used for performing the network operations. This set of instructions is sent to the source as a flow update. When the source needs to send a second packet to the destination, the source applies the instructions to the second packet. As such, a similar network operation is performed on the second packet at the source, thereby avoiding the need to send the second packet on the same network path that includes the network node. Accordingly, the second packet is sent on a different network path that bypasses the network node.