IP Library Granted Patent US 12,267,251
Granted Patent B2
US 12,267,251 · App. 18/668,356 · Granted Apr 1, 2025

Identifying multiple resources of a storage network for data retrieval

Inventors: Jason K. Resch (Warwick, RI); Greg R. Dhuse (Chicago, IL); Manish Motwani (Chicago, IL); Andrew D. Baptist (Mt. Pleasant, WI); Wesley B. Leggette (Chicago, IL)
Assignee: Pure Storage, Inc.
H04L47/70G06F3/0616G06F3/0623G06F3/0647G06F3/067G06F3/0685H04L67/1097
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,267,251
App. No.
18/668,356
Granted
Apr 1, 2025
Kind
B2
Abstract

Methods and apparatus for identifying multiple resources of a storage network for data retrieval are disclosed. In various embodiments, a determination is made to retrieve an encoded data slice from the storage network. Based on configuration information for the storage network, one or more configurations are identified, including a current configuration. For the identified configurations, ranked scoring information relating to the encoded data slice is determined for a plurality of resources associated with the identified configurations. Based on the ranked scoring information, a resource is selected for each of the identified configurations. In addition, a retrieval likelihood level for the data slice is determined for each of the selected resources. Based on the likelihood levels for the selected resources, one or more of the selected resources are identified for encoded data slice retrieval and read slice requests are issued to the one or more selected resources.

Claims (60)

1. A method for execution by one or more processing modules of a computing device of a storage network, the method comprises:

determining to retrieve an encoded data slice from a storage network that includes a plurality of resources;

obtaining configuration information for the storage network;

identifying, based on the configuration information, one or more configurations of the storage network, wherein the one or more configurations includes a current configuration;

for each of the one or more configurations, determining ranked scoring information, in relation to the encoded data slice, for at least a subset of the plurality of resources associated with the one or more configurations;

for each of the one or more configurations, selecting a resource based on the ranked scoring information, wherein the at least a subset of the plurality of resources includes the selected resource;

determining a likelihood level for each of the selected resources;

identifying one or more of the selected resources for encoded data slice retrieval based on the likelihood level for each of the selected resources; and

issuing read slice requests to the identified one or more of the selected resources.

2. The method of claim 1 , further comprising:

in response to the read slice requests, receiving the encoded data slice from at least one of the identified one or more of the selected resources.

3. The method of claim 1 , further comprising:

in response to the read slice requests, receiving at least one resource access response that includes at least one read slice response, where the at least one read slice response includes the encoded data slice.

4. The method of claim 1 , wherein the configuration information includes modification information relating to the one or more configurations.

5. The method of claim 1 , wherein identifying one or more configurations of the storage network includes at least one of identifying a current configuration, identifying a previous configuration, or extracting a resource utilization history.

6. The method of claim 5 , wherein each configuration includes a list of resources and associated location weights.

7. The method of claim 1 , wherein determining ranked scoring information includes utilizing a decentralized agreement function based on the configuration information and a slice name associated with the encoded data slice.

8. The method of claim 1 , wherein determining a likelihood level for each of the selected resources includes calculating a probability that the encoded data slice is retrievable from a selected resource.

9. The method of claim 8 , wherein calculating a probability is based on at least one of a migration status, resource availability indicator, or a resource utilization history.

10. The method of claim 8 , wherein identifying one or more of the selected resources for encoded data slice retrieval includes selecting resources associated with probabilities greater than a probability threshold level.

11. The method of claim 8 , wherein identifying one or more of the selected resources for encoded data slice retrieval includes selecting a number of resources associated with highest probabilities.

12. A computing device comprises:

at least one interface;

memory that stores operational instructions; and

one or more processing modules operably coupled to the at least one interface and the memory, wherein the one or more processing modules are configured to execute the operational instructions to:

determine to retrieve an encoded data slice from a storage network that includes a plurality of resources;

obtain configuration information for the storage network;

identify, based on the configuration information, one or more configurations of the storage network, wherein the one or more configurations includes a current configuration;

for each of the one or more configurations, determine ranked scoring information, with regards to the encoded data slice, for at least a subset of the plurality of resources associated with the one or more configurations;

for each of the one or more configurations, select a resource based on the ranked scoring information, wherein the at least a subset of the plurality of resources includes the selected resource;

determine a likelihood level for each of the selected resources;

identify one or more of the selected resources for encoded data slice retrieval based on the likelihood level for each of the selected resources; and

issue, via the at least one interface, read slice requests for the encoded data slice to the identified one or more of the selected resources.

13. The computing device of claim 12 , wherein the configuration information includes modification information relating to the one or more configurations, the modification information including at least one of:

current resources and location weights;

previous resources and previous location weights;

utilization history of resources; or

migration status information.

14. The computing device of claim 12 , wherein each configuration includes a list of resources and associated location weights.

15. The computing device of claim 12 , wherein determining ranked scoring information includes:

issuing a ranked scoring information request to a decentralized agreement module; and

receiving the ranked scoring information from the decentralized agreement module, wherein the ranked scoring information request includes at least one of an identifier of the encoded data slice or configuration information.

16. The computing device of claim 12 , wherein determining a likelihood level for each of the selected resources includes calculating a probability that the encoded data slice is retrievable from a selected resource.

17. The computing device of claim 16 , wherein calculating a probability is based on at least one of a migration status, resource availability indicator, or a resource utilization history.

18. The computing device of claim 12 , wherein identifying one or more of the selected resources for encoded data slice retrieval includes selecting resources associated with probabilities greater than a probability threshold level.

19. A computer readable storage medium comprises:

at least one memory section that stores operational instructions that, when executed by one or more processing modules of a computing device of a storage network, causes the computing device to:

determine to retrieve an encoded data slice from a storage network that includes a plurality of resources;

obtain configuration information for the storage network;

identify, based on the configuration information, one or more configurations of the storage network, wherein the one or more configurations includes a current configuration;

for each of the one or more configurations, determine ranked scoring information, in relation to the encoded data slice, for at least a subset of the plurality of resources associated with the one or more configurations;

for each of the one or more configurations, select a resource based on the ranked scoring information, wherein the at least a subset of the plurality of resources includes the selected resource;

determine a likelihood level for each of the selected resources;

identify one or more of the selected resources for encoded data slice retrieval based on the likelihood level for each of the selected resources; and

issue read slice requests for the encoded data slice to the identified one or more of the selected resources.

20. The computing readable storage medium of claim 19 , wherein the configuration information includes modification information relating to the one or more configurations, the modification information including at least one of:

current resources and location weights;

previous resources and previous location weights;

utilization history of resources; or

migration status information.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 10, 2024
From: RESCH, JASON K.; MOTWANI, MANISH; LEGGETTE, WESLEY B.; DHUSE, GREG R.; BAPTIST, ANDREW D.
To: PURE STORAGE, INC.
Reel/Frame 068542/0123 →
Continuity (7)
Continuation 17814022 · Jul 21, 2022
Continuation 16858956 · Apr 27, 2020
Continuation In Part 16271370 · Feb 8, 2019
Continuation In Part 15903992 · Feb 23, 2018
Continuation 14707943 · May 8, 2015
Provisional Application 62019074 · Jun 30, 2014
Related Publication 20240314087A1 · Sep 19, 2024
References Cited (129)
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 · Nikolaevich · 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 7636724B2 · De La Torre · 2009 [cited by applicant]
US 7668901B2 · Franke · 2010 [cited by applicant]
US 8275744B2 · Baptist · 2012 [cited by applicant]
US 8601220B1 · Corbin · 2013 [cited by applicant]
US 9460229B2 · Lepeska · 2016 [cited by applicant]
US 9547726B2 · Ran · 2017 [cited by applicant]
US 9946604B1 · Glass · 2018 [cited by applicant]
US 11269926B1 · Adogla · 2022 [cited by applicant]
US 11740972B1 · Khadiwala · 2023 [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 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 · 2006 [cited by applicant]
US 20070050590A1 · Syed · 2007 [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 20070233828A1 · Gilbert · 2007 [cited by applicant]
US 20070234110A1 · Soran · 2007 [cited by applicant]
US 20070283167A1 · Venters, III · 2007 [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 20100269146A1 · Britt · 2010 [cited by applicant]
US 20110072210A1 · Dhuse · 2011 [cited by applicant]
US 20110072321A1 · Dhuse · 2011 [cited by applicant]
US 20110106972A1 · Grube et al. · 2011 [cited by applicant]
US 20110161781A1 · Gladwin · 2011 [cited by applicant]
US 20110185258A1 · Grube · 2011 [cited by examiner]
US 20110191445A1 · Dazzi · 2011 [cited by applicant]
US 20120117239A1 · Holloway · 2012 [cited by applicant]
US 20120117351A1 · Motwani · 2012 [cited by examiner]
US 20120311068A1 · Gladwin et al. · 2012 [cited by applicant]
US 20130110962A1 · Grube · 2013 [cited by applicant]
US 20130111166A1 · Resch · 2013 [cited by applicant]
US 20130151670A1 · Leggette · 2013 [cited by applicant]
US 20130212148A1 · Koponen · 2013 [cited by applicant]
US 20130275480A1 · Dhuse · 2013 [cited by applicant]
US 20130290482A1 · Leggette · 2013 [cited by applicant]
US 20130290529A1 · Gordon · 2013 [cited by applicant]
US 20140330921A1 · Storm · 2014 [cited by applicant]
US 20150067421A1 · Baptist · 2015 [cited by applicant]
US 20160179618A1 · Resch · 2016 [cited by examiner]
US 20160378350A1 · Motwani · 2016 [cited by applicant]
US 20170168720A1 · Kazi · 2017 [cited by applicant]
US 20170185483A1 · Baptist · 2017 [cited by examiner]
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]