System and method having improved efficiency and reliability for distributing a file among a plurality of recipients

• US 7,523,217 B2
• Filed: 07/15/2003
• Issued: 04/21/2009
• Est. Priority Date: 07/15/2003
• Status: Expired due to Fees

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Cherkasova, Ludmila
• Primary Examiner(s): Dalencourt; Yves
• Application Number:
  US10/619,737
• Publication Number:
  US 20050015431A1
• Time in Patent Office: 2,107 Days
• Field of Search: 709/217, 709/219, 709/231, 709/236, 709/238, 709/248
• US Class Current: 709/236
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast
• CPC Class Codes: H04L 12/1868 Measures taken after transmission, e.g. acknowledgments

Abstract

A reliable system and method for distributing a file from a first node to a plurality of recipient nodes is provided. The method comprises attempting to distribute a plurality of subfiles that comprise a file from a first node to a first group comprising a plurality of recipient nodes, wherein the first node attempts to distribute at least one subfile to each recipient node of the first group but not all of the plurality of subfiles are distributed from the first node to any of the recipient nodes of the first group. The method further comprises detecting whether one of the plurality of recipient nodes of the first group has failed, and if a recipient node of the first group has failed, managing the distribution of the plurality of subfiles to detour their distribution around the failed node such that the file is distributed to each non-failed node of the plurality of recipient nodes.

Claims

1. A method of distributing a file from a first node to a plurality of recipient nodes, the method comprising:

partitioning a file F into a plurality of subfiles;

performing distribution of said file F to a plurality of recipient nodes using a distribution technique that comprises

(a) attempting to distribute the plurality of subfiles from a first node to a first group of recipient nodes, wherein the first node attempts to communicate at least one subfile to each recipient node of said first group but not all of said plurality of subfiles to any recipient node of said first group, and

(b) said plurality of recipient nodes of said first group attempting to exchange the respective subfiles received from said first node, wherein at least one recipient node of said first group begins communicating a portion of a given subfile of the respective subfiles that said at least one recipient is receiving from the first node to at least one other recipient node of said first group before said at least one recipient node fully receives the given subfile;

detecting a failed node of said plurality of recipient nodes; and

said distribution technique to distribute all of the subfiles of said file F to each non-failed node of said plurality of recipient nodes.

2. The method of claim 1 wherein said distribution technique adapting responsive to said detecting a failed node.

3. The method of claim 1 wherein said attempting to distribute the plurality of subfiles from a first node to a first group of recipient nodes comprises:

attempting to distribute a different subfile from said first node to each of said recipient nodes of said first group.

4. The method of claim 1 wherein said attempting to distribute the plurality of subfiles from a first node to a first group of recipient nodes comprises:

attempting to distribute the plurality of subfiles from said first node to said plurality of recipient nodes of said first group concurrently.

5. The method of claim 1 wherein said plurality of recipient nodes of said first group attempting to exchange their respective subfiles further comprises:

each of said plurality of recipient nodes attempting to establishing concurrent communication connections to every other recipient node of said first group.

6. The method of claim 1 wherein said detecting a failed node comprises said first node detecting a failed node in said first group such that said-first node is unable to communicate a particular subfile to such failed node.

7. The method of claim 6 wherein said attempting to distribute the plurality of subfiles from a first node to a first group of recipient nodes comprises said first node attempting to establish concurrent communication connections to the recipient nodes of said first group, and wherein said distribution technique comprises:

responsive to said first node detecting a failed node in said first group such that said first node is unable to communicate a particular subfile to such failed node, said first node using established concurrent communication connections with non-failed nodes of said first group to communicate the particular subfile to said non-failed nodes.

8. The method of claim 6 wherein said attempting to distribute the plurality of subfiles from a first node to a first group of recipient nodes comprises said first node attempting to establish concurrent communication connections to the recipient nodes of said first group, and wherein said distribution technique comprises:

responsive to said first node detecting a failed node in said first group such that said first node is unable to communicate a particular subfile to such failed node, said first node triggering a mirror node to establish concurrent communication connections with non-failed nodes of said first group to communicate the particular subfile to said non-failed nodes.

9. The method of claim 1 wherein said detecting a failed node comprises:

said recipient nodes of said first group exchanging heartbeat messages;

at least one recipient node of said first group detecting a failed node from analysis of heartbeat messages received; and

said at least one recipient node of said first group notifying said first node of said detected failed node.

10. The method of claim 1 wherein said detecting a failed node comprises:

said non-failed recipient nodes of said first group sending heartbeat messages to said first node; and

said first node detecting a failed node from analysis of received heartbeat messages from said non-failed recipient nodes.

11. The method of claim 1 further comprising:

said first group of recipient nodes attempting to communicate said file F to a second group comprising a plurality of recipient nodes.

12. The method of claim 1 further comprising:

each recipient node of said first group attempting to communicate a subfile to at least one recipient node of said second group.

13. The method of claim 12 further comprising:

each recipient node of said first group attempting to communicate the subfile that said each recipient node received from said first node to a corresponding node of the second group.

14. The method of claim 12 wherein said detecting a failed node comprises detecting a failed node in said first group when said failed node of said first group is attempting to communicate a subfile to said at least one recipient node of said second group.

15. The method of claim 14 wherein said distribution technique further comprises:

said first node communicating said subfile to said at least one recipient node of said second group.

16. The method of claim 14 wherein said distribution technique further comprises:

said first node triggering a mirror node to communicate the subfile to said at least one recipient node of said second group.

17. A system comprising:

an origin node comprising a processor to partition a file F into a plurality of sub files, wherein said plurality of subfiles correspond in number to a number of recipient nodes in a first group to which said file is to be distributed;

said origin node to attempt to distribute all of said plurality of sub files to said recipient nodes, wherein said origin node attempts to distribute a different one of said plurality of subfiles to each of said recipient nodes;

said recipient nodes to attempt to exchange their respective subfiles received from said origin node such that each recipient node obtains all of said plurality of subfiles, wherein at least one recipient node of said first group begins communicating a portion of a given subfile of said respective subfiles that said at least one recipient node is receiving from the origin node to at least one other recipient node of said first group before said at least one recipient node fully receives the given respective subfile from the origin node;

said origin node to detect a failed node in said first group; and

said origin node to manage distribution of said file F upon detecting a failed node in said first group in a manner such that every non-failed node of said first group receives said file F.

18. The system of claim 17 wherein each of said recipient nodes attempt to distribute a subfile being received from said origin node to the others of said recipient nodes of said first group.

19. The system of claim 17 wherein said origin node is operable to attempt to distribute the plurality of subfiles to said plurality of recipient nodes of said first group concurrently.

20. The system of claim 17 wherein said origin node trigger a mirror node to establish concurrent communication connections with non-failed nodes of said first group to communicate a subfile to said non-failed nodes.

21. A method of distributing a file from a first node to a plurality of recipient nodes, the method comprising:

attempting to distribute a plurality of subfiles that comprise a file F from a first node to a first group comprising a plurality of recipient nodes, wherein the first node attempts to distribute at least one subfile to each recipient node of said first group but not all of said plurality of subfiles are distributed from the first node to any of the recipient nodes of said first group;

said plurality of recipient nodes of said first group attempting to exchange their respective sub files, wherein at least one recipient node of said first group begins communicating a portion of given respective subfile of the respective subfiles that said at least one recipient node is receiving from the first node to at least one other recipient node of said first group before said at least one recipient node fully receives the given respective subfile;

detecting whether one of said plurality of recipient nodes of said first group has failed; and

if a recipient node of said first group has failed, managing the distribution of the plurality of subfiles to detour their distribution around the failed node such that the file F is distributed to each non-failed node of said plurality of recipient nodes.

22. The method of claim 21 wherein said attempting to distribute the plurality of subfiles from a first node to a first group of recipient nodes comprises:

attempting to distribute a different subfile from said first node to each of said recipient nodes of said first group.

23. The method of claim 22 wherein said managing the distribution of the plurality of subfiles to detour their distribution around the failed node such that file F is distributed to each non-failed node of said plurality of recipient nodes comprises:

said first node communicating to non-failed nodes of said first group a subfile that the first node would communicate to the failed node if the failed node were not failed.

24. The method of claim 22 wherein said managing the distribution of the plurality of subfiles to detour their distribution around the failed node such that file F is distributed to each non-failed node of said plurality of recipient nodes comprises:

said first node triggering a mirror node to communicate to non-failed nodes of said first group a subfile that the first node would communicate to the failed node if the failed node were not failed.

25. The method of claim 21 wherein said attempting to distribute the plurality of subfiles from a first node to a first group of recipient nodes comprises:

attempting to distribute the plurality of subfiles from said first node to said plurality of recipient nodes of said first group concurrently.

26. The method of claim 21 wherein said plurality of recipient nodes of said first group attempting to exchange their respective subfiles further comprises:

each of said plurality of recipient nodes attempting to establishing concurrent communication connections to every other recipient node of said first group.

27. The method of claim 21 wherein said detecting whether one of said plurality of recipient nodes of said first group has failed comprises:

said recipient nodes of said first group exchanging heartbeat messages;

at least one recipient node of said first group detecting a failed node from analysis of heartbeat messages received; and

said at least one recipient node of said first group notifying said first node of said detected failed node.

28. The method of claim 21 wherein said detecting whether one of said plurality of recipient nodes of said first group has failed comprises:

the non-failed recipient nodes of said first group sending heartbeat messages to said first node; and

said first node detecting a failed node from analysis of received heartbeat messages from the non-failed recipient nodes.