Bursty Data Flow Routing via Adaptive Link Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for communicating bursty data flows over bonded communication links often lead to periods where other data flows lack sufficient link capacity due to inefficient use of network resources, particularly during bursty traffic such as video or gaming data transmission.
Innovation Solution
A computer-implemented method for routing bursty data flows by selecting the appropriate communication network based on flow statistics, using a bursty bonding policy that classifies the flow state into phases like start-up, established, catchup, and overload, to optimize the use of multiple networks and ensure efficient resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If bursty data flows use maximum link capacity during bursts, then fast content loading and playback are achieved, but other data flows lack sufficient link capacity during the same periods
Solution Approach 1:
The patent applies dynamics by making the link capacity allocation adaptive rather than static. The system dynamically adjusts the portion of link capacity allocated to bursty flows based on their current state (catching up vs. keeping up) and the availability of capacity on other links. This allows the system to optimize content delivery speed when needed while ensuring other flows receive sufficient capacity at other times.
Solution Approach 2:
The patent changes the parameter of link capacity allocation from a fixed maximum to a variable portion. Specifically, it allocates only a portion of the available capacity on other links to bursty flows during catching-up periods, rather than allowing them to monopolize the entire link capacity. This parameter change enables the system to balance fast content loading with ensuring adequate capacity for other data flows.
2Productivity
If bonded links are used to aggregate multiple connections, then throughput is maximized for bursty flows, but link capacity is monopolized during burst periods
Solution Approach 1:
The patent applies partial action by allocating only a portion of the available link capacity on other links to bursty flows during catching-up periods, rather than allowing them to use the full capacity. This partial allocation ensures that while bursty flows receive enhanced throughput for fast content loading, other data flows still have sufficient capacity available, thus avoiding complete monopolization of the bonded link resources.
3Quantity of substance
If multiple communication networks are used simultaneously, then resource utilization is improved, but complexity of routing and managing flows increases
Solution Approach 1:
The patent applies local quality by implementing different routing behaviors for different portions of the bonded link capacity. Specifically, it distinguishes between capacity on the primary link and capacity on other links, allocating different portions to bursty flows based on their needs and the availability of resources. This localized differentiation in capacity allocation simplifies the overall routing management while still achieving improved resource utilization across multiple networks.
Data Source
AI summary
An aspect of the present disclosure relates to a computer-implemented method for routing a bursty data flow comprising a series of one or more data packets over a converged network comprising a plurality of communication networks, the method comprising, for each of the series of data packets in turn: selecting which one of the plurality of communication networks to transmit that data packet over by: (i) obtaining flow statistics indicating a current flow state of the bursty data flow; and (ii) selecting the one of the plurality of communication networks in dependence on said flow statistics; then initiating transmission of the data packet over that one of the plurality of communication networks. Further aspects relate to a data processing system, a computer program, a computer-readable data carrier and a data carrier signal.