Network Routing Optimization via Utility-Based Relay Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Peer-to-peer networks face challenges in efficiently disseminating content such as voice, video, or file transfers to multiple end-user nodes, as they typically require significant resource demands in terms of bandwidth and processing due to establishing multiple one-to-one connections directly between the source node and each consumer node.
Innovation Solution
A method is provided to evaluate utility functions for each possible combination of routes to end-user nodes, considering factors like packet-loss rate, delay, and bitrate, to determine an overall utility value and select the most beneficial route for content dissemination, minimizing bandwidth and processing resources needed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple one-to-one connections are established directly between source node and each consumer node, then content can be disseminated to all end-user nodes, but bandwidth and processing resources are significantly increased
Solution Approach 1:
The patent introduces relay nodes as intermediaries between the source node and consumer nodes. Instead of direct one-to-one connections, the source node establishes connections to relay nodes, which then distribute content to multiple consumer nodes. This intermediary structure reduces the total bandwidth consumption at the source node while maintaining effective content dissemination to all consumers.
Solution Approach 2:
The patent merges multiple one-to-one connections into fewer many-to-many connections through relay nodes. Multiple consumer nodes are grouped together and served through shared relay node connections, combining multiple individual data streams into fewer aggregated streams that consume less total bandwidth and processing resources.
2Productivity
If multiple one-to-one connections are established directly between source node and each consumer node, then content can be disseminated to all end-user nodes, but processing resources are significantly increased
Solution Approach 1:
Relay nodes serve as intermediaries that handle the processing burden of distributing content to multiple consumer nodes. The source node only needs to establish a single connection to each relay node, significantly reducing processing requirements compared to establishing separate one-to-one connections to each consumer node.
Solution Approach 2:
The patent segments the content dissemination function by introducing relay nodes that specialize in routing and distributing content to specific groups of consumer nodes. This segmentation allows the source node to focus on content generation while relay nodes handle distribution processing, reducing overall processing resource consumption.
3Quantity of substance
If relay nodes are used to route data streams, then bandwidth consumption is reduced, but route selection complexity increases
Solution Approach 1:
The patent implements feedback mechanisms where relay nodes provide information about their capacity, available routes, and current data streams to the source node. This feedback enables the source node to make informed routing decisions and dynamically adjust routes based on real-time network conditions, managing route selection complexity through structured information exchange.
Solution Approach 2:
The patent employs dynamic route selection where the set of active relay nodes and their associated routes can change based on network conditions, data stream characteristics, and relay node capacity. This dynamic adaptation allows the system to optimize bandwidth usage while managing complexity through flexible, condition-based routing decisions rather than static configurations.
Data Source
AI summary
A method of transmitting a data stream to end-user nodes of a network, and a corresponding communication system, program, and distribution system for distributing the program. The method comprises: for each of a plurality of possible combinations of routes of the stream to a plurality of consuming end-user nodes, evaluating a utility function for each of the consuming end-user nodes, the utility function being dependent on route and defining a quantitative measure of end-user benefit that would be experienced at the respective end-user node by consumption of the stream; for each of the plurality of possible combinations of routes, determining an overall utility value based on the respective evaluation of the utility functions of each of the plurality of consuming end-user nodes; and selecting a preferred combination of routes for the stream based on the overall utility values of the different possible combinations.