公开(公告)号：US20140379922A1

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

申请号：US13926684

申请日：2013-06-25

Applicant: Amazon Technologies, Inc.

Inventor： WEI XIAO ,  BJORN PATRICK SWIFT ,  KIRAN-KUMAR MUNISWAMY-REDDY ,  MIGUEL MASCARENHAS FILIPE ,  YIJUN LU ,  STUART HENRY SEELYE MARSHALL ,  STEFANO STEFANI ,  JAMES R. HAMILTON

IPC: H04L12/56

CPC classification number: H04L47/215 ,  H04L43/16 ,  H04L47/70 ,  H04L47/80

Abstract: Methods and apparatus for equitable distribution of excess shared-resource throughput capacity are disclosed. A first and a second work target are configured to access a shared resource to implement accepted work requests. Admission control is managed at the work targets using respective token buckets. A first metric indicative of the work request arrival rates at the work targets during a time interval, and a second metric associated with the provisioned capacities of the work targets are determined. A number of tokens determined based on a throughput limit of the shared resource is distributed among the work targets to be used for admission control during a subsequent time interval. The number of tokens distributed to each work target is based on the first metric and/or the second metric.

Abstract translation: 披露了公平分配超额共享资源吞吐能力的方法和手段。 第一个和第二个工作目标被配置为访问共享资源以实现接受的工作请求。 使用相应令牌桶在工作目标上管理入学控制。 确定在时间间隔内指示工作目标的工作请求到达率的第一指标，以及与工作目标的提供能力相关联的第二度量。 基于共享资源的吞吐量限制确定的多个令牌被分配在在随后的时间间隔期间用于准入控制的工作目标中。 分配给每个工作目标的令牌数量基于第一度量和/或第二度量。

公开(公告)号：US20140379506A1

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

申请号：US13926694

申请日：2013-06-25

Applicant: Amazon Technologies, Inc.

Inventor： STUART HENRY SEELYE MARSHALL ,  WEI XIAO ,  BJORN PATRICK SWIFT ,  KIRAN-KUMAR MUNISWAMY-REDDY ,  MIGUEL MASCARENHAS FILIPE ,  YIJUN LU ,  STEFANO STEFANI ,  JAMES R. HAMILTON

IPC: G06Q30/06

CPC classification number: H04L47/12 ,  G06F9/5005 ,  G06Q30/0283 ,  H04L47/215

Abstract: Methods and apparatus for token-based pricing policies for burst-mode operations are disclosed. A pricing policy to be applied to token population changes at a token bucket used for admission control during burst-mode operations at a work target is determined. Over a time period, changes to the token population of that bucket are recorded. A billing amount to be charged to a client is determined, based on the recorded changes in token population and an associated pricing amount indicated in the pricing policy.

Abstract translation: 公开了用于突发模式操作的基于令牌的定价策略的方法和装置。 确定在工作目标的突发模式操作期间用于接纳控制的令牌桶处的令牌容量变化的定价策略。 在一段时间内，记录对该桶的令牌群的更改。 基于记录的令牌种群的变化和定价策略中指示的相关定价金额来确定要向客户收取的计费金额。

公开(公告)号：US20140376368A1

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

申请号：US13926697

申请日：2013-06-25

Applicant: Amazon Technologies, Inc.

Inventor： WEI XIAO ,  BJORN PATRICK SWIFT ,  KIRAN-KUMAR MUNISWAMY-REDDY ,  MIGUEL MASCARENHAS FILIPE ,  YIJUN LU ,  STEFANO STEFANI ,  JAMES R. HAMILTON

IPC: H04L12/70

CPC classification number: H04L47/12

Abstract: Methods and apparatus for compound token buckets usable for burst-mode admission control are disclosed. A peak burst rate and a sustained burst rate of work requests that are to be supported at a work target are determined. The maximum token populations of a peak-burst token bucket and a sustained-burst token bucket are configured, based on the peak burst rate and the sustained burst rate respectively. In response to receiving a work request directed at the work target, a determination to accept the work request for execution is made based at least in part on the token population of the peak-burst token bucket and/or the sustained-burst token bucket.

Abstract translation: 公开了可用于突发模式准入控制的复合令牌桶的方法和装置。 确定要在工作目标中支持的峰值突发速率和工作请求的持续突发速率。 基于峰值突发速率和持续突发速率，配置峰值突发令牌桶和持续突​​发令牌桶的最大标记量。 响应于接收到针对工作目标的工作请求，至少部分地基于峰 - 突发令牌桶和/或持续突发令牌桶的令牌总数进行接受执行工作请求的确定。

公开(公告)号：US20140279905A1

公开(公告)日：2014-09-18

申请号：US13800796

申请日：2013-03-13

Applicant: AMAZON TECHNOLOGIES, INC.

Inventor： KIRAN-KUMAR MUNISWAMY-REDDY ,  BJORN PATRICK SWIFT ,  MIGUEL MASCARENHAS FILIPE ,  TIMOTHY ANDREW RATH ,  STEFANO STEFANI ,  YIJUN LU ,  WEI XIAO ,  STUART HENRY SEELYE MARSHALL ,  JAMES R. HAMILTON

IPC: G06F17/30

CPC classification number: G06F16/27 ,  G06F11/0757 ,  G06F11/2023 ,  G06F2201/84 ,  G06F2209/522

Abstract: Methods and apparatus for token-based admission control for replicated writes are disclosed. Data objects are divided into partitions, and corresponding to each partition, at least a master replica and a slave replica are stored. A determination as to whether to accept a write request directed to the partition is made based at least in part on one or more of (a) available throughput capacity at the master replica, and (b) an indication, obtained using a token-based protocol, of available throughput capacity at the slave replica. If the write request is accepted, one or more data modification operations are initiated.

Abstract translation: 公开了用于复制写入的基于令牌的准入控制的方法和装置。 数据对象分为分区，对应于每个分区，至少存储主副本和从副副本。 至少部分地基于主副本上的（a）可用吞吐量容量中的一个或多个来确定是否接受针对分区的写请求，以及（b）使用基于令牌的 协议，从属副本的可用吞吐量容量。 如果接受了写入请求，则启动一个或多个数据修改操作。

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

公开(公告)号：US20140380330A1

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

申请号：US13926708

申请日：2013-06-25

Applicant: Amazon Technologies, Inc.

Inventor： WEI XIAO ,  MIGUEL MASCARENHAS FILIPE ,  JAMES R. HAMILTON ,  YIJUN LU ,  STEFANO STEFANI ,  STUART HENRY SEELYE MARSHALL ,  BJORN PATRICK SWIFT ,  KIRAN-KUMAR MUNISWAMY-REDDY

IPC: G06F9/50

CPC classification number: G06F9/5083 ,  G06F9/5016 ,  G06F2209/5013 ,  G06F2209/503

Abstract: Methods and apparatus for token-sharing mechanisms for burst-mode operations are disclosed. A first and a second token bucket are respectively configured for admission control at a first and a second work target. A number of tokens to be transferred between the first bucket and the second bucket, as well as the direction of the transfer, are determined, for example based on messages exchanged between the work targets. The token transfer is initiated, and admission control decisions at the work targets are made based on the token population resulting from the transfer.

Abstract translation: 公开了用于突发模式操作的令牌共享机制的方法和装置。 第一和第二令牌桶分别被配置用于第一和第二工作目标的准入控制。 例如，基于在工作目标之间交换的消息来确定要在第一桶和第二桶之间传送的多个令牌以及传送方向。 启动令牌传输，并且基于从传送导致的令牌群进行工作目标的准入控制决定。

公开(公告)号：US20140380324A1

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

申请号：US13926686

申请日：2013-06-25

Applicant: Amazon Technologies, Inc.

Inventor： WEI XIAO ,  BJORN PATRICK SWIFT ,  KIRAN-KUMAR MUNISWAMY-REDDY ,  MIGUEL MASCARENHAS FILIPE ,  YIJUN LU ,  STUART HENRY SEELYE MARSHALL ,  STEFANO STEFANI ,  JAMES R. HAMILTON

IPC: G06F9/48

CPC classification number: G06F9/5083 ,  G06F2209/5013 ,  G06F2209/503

Abstract: Methods and apparatus for burst-mode admission control using token buckets are disclosed. A work request (such as a read or a write) directed to a work target is received. Based on a first criterion, a determination is made that the work target is in a burst mode of operation. A token population of a burst-mode token bucket is determined, and if the population meets a second criterion, the work request is accepted for execution.

Abstract translation: 公开了使用令牌桶的突发模式准入控制的方法和装置。 接收到指向工作目标的工作请求（如读取或写入）。 基于第一标准，确定工作目标处于突发操作模式。 确定突发模式令牌桶的令牌总数，并且如果总体满足第二准则，工作请求被接受执行。