Seed Selection Algorithm for Bulk Information Dissemination
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In communication networks with limited bandwidth and widely dispersed nodes, existing methods for transferring bulk information, such as firmware or image downloads, are inefficient and can disrupt normal network operations due to high bandwidth and resource usage, particularly with unicast methods, and network tie-up issues with broadcast methods.
Innovation Solution
A seed selection algorithm is used to identify strategically located nodes that can disseminate information efficiently across the network without disrupting normal operations, allowing nodes to query neighbors and download information in chunks, ensuring minimal bandwidth consumption and maintaining network stability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If unicast method is used to transfer information to each node, then information can be delivered to individual nodes, but bandwidth consumption increases and network resources are depleted
Solution Approach 1:
The patent segments the network into multiple regions, each with a designated region server. Instead of unicast from a central server to every node, information is divided and distributed through regional servers that serve local nodes, reducing overall bandwidth consumption while maintaining reliable delivery.
Solution Approach 2:
The patent introduces region servers as intermediary nodes between the central server and end nodes. These intermediaries cache and redistribute information locally, reducing the bandwidth burden on the central server and network links while ensuring reliable information delivery to all nodes.
2Productivity
If broadcast mode is used to transfer information to all nodes, then information dissemination is efficient, but network operations are disrupted for considerable period
Solution Approach 1:
The patent divides the network into multiple regions that can receive and process information independently through their respective region servers. This segmentation allows parallel information distribution across regions, maintaining high dissemination efficiency while reducing overall network disruption time compared to a single broadcast operation.
Solution Approach 2:
The patent pre-positions information at region servers before needing to serve nodes. Region servers can cache information in advance, so when nodes need information, it is already available locally rather than requiring real-time broadcast, thus reducing network disruption time while maintaining efficient information availability.
3Reliability
If information transfer is performed to satisfy all node requests, then all nodes receive desired information, but normal network operations are disrupted
Solution Approach 1:
The patent introduces region servers as intermediaries that handle information requests locally within their regions. This distributes the request-handling burden away from the central server and normal network traffic paths, ensuring information availability to all nodes while minimizing disruption to overall network operations.
Solution Approach 2:
The patent implements preliminary caching of information at region servers based on predicted or anticipated node needs. By preparing information in advance at regional locations, the system ensures information availability when nodes request it without requiring disruptive real-time transfers that would interrupt normal network operations.
Data Source
AI summary
Bulk information is transferred to nodes in a communication network having a plurality of widely dispersed nodes. The information can be an image, content, or configuration information. The information is uni-cast to a selection of nodes by a central node or server, to seed the information at certain nodes in the network. The information is then distributed by these seed nodes to every other node in the network. A first algorithm selects which nodes should be seeded with information by the central node. A second algorithm distributes information in the network on a query basis.