Forward-based resource delivery network management techniques

• US 10,218,584 B2
• Filed: 12/15/2017
• Issued: 02/26/2019
• Est. Priority Date: 10/02/2009
• Status: Expired due to Fees

• Current Assignee: Amazon Technologies, Inc. (Amazon.com, Inc.)
• Original Assignee: Amazon Technologies, Inc. (Amazon.com, Inc.)
• Inventors: Ellsworth, Joseph L., Porter, Brandon William, Suver, Christopher Allen, Newcombe, Christopher Richard
• Primary Examiner(s): Katsikis, Kostas J
• Application Number:
  US15/844,371
• Publication Number:
  US 20180183689A1
• Time in Patent Office: 438 Days
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: H04L 41/0823 characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for optimising operational conditions of wireless networks H04W24/02
• CPC Class Codes: H04L 41/5025 by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/782 Hierarchical allocation of resources, e.g. involving a hierarchy of local and centralised entities
• CPC Class Codes: H04L 47/83 based on usage prediction
• CPC Class Codes: H04L 67/125 involving control of end-device applications over a network
• CPC Class Codes: H04N 21/2225 Local VOD servers
• CPC Class Codes: H04N 21/23103 using load balancing strategies, e.g. by placing or distributing content on different disks, different memories or different servers storage management G06F3/0604; allocation of resources considering the load in multiprogramming arrangements G06F9/505; techniques for rebalancing the load in a distributed system G06F9/5083; access to distributed or replicated servers, e.g. load balancing, in data networks H04L67/1001

Abstract

A resource delivery network and method for distributing content in the network is disclosed herein. The network comprises a plurality of servers arranged in tiers and partitioned. Each server includes a resource store with a set of resources for distribution to a successive tier. Updates to each successive tier are provided by a pull-forward client on servers in the tier. This forward propagation mechanism maximizes resource availability at edge servers in the network. Resources transmitted to the edge tier servers may be transformed, combined, and rendered without taxing lower tier servers. Transformation and pre-rendering of data can be performed by low priority CPU tasks at each layer of the system.

Claims

1. A computer-implemented method for managing a resource delivery network including a plurality of partitions, the computer-implemented method comprising:

determining a connection failure between a first partition and a second partition of the resource delivery network;

electing one server of a plurality of servers of the first partition as a master for the first partition;

reconfiguring one or more other servers of the plurality of servers to route write requests to the master, wherein the master uses a different machine identifier to identify a log of the write requests after election of the master;

tracking the write requests to a data store associated with the master;

propagating the write requests to the one or more other servers;

determining that a connection between the first partition and the second partition has been restored;

determining that one or more resources written to the data store since the connection failure are newer than corresponding resources in the second partition; and

propagating the one or more resources to the second partition.

2. The computer-implemented method of claim 1 further comprising:

reconfiguring the plurality of servers to an original configuration of the first partition.

3. The computer-implemented method of claim 1 further comprising:

determining that the master has failed; and

electing a new master for the first partition from the plurality of servers in the first partition.

4. The computer-implemented method of claim 1, wherein the write requests are routed to the master using a proxy mechanism.

5. The computer-implemented method of claim 1, wherein determining that one or more resources written to the data store since the connection failure are newer than corresponding resources in the second partition comprises reading through the log starting at the first item written to the log using the different machine identifier.

6. One or more processor readable storage devices having processor readable code stored thereon, the processor readable code programs one or more processors to perform a method comprising:

determining a connection failure between a first partition and a second partition of the resource delivery network;

electing one server of a plurality of servers of the first partition as a master for the

reconfiguring one or more other servers of the plurality of servers to route write requests to the master, wherein the master uses a different machine identifier to identify a log of the write requests after election of the master;

tracking the write requests to a data store associated with the master;

propagating the write requests to the one or more other servers;

determining that a connection between the first partition and the second partition has been restored;

determining that one or more resources written to the data store since the connection failure are newer than corresponding resources in the second partition; and

propagating the one or more resources to the second partition.

7. The one or more processor readable storage devices of claim 6, wherein determining that one or more resources written to the data store since the connection failure are newer than corresponding resources in the second partition comprises reading through the log starting at the first item written to the log using the different machine identifier.

8. The one or more processor readable storage devices of claim 6, wherein the processor readable code stored thereon further programs one or more processors to perform a method comprising:

reconfiguring the plurality of servers to an original configuration of the first partition.

9. The one or more processor readable storage devices of claim 6, wherein the processor readable code stored thereon further programs one or more processors to perform a method comprising:

determining that the master has failed; and

electing a new master for the first partition from the plurality of servers in the first partition.

10. The one or more processor readable storage devices of claim 6, wherein the write requests are routed to the master using a proxy mechanism.

11. The one or more processor readable storage devices of claim 6, wherein the master uses a different machine identifier to identify a log of the write requests after election of the master.

12. The one or more processor readable storage devices of claim 11, wherein the master propagates the one or more resources to the second partition if the total number of changes in the log with the different machine identifier is greater than a threshold.

13. A resource delivery system comprising:

at least one processor;

a memory including instructions that, upon being executed by the at least one processor, cause the at least one processor to;

determine a connection failure between a first partition and a second partition of the resource delivery system;

select one server of a plurality of servers of the first partition as a master for the first partition;

reconfigure one or more other servers of the plurality of servers to route write requests to the master, wherein the master uses a different machine identifier to identify a log of the write requests after election of the master;

monitor the write requests sent to the master; and

propagate the write requests to the one or more other servers.

14. The resource delivery system of claim 13, wherein the memory further includes instructions that, upon being executed by the at least one processor, cause the at least one processor to:

determine that the master has failed; and

elect a new master for the first partition from the plurality of servers in the first partition.

15. The resource delivery system of claim 13, wherein determining that one or more resources written to the data store since the connection failure are newer than corresponding resources in the second partition comprises reading through the log starting at the first item written to the log using the different machine identifier.

16. The resource delivery system of claim 13, wherein the memory further includes instructions that, upon being executed by the at least one processor, cause the at least one processor to:

determine that a connection between the first partition and the second partition has been restored;

determine that one or more resources written to a data store associated with the master since the connection failure are newer than corresponding resources in the second partition; and

propagate the one or more resources to the second partition.

17. The resource delivery system of claim 13, wherein the memory further includes instructions that, upon being executed by the at least one processor, cause the at least one processor to:

reconfigure the plurality of servers to an original configuration of the first partition.