IP Library Granted Patent US 12,531,800
Granted Patent B2
US 12,531,800 · App. 18/232,152 · Granted Jan 20, 2026

Read requests in a directory-less storage network

Inventors: Gary W. Grube (Barrington Hills, IL); Timothy W. Markison (Mesa, AZ)
Assignee: Pure Storage, Inc.
H04L45/00G06F3/0604G06F3/0619G06F3/0629G06F3/0659G06F3/067G06F3/0683G06F11/2089G06F12/0802G06F12/1009G06F12/1045G06F13/1668H04L67/06H04L67/1001H04L67/1097G06F2212/401H03M13/09H03M13/15H03M13/1515H03M13/23H04L41/06
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,531,800
App. No.
18/232,152
Granted
Jan 20, 2026
Kind
B2
Abstract

A method for execution by a storage unit in a directory-less storage network includes receiving a read request regarding a data segment of a data object, where the data segment was error encoded into a set of encoded data slices. The method further includes outputting a read response regarding an encoded data slice of the set of encoded data slices that is stored by the storage unit. The method further includes identifying an other storage unit of the directory-less storage network to which the read request is to be forwarded, where the identifying the other storage unit includes one or more of accessing a table of localized mapping regarding one or more neighboring storage units to identify the other storage unit, and receiving a message from a network management unit. The method further includes forwarding the read request to the other storage unit.

Claims (77)

1 . A method for execution by a storage unit in a directory-less storage network, the method comprises:

receiving a read request regarding a data segment of a data object, wherein the data segment was error encoded into a set of encoded data slices;

outputting a read response regarding an encoded data slice of the set of encoded data slices that is stored by the storage unit;

identifying an other storage unit of the directory-less storage network to which the read request is to be forwarded, wherein the identifying the other storage unit includes one or more of:

accessing a table of localized mapping regarding one or more neighboring storage units to identify the other storage unit; and

receiving a message from a network management unit; and

forwarding the read request to the other storage unit.

2 . The method of claim 1 , wherein the outputting the read response comprises:

determining, based on the read request, whether the encoded data slice is locally stored; and

when the encoded data slice is locally stored, generating the read response.

3 . The method of claim 2 , wherein the determining whether the encoded data slice is locally stored comprises:

receiving a data object identifier within the read request;

determining whether a slice name associated with the encoded data slice of stored encoded data slices within the storage unit includes a corresponding portion that substantially matches the data object identifier; and

when the slice name has the corresponding portion that substantially matches the data object identifier, indicating that the encoded data slice is locally stored.

4 . The method of claim 1 further comprises:

generating the read response to include the encoded data slice; and

outputting the read response to a requesting entity that sent the read request.

5 . The method of claim 1 further comprises:

generating the read response to include a slice name of the encoded data slice; and

outputting the read response to a requesting entity that sent the read request.

6 . The method of claim 5 further comprises:

receiving a slice read request from the requesting entity, wherein the slice read request includes the slice name;

generating a second read response to include the encoded data slice; and

outputting the second read response to the requesting entity.

7 . The method of claim 1 further comprises:

generating the read response to include the encoded data slice; and

outputting the read response to the other storage unit.

8 . The method of claim 1 further comprises:

generating the read response to include a slice name of the encoded data slice; and

outputting the read response to the identified other storage unit.

9 . The method of claim 1 further comprises:

determining whether to identify the other storage unit based on the receiving the read request for the other storage unit as a forward read request, wherein the forward read request includes propagated response information regarding a number of encoded data slices of the set of encoded data slices that have been identified in response to the read request; and

when the number of encoded data slices that have been identified in response to the request plus the encoded data slice is less than a decode threshold, performing the identifying the other storage unit, wherein the identifying includes indicating that the read request is to be forwarded to the other storage unit.

10 . The method of claim 1 , wherein the identifying the other storage unit comprises:

determining whether slices names of stored encoded data slices within the storage unit include a corresponding portion that substantially matches an identifier of the data object;

when a slice name of the slice names includes a corresponding portion that substantially matches an identifier of the data object, generating slices names of other slices of the set of encoded data slices; and

identifying the other storage unit based on one or more of the generated slices names of the other slices.

11 . A storage unit of a directory-less storage network, the storage unit comprises:

memory;

an interface; and

a processing module operably coupled to the memory and the interface, wherein the processing module is operable to:

receive, via the interface, a read request regarding a data segment of a data object, wherein the data segment was error encoded into a set of encoded data slices;

output, via the interface, a read response regarding an encoded data slice of the set of encoded data slices that is stored by the storage unit;

identify an other storage unit of the directory-less storage network to which the read request is to be forwarded, wherein the identifying the other storage unit includes one or more of:

accessing a table of localized mapping regarding one or more neighboring storage units to identify the other storage unit; and

receiving a message from a network management unit; and

forward, via the interface, the read request to the other storage unit.

12 . The storage unit of claim 11 , wherein the processing module is operable to perform the outputting the read response by:

determining, based on the read request, whether the encoded data slice is locally stored; and

when the encoded data slice is locally stored, generating the read response.

13 . The storage unit of claim 12 , wherein the processing module is operable to perform the determining whether the encoded data slice is locally stored by:

receiving, via the interface, a data object identifier within the read request;

determining whether a slice name associated with the encoded data slice of stored encoded data slices within the storage unit includes a corresponding portion that substantially matches the data object identifier; and

when the slice name has the corresponding portion that substantially matches the data object identifier, indicating that the encoded data slice is locally stored.

14 . The storage unit of claim 11 , wherein the processing module is further operable to:

generate the read response to include the encoded data slice; and

output, via the interface, the read response to a requesting entity that sent the read request.

15 . The storage unit of claim 11 , wherein the processing module is further operable to:

generate the read response to include a slice name of the encoded data slice; and

output, via the interface, the read response to a requesting entity that sent the read request.

16 . The storage unit of claim 15 , wherein the processing module is further operable to:

receive, via the interface, a slice read request from the requesting entity, wherein the slice read request includes the slice name;

generate a second read response to include the encoded data slice; and

output, via the interface, the second read response to the requesting entity.

17 . The storage unit of claim 11 , wherein the processing module is further operable to:

generate the read response to include the encoded data slice; and

output, via the interface, the read response to the other storage unit.

18 . The storage unit of claim 11 , wherein the processing module is further operable to:

generate the read response to include a slice name of the encoded data slice; and

output, via the interface, the read response to the identified other storage unit.

19 . The storage unit of claim 11 , wherein the processing module is further operable to:

determine whether to identify the other storage unit based on the receiving the read request for the other storage unit as a forward read request, wherein the forward read request includes propagated response information regarding a number of encoded data slices of the set of encoded data slices that have been identified in response to the read request; and

when the number of encoded data slices that have been identified in response to the request plus the encoded data slice is less than a decode threshold, perform the identifying the other storage unit, wherein the identifying includes indicating that the read request is to be forwarded to the other storage unit.

20 . The storage unit of claim 11 , wherein the processing module is operable to perform the identifying the other storage unit by:

determining whether slices names of stored encoded data slices within the storage unit include a corresponding portion that substantially matches an identifier of the data object;

when a slice name of the slice names includes a corresponding portion that substantially matches the identifier of the data object, generating slices names of other slices of the set of encoded data slices; and

identifying the other storage unit based on one or more of the generated slices names of the other slices.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 16, 2023
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 064605/0198 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 15, 2023
From: CLEVERSAFE, INC.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 064587/0893 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 14, 2023
From: GRUBE, GARY W.; MARKISON, TIMOTHY W.
To: CLEVERSAFE, INC.
Reel/Frame 064574/0788 →
Continuity (5)
Continuation 17812279 · Jul 13, 2022
Continuation 17115020 · Dec 8, 2020
Continuation 12850606 · Aug 4, 2010
Provisional Application 61256314 · Oct 30, 2009
Related Publication 20230385168A1 · Nov 30, 2023
References Cited (106)
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 7801994B2 · Kudo · 2010 [cited by applicant]
US 7945640B1 · VanTine · 2011 [cited by applicant]
US 8281023B2 · Dondeti · 2012 [cited by applicant]
US 9262288B2 · Grube · 2016 [cited by examiner]
US 11416179B1 · Grube · 2022 [cited by applicant]
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 20030061491A1 · Jaskiewicz · 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 20040199566A1 · Carlson · 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 · 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 20060036820A1 · Ejiri · 2006 [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 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 20070250604A1 · Wu · 2007 [cited by applicant]
US 20070283167A1 · Venters · 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 20230385168A1 · Grube · 2023 [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]