IP Library Granted Patent US 12,585,541
Granted Patent B2
US 12,585,541 · App. 18/967,825 · Granted Mar 24, 2026

Recovering data objects encoded with locally decodable code segments

Inventors: Thomas D. Cocagne (Elk Grove Village, IL); Jason K. Resch (Warwick, RI); Ilya Volvovski (Chicago, IL)
Assignee: Pure Storage, Inc.
G06F11/1092G06F3/0619G06F3/0659G06F3/0689
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,585,541
App. No.
18/967,825
Granted
Mar 24, 2026
Kind
B2
Abstract

A storage network operates by: encoding at least one data object in the storage network as encoded data slices that include one or more locally decodable code segments; detecting at least one storage error associated with storage of at least one of the encoded data slices in the storage network; and recovering the at least one of the encoded data slices utilizing the one or more locally decodable code segments.

Claims (36)

1 . A method for execution by a storage network that includes a processor, the method comprising:

encoding at least one data object in the storage network as encoded data slices that include one or more locally decodable code segments;

detecting at least one storage error associated with storage of at least one of the encoded data slices in the storage network; and

recovering the at least one of the encoded data slices utilizing the one or more locally decodable code segments.

2 . The method of claim 1 , further comprising:

rebuilding the at least one of the encoded data slices associated with the storage error utilizing the at least one data object recovered based on the one or more locally decodable code segments.

3 . The method of claim 2 , wherein the rebuilding includes re-encoding the at least one data object via dispersed error encoding.

4 . The method of claim 2 , further comprising:

issuing a rebuilding request to a rebuilding module.

5 . The method of claim 4 , wherein issuing the rebuilding request includes:

identifying a storage unit of the storage network associated with the storage error.

6 . The method of claim 5 , wherein issuing the rebuilding request further includes:

sending the rebuilding request to the rebuilding module that is associated with the storage unit.

7 . The method of claim 1 , wherein the encoded data slices are stored in a set of storage units of the storage network.

8 . The method of claim 1 , wherein a read threshold number of the encoded data slices are required to decode the at least one data object.

9 . The method of claim 1 , wherein the at least one storage error is determined to exist in response to detecting that less than a write threshold number of encoded data slices are available.

10 . The method of claim 1 , wherein the at least one storage error is determined to exist in response to detecting a device failure or in response to detecting that a storage network storage utilization level is greater than a maximum storage utilization threshold level.

11 . A processing system of a storage network comprises:

at least one processor;

a memory that stores operational instructions, that when executed by the at least one processor cause the processing system to perform operations that include:

encoding at least one data object in the storage network as encoded data slices that include one or more locally decodable code segments;

detecting at least one storage error associated with storage of at least one of the encoded data slices in the storage network; and

recovering the at least one of the encoded data slices utilizing the one or more locally decodable code segments.

12 . The processing system of claim 11 , wherein the operations further include:

rebuilding the at least one of the encoded data slices associated with the storage error utilizing the at least one data object recovered based on the one or more locally decodable code segments.

13 . The processing system of claim 12 , wherein the rebuilding includes re-encoding the at least one data object via dispersed error encoding.

14 . The processing system of claim 12 , wherein the operations further include:

issuing a rebuilding request to a rebuilding module.

15 . The processing system of claim 14 , wherein issuing the rebuilding request includes:

identifying a storage unit of the storage network associated with the storage error.

16 . The processing system of claim 15 , wherein issuing the rebuilding request further includes:

sending the rebuilding request to the rebuilding module that is associated with the storage unit.

17 . The processing system of claim 11 , wherein the encoded data slices are stored in a set of storage units of the storage network.

18 . The processing system of claim 11 , wherein a read threshold number of the encoded data slices are required to decode the at least one data object.

19 . The processing system of claim 11 , wherein the at least one storage error is determined to exist in response to detecting that less than a write threshold number of encoded data slices are available.

20 . The processing system of claim 11 , wherein the at least one storage error is determined to exist in response to detecting a device failure or in response to detecting that a storage network storage utilization level is greater than a maximum storage utilization threshold level.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 4, 2024
From: COCAGNE, THOMAS D.; RESCH, JASON K.; VOLVOVSKI, ILYA
To: PURE STORAGE, INC.
Reel/Frame 069482/0574 →
Continuity (7)
Continuation 17931159 · Sep 12, 2022
Continuation 16951253 · Nov 18, 2020
Continuation In Part 15845126 · Dec 18, 2017
Continuation In Part 15843143 · Dec 15, 2017
Continuation In Part 15006845 · Jan 26, 2016
Provisional Application 62141034 · Mar 31, 2015
Related Publication 20250094283A1 · Mar 20, 2025
References Cited (170)
US 4092732A · Ouchi · 1978 [cited by applicant]
US 5454101A · Mackay · 1995 [cited by applicant]
US 5485474A · Rabin · 1996 [cited by applicant]
US 5774643A · Lubbers · 1998 [cited by applicant]
US 5802364A · Senator · 1998 [cited by applicant]
US 5809285A · Hilland · 1998 [cited by applicant]
US 5890156A · Rekieta · 1999 [cited by applicant]
US 5987622A · Lo Verso · 1999 [cited by applicant]
US 5991414A · Garay · 1999 [cited by applicant]
US 6012159A · Fischer · 2000 [cited by applicant]
US 6058454A · Gerlach · 2000 [cited by applicant]
US 6128277A · Bruck · 2000 [cited by applicant]
US 6175571B1 · Haddock · 2001 [cited by applicant]
US 6192472B1 · Garay · 2001 [cited by applicant]
US 6256688B1 · Suetaka · 2001 [cited by applicant]
US 6272658B1 · Steele · 2001 [cited by applicant]
US 6301604B1 · Nojima · 2001 [cited by applicant]
US 6356949B1 · Katsandres · 2002 [cited by applicant]
US 6366995B1 · Vilkov · 2002 [cited by applicant]
US 6374336B1 · Peters · 2002 [cited by applicant]
US 6415373B1 · Peters · 2002 [cited by applicant]
US 6418539B1 · Walker · 2002 [cited by applicant]
US 6449688B1 · Peters · 2002 [cited by applicant]
US 6567948B2 · Steele · 2003 [cited by applicant]
US 6571282B1 · Bowman-Amuah · 2003 [cited by applicant]
US 6609223B1 · Wolfgang · 2003 [cited by applicant]
US 6718361B1 · Basani · 2004 [cited by applicant]
US 6760808B2 · Peters · 2004 [cited by applicant]
US 6785768B2 · Peters · 2004 [cited by applicant]
US 6785783B2 · Buckland · 2004 [cited by applicant]
US 6826711B2 · Moulton · 2004 [cited by applicant]
US 6879596B1 · Dooply · 2005 [cited by applicant]
US 7003688B1 · Pittelkow · 2006 [cited by applicant]
US 7024451B2 · Jorgenson · 2006 [cited by applicant]
US 7024609B2 · Wolfgang · 2006 [cited by applicant]
US 7080101B1 · Watson · 2006 [cited by applicant]
US 7103824B2 · Halford · 2006 [cited by applicant]
US 7103915B2 · Redlich · 2006 [cited by applicant]
US 7111115B2 · Peters · 2006 [cited by applicant]
US 7140044B2 · Redlich · 2006 [cited by applicant]
US 7146644B2 · Redlich · 2006 [cited by applicant]
US 7171493B2 · Shu · 2007 [cited by applicant]
US 7222133B1 · Raipurkar · 2007 [cited by applicant]
US 7240236B2 · Cutts · 2007 [cited by applicant]
US 7272613B2 · Sim · 2007 [cited by applicant]
US 7574570B2 · Gladwin et al. · 2009 [cited by applicant]
US 7634006B2 · Choi · 2009 [cited by applicant]
US 7636724B2 · de la Torre · 2009 [cited by applicant]
US 7904475B2 · Gladwin · 2011 [cited by applicant]
US 7962641B1 · Dhuse · 2011 [cited by applicant]
US 8082390B1 · Fan · 2011 [cited by applicant]
US 8171101B2 · Gladwin · 2012 [cited by applicant]
US 8209363B2 · Palthepu · 2012 [cited by applicant]
US 8281181B2 · Resch · 2012 [cited by applicant]
US 8285878B2 · Gladwin · 2012 [cited by applicant]
US 8452819B1 · Sorenson, III · 2013 [cited by applicant]
US 8464133B2 · Grube · 2013 [cited by applicant]
US 8625637B2 · Baptist · 2014 [cited by applicant]
US 8656138B2 · Resch · 2014 [cited by applicant]
US 8850113B2 · Baptist · 2014 [cited by examiner]
US 8880799B2 · Foster · 2014 [cited by applicant]
US 8938591B2 · Mark · 2015 [cited by applicant]
US 9043689B2 · Resch · 2015 [cited by applicant]
US 9164841B2 · Resch · 2015 [cited by applicant]
US 9332422B2 · Bai · 2016 [cited by applicant]
US 9489264B2 · Gladwin · 2016 [cited by applicant]
US 9652470B2 · Volvovski · 2017 [cited by applicant]
US 9703812B2 · Resch · 2017 [cited by applicant]
US 9762395B2 · Kazi · 2017 [cited by applicant]
US 9774678B2 · Resch · 2017 [cited by applicant]
US 9921907B2 · Volvovski · 2018 [cited by applicant]
US 10042751B1 · Veprinsky · 2018 [cited by applicant]
US 10635312B2 · Cabral · 2020 [cited by examiner]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020166079A1 · Ulrich · 2002 [cited by applicant]
US 20030018927A1 · Gadir · 2003 [cited by applicant]
US 20030037261A1 · Meffert · 2003 [cited by applicant]
US 20030065617A1 · Watkins · 2003 [cited by applicant]
US 20030084020A1 · Shu · 2003 [cited by applicant]
US 20040024963A1 · Talagala · 2004 [cited by applicant]
US 20040122917A1 · Menon · 2004 [cited by applicant]
US 20040215998A1 · Buxton · 2004 [cited by applicant]
US 20040228493A1 · Ma · 2004 [cited by applicant]
US 20050015566A1 · Zohar · 2005 [cited by applicant]
US 20050100022A1 · Ramprashad · 2005 [cited by applicant]
US 20050114594A1 · Corbett · 2005 [cited by applicant]
US 20050125593A1 · Karpoff · 2005 [cited by applicant]
US 20050131993A1 · Fatula, Jr. · 2005 [cited by applicant]
US 20050132070A1 · Redlich · 2005 [cited by applicant]
US 20050144382A1 · Schmisseur · 2005 [cited by applicant]
US 20050229069A1 · Hassner · 2005 [cited by applicant]
US 20060047907A1 · Shiga · 2006 [cited by applicant]
US 20060136448A1 · Cialini · 2006 [cited by applicant]
US 20060156059A1 · Kitamura · 2006 [cited by applicant]
US 20060224603A1 · Correll, Jr. · 2006 [cited by applicant]
US 20070079081A1 · Gladwin · 2007 [cited by applicant]
US 20070079082A1 · Gladwin · 2007 [cited by applicant]
US 20070079083A1 · Gladwin · 2007 [cited by applicant]
US 20070088970A1 · Buxton · 2007 [cited by applicant]
US 20070174192A1 · Gladwin · 2007 [cited by applicant]
US 20070214285A1 · Au · 2007 [cited by applicant]
US 20070234110A1 · Soran · 2007 [cited by applicant]
US 20070245082A1 · Margolus · 2007 [cited by applicant]
US 20070283167A1 · Venters · 2007 [cited by applicant]
US 20080221856A1 · Dubnicki · 2008 [cited by applicant]
US 20080273540A1 · Gerovac · 2008 [cited by applicant]
US 20090037500A1 · Kirshenbaum · 2009 [cited by applicant]
US 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20100064166A1 · Dubnicki · 2010 [cited by applicant]
US 20100169661A1 · Summers · 2010 [cited by applicant]
US 20100268692A1 · Resch · 2010 [cited by applicant]
US 20100269008A1 · Leggette · 2010 [cited by examiner]
US 20110010518A1 · Kavuri · 2011 [cited by applicant]
US 20110122523A1 · Gladwin · 2011 [cited by applicant]
US 20110126060A1 · Grube · 2011 [cited by applicant]
US 20110225451A1 · Leggette · 2011 [cited by applicant]
US 20110289122A1 · Grube · 2011 [cited by applicant]
US 20110289366A1 · Baptist · 2011 [cited by applicant]
US 20120102316A1 · Resch · 2012 [cited by applicant]
US 20120117351A1 · Motwani · 2012 [cited by applicant]
US 20120254692A1 · Resch · 2012 [cited by applicant]
US 20130046992A1 · Resch · 2013 [cited by applicant]
US 20130047057A1 · Resch · 2013 [cited by applicant]
US 20130107944A1 · Watanabe · 2013 [cited by examiner]
US 20130198130A1 · Resch · 2013 [cited by applicant]
US 20130232378A1 · Resch · 2013 [cited by applicant]
US 20130238932A1 · Resch · 2013 [cited by applicant]
US 20130304746A1 · Dhuse · 2013 [cited by applicant]
US 20130325823A1 · Resch · 2013 [cited by applicant]
US 20130326215A1 · Leggette · 2013 [cited by applicant]
US 20130326264A1 · Resch · 2013 [cited by applicant]
US 20140040662A1 · Dhuse · 2014 [cited by applicant]
US 20140068791A1 · Resch · 2014 [cited by applicant]
US 20140122636A1 · Peake · 2014 [cited by applicant]
US 20140122968A1 · Kazi · 2014 [cited by applicant]
US 20140244788A1 · Resch · 2014 [cited by applicant]
US 20140325266A1 · Hoffman · 2014 [cited by applicant]
US 20140330921A1 · Storm · 2014 [cited by applicant]
US 20140331086A1 · Resch · 2014 [cited by applicant]
US 20150006952A1 · Trichardt · 2015 [cited by applicant]
US 20150039969A1 · Motwani · 2015 [cited by applicant]
US 20150040134A1 · Leggette · 2015 [cited by applicant]
US 20150067421A1 · Baptist · 2015 [cited by applicant]
US 20150288384A1 · Gladwin · 2015 [cited by applicant]
US 20150378616A1 · Khadiwala · 2015 [cited by applicant]
US 20160055060A1 · Resch · 2016 [cited by applicant]
US 20160179618A1 · Resch · 2016 [cited by applicant]
US 20160224423A1 · Grube · 2016 [cited by examiner]
US 20170033108A1 · Masuoka et al. · 2017 [cited by applicant]
US 20180081759A1 · Motwani · 2018 [cited by applicant]
Chung; An Automatic Data Segmentation Method for 3D Measured Data Points; National Taiwan University; pp. 1-8; 1998. [cited by applicant]
Harrison; Lightweight Directory Access Protocol (LDAP): Authentication Methods and Security Mechanisms; IETF Network Working Group; RFC 4513; Jun. 2006; pp. 1-32. [cited by applicant]
Kubiatowicz, et al.; OceanStore: An Architecture for Global-Scale Persistent Storage; Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 20… [cited by applicant]
Legg; Lightweight Directory Access Protocol (LDAP): Syntaxes and Matching Rules; IETF Network Working Group; RFC 4517; Jun. 2006; pp. 1-50. [cited by applicant]
Plank, T1: Erasure Codes for Storage Applications; FAST2005, 4th Usenix Conference on File Storage Technologies; Dec. 13-16, 2005; pp. 1-74. [cited by applicant]
Rabin; Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance; Journal of the Association for Computer Machinery; vol. 36, No. 2; Apr. 1989; pp. 335-348. [cited by applicant]
Satran, et al.; Internet Small Computer Systems Interface (iSCSI); IETF Network Working Group; RFC 3720; Apr. 2004; pp. 1-257. [cited by applicant]
Sciberras; Lightweight Directory Access Protocol (LDAP): Schema for User Applications; IETF Network Working Group; RFC 4519; Jun. 2006; pp. 1-33. [cited by applicant]
Sermersheim; Lightweight Directory Access Protocol (LDAP): The Protocol; IETF Network Working Group; RFC 4511; Jun. 2006; pp. 1-68. [cited by applicant]
Shamir; How to Share a Secret; Communications of the ACM; vol. 22, No. 11; Nov. 1979; pp. 612-613. [cited by applicant]
Smith; Lightweight Directory Access Protocol (LDAP): Uniform Resource Locator; IETF Network Working Group; RFC 4516; Jun. 2006; pp. 1-15. [cited by applicant]
Smith; Lightweight Directory Access Protocol (LDAP): String Representation of Search Filters; IETF Network Working Group; RFC 4515; Jun. 2006; pp. 1-12. [cited by applicant]
Wildi; Java iSCSi Initiator; Master Thesis; Department of Computer and Information Science, University of Konstanz; Feb. 2007; 60 pgs. [cited by applicant]
Xin, et al.; Evaluation of Distributed Recovery in Large-Scale Storage Systems; 13th IEEE International Symposium on High Performance Distributed Computing; Jun. 2004; pp. 172-181. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Directory Information Models; IETF Network Working Group; RFC 4512; Jun. 2006; pp. 1-49. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Internationalized String Preparation; IETF Network Working Group; RFC 4518; Jun. 2006; pp. 1-14. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): String Representation of Distinguished Names; IETF Network Working Group; RFC 4514; Jun. 2006; pp. 1-15. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Technical Specification Road Map; IETF Network Working Group; RFC 4510; Jun. 2006; pp. 1-8. [cited by applicant]