Method and system for downloading updates

• US 7,716,660 B2
• Filed: 12/14/2004
• Issued: 05/11/2010
• Est. Priority Date: 12/14/2004
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Mackay, Jason F
• Primary Examiner(s): Zhen; Wei Y
• Assistant Examiner(s): Coyer; Ryan D
• Application Number:
  US11/012,367
• Publication Number:
  US 20060130037A1
• Time in Patent Office: 1,974 Days
• Field of Search: 717168-178, 709/226
• US Class Current: 717/173
• CPC Class Codes: G06F 8/658 Incremental updates; Differential updates

Abstract

Embodiments of the present invention provide the ability for a software provider to distribute software updates to several different recipients utilizing a peer-to-peer environment. The invention described herein may be used to update any type of software, including, but not limited to, operating software, programming software, anti-virus software, database software, etc. The use of a peer-to-peer environment with added security provides the ability to minimize download time for each peer and also reduce the amount of egress bandwidth that must be provided by the software provider to enable recipients (peers) to obtain the update.

Claims

1. A method for updating a first computing device in a network comprising the first computing device and a host, the first computing device having a cache for storing at least one update, the method comprising:

(A) receiving at the first computing device, from the host, a list of update options for obtaining an available update, the list comprising information identifying a partial update, a full update, and an expected hash value of a component updatable by way of the partial update;

(B) determining at the first computing device, in response to (A), an update option from the list of available update options, wherein (B) comprises;

determining whether the first computing device comprises a component for which a hash value matches the expected hash value,

when the first computing device comprises the component for which a hash value matches the expected hash value, selecting the partial update as the update option, and

when the first computing device does not comprise the component for which a hash value matches the expected hash value, selecting the full update as the update option, wherein the selected update option is segmented into a plurality of pieces;

(C) receiving at the first computing device, from the host, a list of computing devices in the network, wherein the list of computing devices identifies, for each piece of the plurality of pieces, at least one computing device that makes that piece available for download;

(D) downloading to the first computing device, each of the plurality of pieces from the at least one computing device on the list of computing devices, wherein at least two of the plurality of pieces are downloaded from different computing devices; and

—

(E) updating the software of the first computing device utilizing the downloaded plurality of pieces, wherein (E) includes;

assembling the downloaded pieces into a patch, and

installing the patch,

wherein each downloaded piece is confirmed based on a hash of the piece prior to the assembling of the downloaded pieces into the patch.

2. The method of claim 1, wherein the full update comprises a full patch, and the partial update comprises at least one delta patch.

3. The method of claim 2, wherein the delta patch includes a filename of a file to be updated using the delta patch and the expected hash value associated with the partial update comprises an expected hash value for the file.

4. The method of claim 1, further comprising:

determining, at the first computing device, in response to (A), a needed update for which the update option is selected, wherein the determining includes scanning the first computing device to determine its current state, and comparing the current state with the available update, and

removing, by the first computing device, a component in the cache if a determination is made to generate available space in the cache, the removing comprises;

generating a priority list for updates stored in the cache by assigning a priority to each update stored in the cache;

determining if the cache has the available space to download the plurality of pieces; and

if the cache does not have the available space, selecting a component in the cache for removal, the component corresponding to an update having a low priority in the priority list, wherein the assigned priority for each update is based on a frequency of requests for each update.

5. The method of claim 1, wherein the list of computing devices includes, for at least one of the plurality of pieces, an identification of a plurality of computing devices.

6. The method of claim 1, wherein the computing devices are identified by an Internet protocol address.

7. The method of claim 1, further comprising:

providing an identification of the downloaded plurality of pieces; and

sharing the identified downloaded plurality of pieces with other computing devices.

8. The method of claim 7, wherein upon a predetermined point, the identified downloaded plurality of pieces are not shared.

9. A method for providing a peer list to a client for downloading software updates in a network comprising the client and a host, the method comprising:

transmitting by the host, to the client, a list identifying options for an available update, the list comprising information identifying a partial update, a full update, and an indicator of an expected state of a component that is updatable by way of the partial update, the indicator indicating to a client whether a component of the client having a state matching the expected state is updatable by way of the partial update, such that the client receives information to make a selection between at least the partial update and the full update based at least in part on the indicator;

receiving at the host, from the client, a request for a peer list corresponding to an update option in the list, the peer list identifying peers from which to request the update option from the list;

generating by the host, the peer list identifying a plurality of peers and a plurality of pieces, the plurality of pieces collectively defining the requested update option; and

transmitting by the host, to the client, the peer list, wherein

the peer list identifies at least one peer for each of the plurality of pieces.

10. The method of claim 9, wherein the list identifying options for the available update identifies a plurality of available update options.

11. The method of claim 9, wherein the full update comprises a full patch, and the partial update comprises at least one delta patch.

12. The method of claim 9, wherein receiving at the host, from the client, a request for the peer list includes receiving a peer list request for one of the plurality of update options.

13. The method of claim 9, further comprising:

receiving an identification of a cached piece of the available update; and

updating a master peer list for the available update.

14. The method of claim 9, wherein one of the identified peers is a host computer.

25. The method of claim 9, wherein the indicator of the expected state of the component that is updatable by way of the partial update comprises an expected hash value of the component that is updatable by way of the partial update.

26. The method of claim 25, wherein the peer list requested from the client comprises:

the partial update as the update option when the client comprises a component for which a hash value matches the expected hash value; and

the fill update as the update option when the client does not comprise a component for which a hash value matches the expected hash value.

15. A computer system having a computer-readable medium including a computer-executable program therein for performing a method of obtaining an update in a network comprising the computer system and a host, the method comprising:

(A) receiving at the computer system, from the host, a list of update options for obtaining an available update, the list comprising information identifying a partial update, a full update, and an indicator of an expected state of a component that is updatable by way of the partial update;

(B) identifying at the computer system, an update option from the list of update options, wherein (B) comprises;

determining whether the computer system comprises a component that is in the expected state indicated by the indicator and is updatable by way of the partial update,

when the computer system comprises a component in the expected state, selecting the partial update the update option, and

when the computer system does not comprise a component in the expected state, selecting the full update as the update option;

(C) requesting by the computer system, from the host, a peer list for the selected update option;

(D) receiving at the computer system, from the host, a peer list for the selected update option, wherein the peer list identifies a plurality of pieces of the selected update option, and identifies for each piece, a computing device in the network that makes that piece available for download; and

(E) downloading to the computer system, each of the pieces from the identified computing devices.

16. The computer system of claim 15, wherein the peer list identifies for each of the plurality of pieces, a plurality of sub-pieces, and identifies for each sub-piece, a computing device that makes that sub-piece available for download.

17. The computer system of claim 16, wherein the peer list identifies for each of the plurality of sub-pieces, a plurality of sub-sub-pieces, and identifies for each sub-sub-piece, a computing device that makes that sub-sub-piece available for download.

18. The computer system of claim 15, further comprising a cache for storing the update, wherein the method further comprises removing, by the computer system, a component in the cache if a determination is made to generate available space in the cache, the removing comprises:

generating a priority list for updates stored in the cache by assigning a priority to each update stored in the cache;

determining if the cache has the available space to download the plurality of pieces; and

if the cache does not have the available space, selecting the component for removal, the component corresponding to an update having a low priority in the priority list, wherein the assigned priority for each update is based on a frequency of requests for each update.

19. The computer system of claim 15, further comprising:

installing the available update.

20. The computer system of claim 19, wherein the peer list includes a first hash value for the available update, and wherein the method further includes:

hashing the assembled pieces to obtain a second hash value; and

comparing the first hash value and the second hash value to confirm a validity of the update.

21. The computer system of claim 15, further comprising:

storing at least one of the downloaded pieces in the cache;

transmitting an identification of the cached piece; and

making the cached piece available for download.

22. The computer system of claim 15, wherein downloading to the computer system, each of the pieces from the identified computing devices includes:

confirming an authenticity of a downloaded piece.

23. The computer system of claim 15, wherein downloading to the computer system, each of the pieces includes:

randomly picking a piece to download; and

randomly picking a computing device from which to download the piece.

24. The computer system of claim 15, wherein downloading to the computer system, each of the pieces includes:

identifying a piece with a least number of a computing device that make that piece available for download; and

downloading the piece with the least number of the computing devices that make that piece available for download.

27. The computer system of claim 15, wherein the indicator of the expected state of the component that is updatable by way of the partial update comprises an expected hash value of the component that is updatable by way of the partial update.

28. The computer system of claim 27, wherein determining whether the computer system comprises a component in the state updatable by way of the partial update comprises determining whether a hash value of the component of the computer system matches the expected hash value.