Cooperative download among low-end devices under resource constrained environment

• US 9,961,139 B2
• Filed: 05/24/2016
• Issued: 05/01/2018
• Est. Priority Date: 05/24/2016
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Kaguma, David W., Karumba, Samuel, Weldemariam, Komminist
• Primary Examiner(s): JEAN GILLES, JUDE
• Application Number:
  US15/162,924
• Publication Number:
  US 20170346887A1
• Time in Patent Office: 707 Days
• Field of Search: 709206, 709220-228, 709238
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• CPC Class Codes: H04L 43/0817 by checking functioning
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1051 Group master selection mechanisms
• CPC Class Codes: H04L 67/108 characterised by resources being split in blocks or fragments
• CPC Class Codes: H04L 67/1089 Hierarchical topologies
• CPC Class Codes: H04L 67/1093 Some peer nodes performing special functions

Abstract

The disclosure provides systems and methods for efficient arrangement, use, and management of networked electronic devices. The networked electronic devices are configured to form a peer-to-peer network, and to allocate management, download, and aggregation responsibilities among themselves to improve efficiency. Networking errors are minimized by replacing faulting nodes with idle nodes.

Claims

1. A method for cooperative downloading of data, the method comprising:

determining the resources available for each node in an interconnected array of nodes;

dividing a coherent set of data (e.g. content) on a remote device into a plurality of data chunks, wherein the number of data chunks in the plurality of data chunks is equal to or less than the number of nodes in the array of nodes;

for each data chunk in the plurality of data chunks, assigning the data chunk to a node in the array of nodes, the assignment being based on the determined resources available for the assigned node, wherein each node is assigned either zero or one data chunk, such that the set of nodes assigned a data chunk forms a set of downloading nodes;

downloading, by each node in the set of downloading nodes, the respective assigned data chunk to form a set of downloaded data chunks;

selecting from the array of nodes at least one aggregator node, the selection based on the determined resources available for the selected node;

retrieving, by the aggregator node or nodes, the downloaded data chunks from the set of downloading nodes; and

recombining, by the aggregator node or nodes, the downloaded data chunks to form a copy of the coherent set of data.

2. The method of claim 1, wherein the determined resources available comprises remaining battery life, available memory, available storage, and available download bandwidth, and past history of the node.

3. The method of claim 1, further comprising identifying the coherent set of data on a remote device, and retrieving metadata pertaining to the coherent set of data.

4. The method of claim 1, further comprising monitoring the resources available for each node in the array of nodes during the downloading of the respective assigned data chunk, and re-assigning a data chunk if a node becomes unsuitable for downloading.

5. The method of claim 1, wherein the dividing the coherent set of data comprises downloading, from the remote device, metadata pertaining to the set of data.

6. The method of claim 1, further comprising selecting from the array of nodes a master node and configuring the master node to coordinate the downloading and aggregator nodes.

7. The method of claim 1, wherein a plurality of nodes are selected as aggregator nodes, and wherein each aggregator node retrieves downloaded data chunks from the set of downloading nodes.

8. The method of claim 1, wherein, prior to determining the resources available for each node in the array of nodes, one node from the array of nodes identifies the coherent set of data on the remote device.

9. The method of claim 1, wherein the downloading nodes are selected based on available download bandwidth and remaining battery life, and the aggregator node or nodes are selected based on remaining battery life and available memory.

10. The method of claim 1, further comprising analyzing the determined resources for a node in the array of nodes to generate a reliability index indicative of the reliability of the node as a downloader node, aggregator node, or master node.

11. The method of claim 1, further comprising distributing, from the aggregator node or nodes, the copy of the coherent set of data to each node in the array of nodes.

12. The method of claim 1, further comprising displaying, on an interface, the copy of the coherent set of data.

13. A system comprising a plurality of nodes, each node of the plurality of nodes comprising:

a processor;

a memory coupled to the processor, the memory configured to store program instructions for instructing the processor to carry out the method of claim 1.

14. The system of claim 13, wherein the plurality of nodes are interconnected via a network.

15. The system of claim 13, wherein the program instruction are configured to instruct one node from the plurality of nodes to act as a master node, wherein selection of the master node is based on the determined resources, and wherein the master node coordinates the downloader and aggregator nodes.

16. A method for cooperative downloading of data, the method comprising:

identifying, by an initiating node, an array of nodes in communication via a network, the array of nodes comprising the initiating node;

characterizing the resources available for each node in the array of nodes;

identifying a single master node from the array of nodes;

identifying a set of downloading nodes from the array of nodes;

identifying an aggregator node or nodes from the array of nodes;

for each downloading node in the array of nodes, assigning either zero or one data chunk from a coherent set of data chunks residing on a remote device;

downloading, by the set of downloading nodes, the assigned data chunks from the remote device; and

aggregating, by the aggregator node, the downloaded data chunks to form a copy of the coherent set of data.

17. The method of claim 16, wherein the downloading nodes and the aggregator node or nodes are identified by the master node.

18. The method of claim 16, further comprising a recruitment algorithm that continuously monitors the resources available to the downloading nodes and aggregator node or nodes, dynamically allocates data chunks to downloading nodes based on the determined resources available, and dynamically assigns aggregator tasks based on the determined resources available.

19. A method for cooperative downloading of data, the method comprising:

identifying, by an initiating node, an array of nodes in communication via a network, the array of nodes comprising the initiating node;

for each node in the array of nodes, characterizing the promise index for the node, wherein the promise index is a function of a resource index based on the instantaneous resources available to the node and a reliability index based on the historical log of the node;

identifying, based on the resource, reliability, and promise indices, a set of downloading nodes from the array of nodes;

identifying, based on the resource, reliability, and promise indices, an aggregator node or nodes from the array of nodes;

for each downloading node in the array of nodes, assigning either zero or one data chunk from a coherent set of data chunks residing on a remote device;

downloading, by the set of downloading nodes, the assigned data chunks from the remote device;

aggregating, by the aggregator node, the downloaded data chunks to form a copy of the coherent set of data; and

displaying the copy of the coherent set of data on a display associated with the initiating node.

20. The method of claim 19, further comprising dynamically monitoring the resource, reliability, and promise indices for each node in the array of nodes, and dynamically assigning download and aggregator tasks based on the monitored indices.