公开(公告)号：US20160292249A1

公开(公告)日：2016-10-06

申请号：US15090547

申请日：2016-04-04

Applicant: Amazon Technologies, Inc.

Inventor： JAI VASANTH ,  BARRY BAILEY HUNTER, JR. ,  KIRAN-KUMAR MUNISWAMY-REDDY ,  DAVID ALAN LUTZ ,  JIAN WANG ,  MAXIMILIANO MACCANTI

IPC: G06F17/30 ,  G06F11/07 ,  G06F11/00 ,  G06F9/48 ,  H04L29/08

CPC classification number: G06F17/30575 ,  G06F3/0617 ,  G06F9/4881 ,  G06F11/006 ,  G06F11/07 ,  G06F11/0709 ,  G06F11/0793 ,  G06F2201/86 ,  H04L67/1095

Abstract: Detecting replica faults within a replica group and dynamically scheduling replica healing operations are described. Status metadata for one or more replica groups may be accessed. Based, at least in part, the status data a number of available replicas for at least one replica group may be determined to incompliant with a healthy state definition for the replica group. One or more healing operations to restore the number of available replicas for the at least one replica group to the respective healthy state definition may be dynamically scheduled. In some embodiments, one or more resource constraints for performing healing operations and one or more resource requirements for each of the one or more healing operations may be used to order the one or more healing operations.

Abstract translation: 对副本组中的副本故障进行检测并动态调度复制恢复操作。 可以访问一个或多个副本组的状态元数据。 至少部分地基于状态数据，至少一个副本组的可用副本的数量可以被确定为与副本组的健康状态定义不一致。 可以动态地调度用于将至少一个副本组的可用副本的数量恢复到相应的健康状态定义的一个或多个愈合操作。 在一些实施例中，用于执行愈合操作的一个或多个资源约束和针对所述一个或多个愈合操作中的每一个的一个或多个资源需求可用于对一个或多个愈合操作进行排序。

公开(公告)号：US20140379921A1

公开(公告)日：2014-12-25

申请号：US13924157

申请日：2013-06-21

Applicant: Amazon Technologies, Inc.

Inventor： ADAM DOUGLAS MORLEY ,  VINCENT ANTHONY BRANCATO ,  STEFANO STEFANI ,  JAI VASANTH ,  WEI XIAO ,  MAXIMILIANO MACCANTI ,  SWAMINATHAN SIVASUBRAMANIAN ,  RANDE A. BLACKMAN ,  TIMOTHY ANDREW RATH

IPC: H04L12/70

CPC classification number: H04L47/70 ,  G06F9/5027 ,  G06F9/5061 ,  G06F11/2094 ,  H04L41/0893 ,  H04L67/10

Abstract: Methods and apparatus for resource silos at network-accessible services are disclosed. A subset of resources used for a database service, including at least one resource from each of a plurality of data centers, is selected for membership in a resource silo based on grouping criteria. A silo routing layer node identifies the resource silo as the target silo to which a client work request is to be directed. The client work request is sent to a front-end resource of the target silo either by the client, or by the silo routing layer node on behalf of the client. The front-end resource of the target silo transmits a representation of the work request to a back-end resource of the target silo, where a work operation corresponding to request is performed.

Abstract translation: 披露了网络可访问业务资源孤岛的方法和装置。 基于分组标准，选择用于数据库服务的资源的子集，包括来自多个数据中心中的每一个的至少一个资源。 筒仓路由层节点将资源仓确定为客户端工作请求所针对的目标仓库。 客户端工作请求由客户端发送到目标仓库的前端资源，或者由客户端的筒仓路由层节点发送到目标仓库的前端资源。 目标仓的前端资源将工作请求的表示发送到目标仓的后端资源，其中执行与请求相对应的工作操作。

公开(公告)号：US20150156123A1

公开(公告)日：2015-06-04

申请号：US14617671

申请日：2015-02-09

Applicant: Amazon Technologies, Inc.

Inventor： WEI XIAO ,  DAVID ALAN LUTZ ,  TIMOTHY ANDREW RATH ,  MAXIMILIANO MACCANTI ,  MIGUEL MASCARENHAS FILIPE ,  DAVID CRAIG YANACEK

IPC: H04L12/819 ,  H04L12/801

CPC classification number: H04L47/215 ,  H04L47/12 ,  H04L67/327

Abstract: A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. An admission control mechanism may manage requests based on tokens, each of which represents a fixed amount of work. The tokens may be added to a token bucket at rate that is dependent on a target work throughput rate while the number of tokens in the bucket does not exceed its maximum capacity. If at least a pre-determined minimum number of tokens is present in the bucket when a service request is received, it may be serviced. Servicing a request may include deducting an initial number of tokens from the bucket, determining that the amount of work performed in servicing the request is different than that represented by the initially deducted tokens, and deducting additional tokens from or replacing tokens in the bucket to reflect the difference.

Abstract translation: 向客户端提供服务的系统可以接收和服务请求，其中各种可能需要不同的工作量。 准入控制机制可以管理基于令牌的请求，每个代表固定的工作量。 令牌可以以取决于目标工作吞吐率的速率添加到令牌桶中，而桶中的令牌数量不超过其最大容量。 如果当接收到服务请求时，至少在桶中存在至少一个预先确定的令牌，则可以对其进行维修。 服务请求可以包括从桶中扣除初始数量的令牌，确定在服务请求中执行的工作量与最初扣除的令牌所表示的工作量不同，并从桶中扣除额外的令牌或替换令牌以反映 区别。

公开(公告)号：US20150100630A1

公开(公告)日：2015-04-09

申请号：US14570900

申请日：2014-12-15

Applicant: Amazon Technologies, Inc.

Inventor： WEI XIAO ,  DAVID ALAN LUTZ ,  TIMOTHY ANDREW RATH ,  MAXIMILIANO MACCANTI ,  MIGUEL MASCARENHAS FILIPE ,  DAVID CRAIG YANACEK

IPC: H04L29/08 ,  H04L29/06

CPC classification number: H04L67/16 ,  G06F9/505 ,  G06F11/3433 ,  G06F11/3452 ,  G06F11/3485 ,  G06F2201/81 ,  G06F2209/504 ,  H04L67/42 ,  Y02D10/22

Abstract: A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. The system may determine whether it is operating in an overloaded or underloaded state based on a current work throughput rate, a target work throughput rate, a maximum request rate, or an actual request rate, and may dynamically adjust the maximum request rate in response. For example, if the maximum request rate is being exceeded, the maximum request rate may be raised or lowered, dependent on the current work throughput rate. If the target or committed work throughput rate is being exceeded, but the maximum request rate is not being exceeded, a lower maximum request rate may be proposed. Adjustments to the maximum request rate may be made using multiple incremental adjustments. Service request tokens may be added to a leaky token bucket at the maximum request rate.

Abstract translation: 向客户端提供服务的系统可以接收和服务请求，其中各种可能需要不同的工作量。 系统可以基于当前工作吞吐率，目标工作吞吐率，最大请求速率或实际请求速率来确定其是否处于过载或欠载状态，并且可以动态地调整响应的最大请求速率。 例如，如果超过最大请求速率，则可以根据当前的工作吞吐率来提高或降低最大请求速率。 如果超过了目标或提交的工作吞吐率，但不超过最大请求率，则可能会提出较低的最大请求率。 可以使用多个增量调整来调整最大请求率。 可以以最大请求率将服务请求令牌添加到泄漏令牌桶中。