Multicast Route Selection via Bandwidth Thresholds
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods fail to efficiently determine fast routes for transmitting voluminous data from a single source node to multiple destination nodes via intermediate nodes, particularly in interactive applications like seminars, where real-time data transfer is crucial.
Innovation Solution
The approach involves forming a network topology based on threshold bandwidths, determining least-latency routes, and selecting the fastest route by estimating total transfer time, which minimizes computational complexity and considers both bandwidth and latency for efficient data dissemination.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional route determination methods are used, then the network topology can be maintained, but the computational complexity increases significantly when determining fast routes for voluminous data transmission to multiple destination nodes
Solution Approach 1:
The patent segments the route determination process into multiple stages: first forming network topologies based on threshold bandwidths, then determining least-latency routes within each topology, and finally selecting the fastest route by estimating total transfer time. This segmentation reduces computational complexity by breaking down the complex route determination into manageable steps, while still achieving fast data transfer to multiple destination nodes.
Solution Approach 2:
The patent performs preliminary actions by pre-forming network topologies based on threshold bandwidths before determining specific routes. This preliminary organization of network structures allows for more efficient route selection later, reducing the computational burden when determining fast routes for voluminous data transmission to multiple destination nodes.
2Speed
If multiple routes are considered for fast data transfer, then data delivery speed improves, but the time required to determine the optimal route increases
Solution Approach 1:
The patent performs preliminary actions by pre-forming network topologies based on threshold bandwidths before determining specific routes. This preliminary organization of network structures allows for more efficient route selection later, reducing the computational burden when determining fast routes for voluminous data transmission to multiple destination nodes.
Solution Approach 2:
The patent changes parameters by using threshold bandwidths to filter and organize network topologies, then using latency estimates to select the fastest routes. This parameter-based approach allows for efficient route determination by focusing on the most critical parameters (bandwidth and latency) rather than exhaustively evaluating all possible routes, thus reducing determination time while maintaining fast data transfer speeds.
3Reliability
If bandwidth threshold is set high to ensure fast transfer, then data delivery quality improves, but the number of available routes decreases
Solution Approach 1:
The patent segments the route determination process into multiple stages: first forming network topologies based on threshold bandwidths, then determining least-latency routes within each topology, and finally selecting the fastest route by estimating total transfer time. This segmentation reduces computational complexity by breaking down the complex route determination into manageable steps, while still achieving fast data transfer to multiple destination nodes.
Data Source
AI summary
Determination of a fast route from a source node to many destination nodes. Identities of each node, and bandwidths and latencies of paths are received. A threshold bandwidth is set, and routes containing paths among nodes which have an associated bandwidth exceeding the threshold bandwidth (or within a desired range, in general) are determined. The route providing the least latency among the routes thus determined is selected. The process is repeated for other values of threshold bandwidths, and the fastest route is then determined from the routes selected for each value of threshold bandwidth considered.