公开(公告)号：US10581715B1

公开(公告)日：2020-03-03

申请号：US15386841

申请日：2016-12-21

Applicant: Amazon Technologies, Inc.

Inventor： James Michael Thompson ,  Valentin Gabriel Priescu ,  Dragos Diaconescu ,  Colin Harrison Brace ,  Anandh Mahalingam ,  Danny Wei

IPC: G06F15/16 ,  H04L12/26 ,  H04L29/08 ,  H04L29/06

Abstract: Systems and methods for an incast mitigation approach that first modifies network responses for content requests above a threshold size to be delayed according a response latency selected from an established latency range. Additionally, as incast characteristics are analyzed from network traffic, the volumes can selectively modify the individual established latency range to increase the latency range during periods of higher incast characteristics and to decrease the latency range when incast characteristics appear to be decreasing.

公开(公告)号：US20200034204A1

公开(公告)日：2020-01-30

申请号：US16530898

申请日：2019-08-02

Applicant: Amazon Technologies, Inc.

Inventor： Tate Andrew Certain ,  Roland Paterson-Jones ,  James R. Hamilton ,  Sachin Jain ,  Matthew S. Garman ,  David N. Sunderland ,  Danny Wei ,  Fiorenzo Cattaneo

IPC: G06F9/50

Abstract: Customers of a shared-resource environment can provision resources in a fine-grained manner that meets specific performance requirements. A customer can provision a data volume with a committed rate of Input/Output Operations Per Second (IOPS) and pay only for that commitment (plus any overage), and the amount of storage requested. The customer will then at any time be able to complete at least the committed rate of IOPS. If the customer generates submissions at a rate that exceeds the committed rate, the resource can still process at the higher rate when the system is not under pressure. Even under pressure, the system will deliver at least the committed rate. Multiple customers can be provisioned on the same resource, and more than one customer can have a committed rate on that resource. Customers without committed or guaranteed rates can utilize the uncommitted portion, or committed portions that are not being used.

公开(公告)号：US10514847B2

公开(公告)日：2019-12-24

申请号：US15392857

申请日：2016-12-28

Applicant: Amazon Technologies, Inc.

Inventor： Norbert P. Kusters ,  Nachiappan Arumugam ,  Christopher Nathan Watson ,  Marc John Brooker ,  David R. Richardson ,  Danny Wei ,  John Luther Guthrie, II

IPC: G06F3/06 ,  H04L29/08 ,  G06F12/0868 ,  G11B33/12 ,  H03M13/15

Abstract: A data storage system includes multiple head nodes and multiple data storage sleds mounted in a rack. For a particular volume or volume partition one of the head nodes is designated as a primary head node for the volume or volume partition. The primary head node is configured to store data for the volume in a data storage of the primary head node and cause the data to be replicated to a secondary head node. The primary head node is also configured to cause the data for the volume to be stored in a plurality of respective mass storage devices each in different ones of the plurality of data storage sleds of the data storage system.

公开(公告)号：US20190332269A1

公开(公告)日：2019-10-31

申请号：US15967284

申请日：2018-04-30

Applicant: Amazon Technologies, Inc.

Inventor： Christopher Magee Greenwood ,  Danny Wei ,  Kiran-Kumar Muniswamy-Reddy ,  Wells Lin ,  Igor A. Kostic ,  Colin Williams

IPC: G06F3/06

Abstract: Generally described, aspects of the present application correspond to enabling rapid duplication of data within a data volume hosted on a network storage system. The network storage system can maintain a highly distributed replica of the data volume, designated for duplication of data within the volume and separate from one or more other replicas designated for handling modifications to the data volume. By providing increased parallelization, the highly distributed replica can facilitate rapid duplication of the volume. When a sufficiently large request to duplicate the data volume is received, the system can create additional duplicate portions of the volume to further increase parallelization. For example, a partition of the highly distributed replica may be repeatedly duplicated to create a large number of intermediary duplicate partitions. The intermediary duplicate partitions can then be used to service the duplication request rapidly, due to increased parallelism.

公开(公告)号：US20190319785A1

公开(公告)日：2019-10-17

申请号：US15952743

申请日：2018-04-13

Applicant: Amazon Technologies, Inc.

Inventor： Sandeep Kumar ,  Danny Wei ,  Lalit Jain ,  Varun Verma ,  Oscar Allen Grim Courchaine ,  Kristina Kraemer Brenneman ,  Sriram Venugopal ,  Arvind Chandrasekar

IPC: H04L9/08 ,  H04L9/14 ,  H04L9/06

Abstract: Generally described, one or more aspects of the present application correspond to techniques for creating encrypted block store volumes of data from unencrypted object storage snapshots of the volumes. These encryption techniques use a special pool of servers for performing the encryption. These encryption servers are not accessible to users, and they perform encryption and pass encrypted volumes to other block store servers for user access. The encryption context for the volumes can be persisted on the encryption severs for as long as needed for encryption and not shared with the user-facing servers in order to prevent user access to encryption context.

公开(公告)号：US20190155694A1

公开(公告)日：2019-05-23

申请号：US16259571

申请日：2019-01-28

Applicant: Amazon Technologies, Inc.

Inventor： Jianhua Fan ,  Benjamin Arthur Hawks ,  Norbert Paul Kusters ,  Nachiappan Arumugam ,  Danny Wei ,  John Luther Guthrie

IPC: G06F11/14 ,  G06F3/06

CPC classification number: G06F11/1448 ,  G06F3/0605 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/067 ,  G06F3/0689 ,  G06F11/1446 ,  G06F11/1464 ,  G06F11/1471 ,  G06F2201/84

Abstract: The present disclosure provides persistent storage for a master copy using operation numbers. A master copy can include a B-tree with references to corresponding data. When provisioning a slave copy, the master copy sends a point-in-time copy of the B-tree to the slave copy, which stores a copy of the B-tree, allocates the necessary space, and updates the references of the B-tree to point to a local storage before the data is transferred. When writing the data to persistent storage, a snapshot created on the master copy is an operation that is replicated to the slave copy. The snapshot is generated using a volume view that includes changes to chunks of data of the master copy since a previous snapshot, as determined using the operation number for the previous snapshot. Data (and metadata) for the snapshot is written to persistent storage while new I/O operations are processed.

公开(公告)号：US10185507B1

公开(公告)日：2019-01-22

申请号：US15385829

申请日：2016-12-20

Applicant: Amazon Technologies, Inc.

Inventor： Marc Stephen Olson ,  Christopher Magee Greenwood ,  Anthony Nicholas Liguori ,  James Michael Thompson ,  Surya Prakash Dhoolam ,  Marc John Brooker ,  Danny Wei

IPC: G06F3/06

Abstract: A first location in one or more storage nodes is determined, with the first location being associated with a first block of a plurality of blocks associated with a storage volume. First information that maps the first block to the first location is generated. At least a portion of data is obtained from the first block at the first location. A second location in the one or more storage nodes is determined, with the second location being associated with a second block. Second information that maps the second block to the second location is included in the first information. A second computer system, different from the first computer system, is enabled, by providing at least a portion of the first information, to perform an operation to the storage volume.

公开(公告)号：US09983825B2

公开(公告)日：2018-05-29

申请号：US15665063

申请日：2017-07-31

Applicant: Amazon Technologies, Inc.

Inventor： Danny Wei ,  Kerry Quintin Lee ,  John Luther Guthrie, II ,  Jianhua Fan ,  James Michael Thompson ,  Nandakumar Gopalakrishnan

IPC: G06F3/06

CPC classification number: G06F3/065 ,  G06F3/0614 ,  G06F3/0617 ,  G06F3/067 ,  G06F3/0683

Abstract: A block-based storage system may implement efficient replication for restoring a data volume from a reduced durability state. A storage node that is not replicating write requests for a data volume may determine that replication for the data volume is to be enabled. A peer storage node may be identified that maintains a stale replica of the data volume. One or more replication operations may be performed to update stale data chunks in the stale replica of the data volume with current data chunks without updating data chunks in the stale replica of the data volume that are current. Stale replicas that are no longer needed may be deleted according timeouts or the amount of stale data in the replica.

公开(公告)号：US09971526B1

公开(公告)日：2018-05-15

申请号：US14754326

申请日：2015-06-29

Applicant: Amazon Technologies, Inc.

Inventor： Danny Wei ,  Valentin Priescu ,  Marc Stephen Olson ,  Benjamin Arthur Hawks

IPC: G06F17/00 ,  G06F3/06 ,  G06F17/30

CPC classification number: G06F3/0619 ,  G06F3/064 ,  G06F3/067 ,  G06F17/30321

Abstract: The current document describes a storage system that provides a storage volume with a block-data interface to one or more clients. The storage system provides a key-value store that is associated with the storage volume. The clients access the key-value store via a key-value interface that provides a number of key-value operations to read, write, list, and delete key-value records from the key-value store. In some implementations, the key-value interface provides additional key-value operations that support the use of the key-value store by more than one client at a time. An environment in which the key-value store is used by the clients to retain I/O throttling parameters is described.

公开(公告)号：US20170351462A1

公开(公告)日：2017-12-07

申请号：US15673271

申请日：2017-08-09

Applicant: Amazon Technologies, Inc.

Inventor： Jianhua Fan ,  Benjamin Arthur Hawks ,  Norbert Paul Kusters ,  Nachiappan Arumugam ,  Danny Wei ,  John Luther Guthrie, II

IPC: G06F3/06

CPC classification number: G06F3/0665 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/067 ,  G06F11/1435

Abstract: A slave storage is provisioned using metadata of a master B-tree and updates to references (e.g., offsets) pertaining to data operations of the master B-tree. Master-slave pairs can be used to provide data redundancy, and a master copy can include the master B-tree with references to corresponding data. When provisioning a slave copy, the master sends a B-tree copy to the slave, which stores the slave B-tree copy, allocates the necessary space on local storage, and updates respective offsets of the slave B-tree copy to point to the local storage. Data from the master can then be transferred to the slave and stored according to a note and commit process that ensures operational sequence of the data. Operations received to the master during the process can be committed to the slave copy until the slave is consistent with the master and able to take over as master in the event of a failure.