Network Bandwidth Allocation via Hierarchical Path Manager
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network bandwidth management techniques fail to effectively manage flow control and congestion control in distributed networks with high user demand and large datasets, leading to potential congestion and inefficiencies.
Innovation Solution
A hierarchical approach with an inter-node layer for bandwidth allocation between nodes and an intra-node layer for flow allocation within nodes, ensuring that bandwidth does not exceed the minimum per-path allocated bandwidth for shared links, thereby preventing congestion and optimizing network performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If decentralized flow control and congestion control mechanisms are used, then network autonomy and scalability are improved, but bandwidth allocation precision and congestion avoidance capability deteriorate
Solution Approach 1:
The patent introduces a path manager as an intermediary component that mediates between source nodes and destination nodes. The path manager receives bandwidth requests from source nodes, determines optimal paths, calculates per-path allocated bandwidths considering shared links, and enforces bandwidth constraints. This intermediary approach enables centralized coordination while maintaining decentralized architecture, resolving the contradiction between network autonomy and bandwidth allocation precision.
2Reliability
If per-path bandwidth allocation is implemented, then congestion control is improved, but path selection complexity and computational overhead increase
Solution Approach 1:
The patent implements preliminary action by pre-establishing paths and calculating per-path allocated bandwidths before actual data transmission occurs. The path manager determines optimal paths and computes bandwidth allocations in advance, considering the number of common paths that share links. This preliminary computation enables efficient congestion control during runtime without adding complex real-time path selection logic, thus improving reliability while limiting the increase in path selection complexity.
3Reliability
If minimum per-path allocated bandwidth is enforced on shared links, then congestion-free transmission is achieved, but bandwidth utilization efficiency decreases
Solution Approach 1:
The patent applies parameter changes by dynamically calculating and enforcing minimum per-path allocated bandwidths based on the number of common paths sharing links. The path manager adjusts bandwidth parameters on a per-path basis, considering the specific topology and traffic patterns. This dynamic parameter adjustment ensures congestion-free transmission while optimizing bandwidth utilization efficiency through adaptive rather than static allocation.
Data Source
AI summary
Provided are a computer program product, system, and method for allocating bandwidth to communication paths used by nodes in a network. A request is received from a source node of the nodes to communicate with a destination node. A path is selected between the source node and the destination node. A determination is made of a per path allocated bandwidths for links in the selected path based on a number of common paths that share a link with the selected path. Allocated bandwidth for the selected path is set to a minimum of the per path allocated bandwidths for the links in the selected path. Information on the selected path and the allocated bandwidth is transmitted to the source node to use to communicate with the destination node.