N-Way Synchronization of Data

• US 20100106687A1
• Filed: 12/17/2009
• Published: 04/29/2010
• Est. Priority Date: 01/08/2007
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Knight, Brent Eric, Marcy, M. Scott
• Granted Patent: US 8,250,397 B2
• Time in Patent Office: Days
• US Class Current: 707/622
• CPC Class Codes: G06F 16/178 Techniques for file synchronisation in file systems
• CPC Class Codes: G06F 16/1837 Management specially adapted to peer-to-peer storage networks topology management mechanisms of peer-to-peer networks H04L67/1042

Abstract

The invention relates to the use of history information as an aid to synchronization in a peer-to-peer system. In particular, node trees are used to represent portions of files systems designated for synchronization. The nodes in the node tree embody history information regarding associated objects. The history information includes version vectors that are used to simplify synchronization-related comparisons and create job lists that may be used to bring participating peers into synchronization.

Claims

1. A first peer system for synchronizing data elements in a group of synchronizing peer systems, said first peer system comprising:

a sync software module for managing synchronization directly with a second peer system;

a memory for storing a first node tree representing a first sync point in said first peer system and a second node tree representing a second sync point in said second peer system;

a processor resource for running said sync software module while said sync software module interacts with metadata wherein said running produces a first job list for said first peer and a second job list for said second peer;

said metadata derived from a set of corresponding nodes, said set of corresponding nodes comprising one node from each of said first node tree and said second node tree;

said second job list comprising instructions to synchronize objects in said second sync point with corresponding objects in said first sync point and said second sync point;

said first job list comprising instructions to synchronize objects in said first sync point with corresponding objects in said second sync point and said first sync point; and

an input/output (i/o) system for connecting with said second peer system for transferring said second job list.

2. The system of claim 1 wherein said metadata comprises a loser vector, said loser vector representing history information of an object in said second sync point, said loser vector preserving the result of a conflict resolution process through an indication of said history information.

3. The system of claim 2 wherein said result of said conflict resolution process comprises a user input.

4. The system of claim 1 wherein each of said nodes in said set of corresponding nodes represents a package-type file, said package-type files corresponding to each other.

5. The system of claim 4 wherein said memory is also for storing a data structure corresponding with each of said package-type files, said data structures each comprising a plurality of indicia, each indicia representing an object in a respective package file.

6. The system of claim 1 wherein said i/o system is capable of communicating with a LAN or a WAN or the Internet.

7. The system of claim 1 wherein said i/o system is capable of communicating with wireless and wired networks.

8. The system of claim 1 wherein said first peer system comprises software that permits for NAT traversal in communicating with said second peer system.

9. The system of claim 1 wherein said sync software module comprises instructions for discovering a new peer system by synchronizing with said second peer system.

10. The system of claim 1 where in said first peer system comprises GUI software for presenting a user interface regarding the discovery of a new peer system.

11. The system of claim 1 wherein said first peer system comprises a software module for using Bonjour to discover a new peer system.

12. The system of claim 1 wherein said first peer system comprises a software module for using Gnutella-type techniques for discovering a new peer system.

13. The system of claim 1 wherein said first peer system comprises a software module for using a directory data structure for performing peer discovery, said directory data structure comprising information regarding said sync system peers.

14. The system of claim 13 wherein said directory data structure comprises information regarding users of peer systems.

15. The system of claim 13 wherein said directory data structure comprises information regarding software or hardware platforms of said peer systems.

16. A method of synchronizing a first peer system with a second peer system, the method comprising the steps of:

generating a first node tree, said first node tree corresponding to a first sync point existing in a store of said first peer system;

generating a second node tree, said second node tree corresponding to a second sync point existing in a store of said second peer system;

storing said node trees in a store of said first peer system;

analyzing metadata to produce a first job list for said first peer and a second job list for said second peer;

said metadata derived from a set of corresponding nodes, said set of corresponding nodes comprising one node from each of said first node tree and said second node tree;

said second job list comprising instructions to synchronize objects in said second sync point with corresponding objects in said first sync point and said second sync point;

said first job list comprising instructions to synchronize objects in said first sync point with corresponding objects in said second sync point and said first sync point;

enacting said first job list on said first peer system; and

enacting said second job list on said second peer system.

17. The method of claim 16 wherein said metadata comprises a loser vector, said loser vector representing history information of an object in said second sync point, said loser vector preserving the result of a conflict resolution process through an indication of said history information.

18. The method of claim 17 wherein said result of said conflict resolution process comprises a user input.

19. The method of claim 16 wherein each of said nodes in said set of corresponding nodes represents a package-type file, said package-type files corresponding to each other.

20. The method of claim 19 comprising the further step of storing a data structure corresponding with each of said package-type files, said data structures each comprising a plurality of indicia, each indicia representing an object in a respective package file.

21. The method of claim 16 wherein said first peer system transfers said second job list to said second peer system and wherein said first peer system comprises software that permits for NAT traversal in communicating with said second peer system.

22. The method of claim 16 further comprising the step of discovering a new peer system by synchronizing with said second peer system.

23. The method of claim 16 further comprising the step of discovering a new peer system by presenting a user interface regarding the discovery of a new peer system.

24. The method of claim 16 further comprising the step of discovering a new peer system by using Bonjour.

25. The method of claim 16 further comprising the step of discovering a new peer system by using Gnutella-type techniques.

26. The method of claim 16 further comprising the step of discovering a new peer system by using a directory data structure for performing peer discovery, said directory data structure comprising information regarding said sync system peers.

27. The method of claim 26 wherein said directory data structure comprises information regarding users of peer systems.

28. The method of claim 26 wherein said directory data structure comprises information regarding software or hardware platforms of said peer systems.

39. A media encoding program instructions for performing the method of claim 16.

29. An apparatus for synchronizing datums between a first peer system and a second peer system, said apparatus comprising:

a memory for storing a first node tree representing a first sync point in said first peer system and a second node tree representing a second sync point in said second peer system;

a processor resource for running a client software program, a service software module and a sync software module, said service software module providing a program interface for indicating a sync point, and said sync software module for interacting with metadata and thereby producing a first job list for said first peer system and a second job list for said second peer system;

said metadata derived from a set of corresponding nodes, said set of corresponding nodes comprising one node from each of said first node tree and said second node tree;

said second job list comprising instructions to synchronize objects in said second sync point with corresponding objects in said first sync point and said second sync point;

said first job list comprising instructions to synchronize objects in said first sync point with corresponding objects in said second sync point and said first sync point.

30. The apparatus of claim 29 wherein said metadata comprises a loser vector, said loser vector representing history information of an object in said second sync point, said loser vector preserving the result of a conflict resolution process through an indication of said history information.

31. The apparatus of claim 30 wherein said result of said conflict resolution process comprises a user input.

32. The apparatus of claim 29 wherein each of said nodes in said set of corresponding nodes represents a package-type file, said package-type files corresponding to each other.

33. The apparatus of claim 32 wherein said memory is also for storing a data structure corresponding with each of said package-type files, said data structures each comprising a plurality of indicia, each indicia representing an object in a respective package file.

34. The apparatus of claim 29 wherein said program interface is further for indicating the identity of a new peer.

35. The apparatus of claim 29 wherein said client software program comprises a PIM application program.

36. The apparatus of claim 29 wherein said client software program comprises a media player program.

37. The apparatus of claim 36 wherein said media player program is for playing compressed audio files or compressed video files.

38. The apparatus of claim 29 wherein said client software program comprises an image viewer program.

40. A method of synchronizing data from a plurality of devices, the method comprising:

determining a loser vector value from a first synchronization of a first datum on a first device relative to a corresponding datum on a second device;

maintaining a record of the determined loser vector on a third device in one or more data stores wherein the one or more data stores further represent a genealogy of the datum;

utilizing the record in a future synchronization between the first device and a fourth device wherein datum identified as a loser by the record is not selected for synchronization; and

communicatively connecting the first device and the fourth device for synchronization to a programmable processing device configured to analyze the data stores to automatically perform synchronization of the first datum between the first device and the fourth device.

41. The method of claim 40 wherein the first and third devices are the same device.

42. The method of claim 40 wherein the second and fourth devices are the same device.

43. The method of claim 40 wherein the first and third devices are the same device and the second and fourth devices are the same device.

44. A programmable processing unit for synchronizing data between a plurality of devices, wherein the programmable processing unit is programmed to:

determine a loser vector value from a first synchronization of a first datum on a first device relative to a corresponding datum on a second device;

maintain a record of the determined loser vector on a third device in one or more data stores wherein the one or more data stores further represent a genealogy of the datum;

utilize the record in a future synchronization between the first device and a fourth device wherein datum identified as a loser by the record is not selected for synchronization; and

analyze the data stores to automatically identify if the first datum is selected for synchronization between the first device and the fourth device.

45. The programmable processing unit of claim 44 wherein the first and third devices are the same device.

46. The programmable processing unit of claim 44 wherein the second and fourth devices are the same device.

47. The programmable processing unit of claim 44 wherein the first and third devices are the same device and the second and fourth devices are the same device.

48. A system comprising one or more processing units programmed to perform the following acts:

determine a loser vector value from a first synchronization of a first datum on a first device relative to a corresponding datum on a second device;

maintain a record of the determined loser vector on a third device in one or more data stores wherein the one or more data stores further represent a genealogy of the datum;

utilize the record in a future synchronization between the first device and a fourth device wherein datum identified as a loser by the record is not selected for synchronization; and

analyze the data stores to automatically identify if the first datum is selected for synchronization between the first device and the fourth device.

49. The system of claim 48 wherein the first and third devices are the same device.

50. The system of claim 48 wherein the second and fourth devices are the same device.

51. The system of claim 48 wherein the first and third devices are the same device and the second and fourth devices are the same device.