Distributed Data Stream Routing Optimization
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 at the source node in terms of bandwidth and processing due to establishing multiple one-to-one connections.
Innovation Solution
A method of routing data streams amongst end-user nodes using a distributed optimization algorithm, where optimizing nodes evaluate routing criteria and modify routes to optimize data stream distribution, allowing for multi-party dissemination without relying solely on central servers, and enabling relaying nodes to also consume the stream.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If multiple one-to-one connections are established from source node to each end-user node, then content can be delivered to all end-users, but resource demands (bandwidth and processing) at the source node increase significantly
Solution Approach 1:
The patent segments the content distribution task by introducing intermediate relaying nodes that receive content from the source node and redistribute it to multiple end-user nodes. This divides the one-to-many distribution problem into multiple one-to-one connections, reducing the bandwidth and processing burden on the source node while maintaining delivery to all end-users.
Solution Approach 2:
The patent employs relaying nodes as intermediaries between the source node and end-user nodes. These relaying nodes receive content from the source and forward it to multiple end-users, effectively mediating the distribution process. This intermediary approach allows the source node to communicate with fewer nodes while still reaching multiple end-users through the relaying nodes.
2Use of energy by moving object
If relaying nodes are introduced to reduce source node resource demands, then bandwidth and processing requirements at source node decrease, but network complexity increases
Solution Approach 1:
The patent implements self-service by allowing relaying nodes to autonomously determine their own routing decisions based on local routing criteria. Each relaying node independently evaluates whether to relay content to particular end-user nodes, eliminating the need for centralized control or complex coordination protocols. This autonomous operation simplifies network management while reducing source node resource demands.
Solution Approach 2:
The patent applies local quality by enabling each relaying node to make routing decisions based on its own local conditions and routing criteria, rather than following a centralized routing plan. Each node evaluates local factors such as network conditions and end-user requirements to determine optimal relaying behavior, which simplifies overall network complexity while achieving resource optimization at the source node.
Data Source
AI summary
A method, system and program for routing a data stream amongst a plurality of network nodes including at least a plurality of end-user nodes. The method comprises: establishing a plurality of routes for the stream to a plurality of consuming end-user nodes, including at least one route via one or more relaying nodes; at each of a plurality of optimising nodes, executing an optimization algorithm to determine a respective routing modification by evaluating a routing criterion with respect to a collection of end-user nodes which share information with the respective optimising node and determining a change in the routing criterion that would result from one or more potential routing modifications. The different optimising nodes' collections of end-user nodes are at least partially coincident such that each optimising node can determine a different routing modification with respect to at least some of the same end-user nodes.