Microsoft Technology Licensing, LLC

Robert John Jenkins, Jr

Cheng Huang

Sergey M Yekhanin

Parikshit Santhan Gopalan

Jin Li

Edmund Bernard Nightingale

Alexander Shamis

Dennis Craig Fetterly

The techniques and/or systems described herein implement erasure coding to generate various chunks for a data collection (e.g., data chunks and at least one encoding chunk). The chunks are then distributed and stored within an individual group (e.g., a pod) of storage units, where a pod of storage units is determined based on characteristics that affect an amount of time it takes to recover a data collection or to restore lost data.

Erasure coding of data within a group of storage units based on connection characteristics

In some examples, an erasure code can be implemented to provide for fault-tolerant storage of data. Maximally recoverable cloud codes, resilient cloud codes, and robust product codes are examples of different erasure codes that can be implemented to encode and store data. Implementing different erasure codes and different parameters within each erasure code can involve trade-offs between reliability, redundancy, and locality. In some examples, an erasure code can specify placement of the encoded data on machines that are organized into racks.

Local erasure codes for data storage

Growing community of inventors

Redmond, WA, United States of America

Robert John Jenkins, Jr