Forward-based resource delivery network management techniques
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
exact text as granted — not AI-modifiedWhat is claimed is:
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; and propagating the write requests to the one or more other servers.
2 . The computer-implemented method of claim 1 further comprising:
determining that one or more resources written to the data store since the connection failure is older than corresponding resources in the second partition; and
retrieving the corresponding resources for the first partition.
3 . The computer-implemented method of claim 1 further comprising:
reconfiguring the plurality of servers to an original configuration of the first partition.
4 . 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.
5 . The computer-implemented method of claim 1 , wherein the write requests are routed to the master using a proxy mechanism.
6 . The computer-implemented method of claim 1 , 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.
7 . The computer-implemented method of claim 1 further comprising:
determining that a connection between the first partition and the second partition has been restored; and
processing the log to identify updates.
8 . The computer-implemented method of claim 7 , wherein processing the log comprises identifying a number of changes in the log with the new machine ID.
9 . The computer-implemented method of claim 8 , wherein processing the log further comprises initiating updates based on the number of changes identified in the log.
10 . 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 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; and propagating the write requests to the one or more other servers.
11 . The one or more processor readable storage devices of claim 10 , wherein the processor readable code stored thereon further programs one or more processors to:
determine that one or more resources written to the data store since the connection failure is older than corresponding resources in the second partition; and retrieve the corresponding resources for the first partition.
12 . The one or more processor readable storage devices of claim 10 , 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.
13 . The one or more processor readable storage devices of claim 10 , 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.
14 . The one or more processor readable storage devices of claim 10 , wherein the write requests are routed to the master using a proxy mechanism.
15 . The one or more processor readable storage devices of claim 10 , 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.
16 . The one or more processor readable storage devices of claim 10 , wherein the processor readable code stored thereon further programs one or more processors to perform a method comprising:
determining that a connection between the first partition and the second partition has been restored; and processing the log to identify updates.
17 . 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;
monitor the write requests sent to the master;
propagate the write requests to the one or more other servers;
determine that one or more resources written to the data store since the connection failure is older than corresponding resources in the second partition; and
retrieve the corresponding resources for the first partition.
18 . The resource delivery system of claim 17 , 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.
19 . The resource delivery system of claim 17 , 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.
20 . The resource delivery system of claim 17 , wherein the write requests are routed to the master using a proxy mechanism.Join the waitlist — get patent alerts
Track US2019140922A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.