IP Library Granted Patent US 12,675,366
Granted Patent B2
US 12,675,366 · App. 18/808,433 · Granted Jul 7, 2026

Recovering data from de-sequenced encoded data slices

Inventors: S. Christopher Gladwin (Chicago, IL); Chuck Wilson Templeton (Chicago, IL); Jason K. Resch (Warwick, RI); Gary W. Grube (Barrington Hills, IL)
Assignee: Pure Storage, Inc.
G06F11/1076G06F3/0619G06F3/0647G06F3/067G06F21/72G06F21/80G06F21/85H04L9/3242H04L67/1097H04N21/222H04N21/2347H04N21/8456H04W12/033G06F11/1008G06F2211/1028G06F2221/2107H04L65/764H04W12/02
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,675,366
App. No.
18/808,433
Filed
Aug 19, 2024
Granted
Jul 7, 2026
Kind
B2
Art Unit
2111
USPC
714/763
Abstract

A method for execution by one or more computing devices of a storage network, the method includes de-selecting a sequence of input encoded data slices based on de-selection information to produce deselected encoded data slices of a set of encoded data slices, where the input encoded data slices include a set of encoded data slices interspersed with a set of auxiliary data slices. The method further includes error decoding at least a decode threshold number of encoded data slices of the deselected encoded data slices in accordance with error decoding parameters to reproduce a data segment. The method further includes outputting the data segment to a requesting computing device of the storage network.

Claims (68)

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

de-selecting a sequence of input encoded data slices based on de-selection information to produce deselected encoded data slices of a set of encoded data slices, wherein the input encoded data slices include the set of encoded data slices interspersed with a set of auxiliary data slices;

de-sequencing a random sequence of the deselected encoded data slices to produce an ordered sequence of at least a decode threshold number of encoded data slices;

error decoding the ordered sequence of the at least the decode threshold number of encoded data slices of the deselected encoded data slices in accordance with error decoding parameters to reproduce a data segment; and

outputting the data segment to a requesting computing device of the storage network.

2 . The method of claim 1 further comprises:

obtaining the input encoded data slices from memory of the storage network.

3 . The method of claim 1 further comprises:

error encoding a data segment into the set of encoded data slices in accordance with error coding parameters.

4 . The method of claim 1 further comprises:

error encoding auxiliary data into the set of auxiliary data slices in accordance with auxiliary encoding parameters.

5 . The method of claim 1 further comprises:

de-selecting the sequence of input encoded data slices based on the de-selection information to produce the set of auxiliary data slices; and

error decoding the auxiliary data slices in accordance with auxiliary decoding parameters to reproduce the auxiliary data.

6 . The method of claim 5 , wherein the auxiliary decoding parameters are the same as the error decoding parameters.

7 . The method of claim 3 further comprises:

determining the deselected encoded data slices are in a random sequence based on the auxiliary data;

wherein the auxiliary data comprises identity of the random sequence.

8 . The method of claim 3 further comprises:

determining the data segment is an encrypted data segment based on the auxiliary data; and

decrypting the encrypted data segment utilizing a decryption key to produce the data segment, wherein the auxiliary data includes an identity of the decryption key.

9 . The method of claim 1 further comprises:

obtaining operational parameters for the input encoded data slices; and

determining the error decoding parameters for the error decoding the at least the decode threshold number of encoded data slices based on the operational parameters.

10 . The method of claim 1 further comprises:

obtaining the de-selection information by performing a lookup.

11 . The method of claim 1 , wherein the de-selection information includes an identifier of a de-selection algorithm.

12 . The method of claim 1 , wherein the set of auxiliary data slices, when reconstructed as auxiliary data, comprises at least one of:

null data;

authentication information;

a next pseudo random output sequencing order;

a pseudo random output sequencing order identifier;

a next outputting threshold;

a random number generator output;

an encryption key;

a starting point for the pseudo random output sequencing order;

a device identifier;

a data identifier;

a data type;

a data size indicator;

a priority indicator;

a security indicator; or

a performance indicator.

13 . A computing device of a storage network, the computing device comprises:

memory;

an interface; and

at least one processing module operably coupled to the memory and the interface,

wherein the processing module is operable to:

de-select a sequence of input encoded data slices based on de-selection information to produce deselected encoded data slices of a set of encoded data slices, wherein the input encoded data slices include the set of encoded data slices interspersed with a set of auxiliary data slices;

de-sequence a random sequence of the deselected encoded data slices to produce an ordered sequence of at least a decode threshold number of encoded data slices;

error decode the ordered sequence of the at least the decode threshold number of encoded data slices of the deselected encoded data slices in accordance with error decoding parameters to reproduce a data segment; and

outputting the data segment to a requesting computing device of the storage network.

14 . The computing device of claim 13 further comprises:

obtaining the input encoded data slices from memory of the storage network.

15 . The computing device of claim 13 further comprises:

error encoding a data segment into the set of encoded data slices in accordance with error coding parameters.

16 . The computing device of claim 13 further comprises:

error encoding auxiliary data into the set of auxiliary data slices in accordance with auxiliary encoding parameters.

17 . The computing device of claim 16 further comprises:

de-selecting the sequence of input encoded data slices based on the de-selection information to produce the set of auxiliary data slices; and

error decoding the auxiliary data slices in accordance with auxiliary decoding parameters to reproduce the auxiliary data.

18 . The computing device of claim 17 , wherein the auxiliary decoding parameters are the same as the error decoding parameters.

19 . The computing device of claim 16 further comprises:

determining the deselected encoded data slices are in a random sequence based on the auxiliary data;

wherein the auxiliary data comprises identity of the random sequence.

20 . The computing device of claim 16 further comprises:

determining the data segment is an encrypted data segment based on the auxiliary data; and

decrypting the encrypted data segment utilizing a decryption key to produce the data segment, wherein the auxiliary data includes an identity of the decryption key.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 22, 2024
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 068747/0289 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 21, 2024
From: CLEVERSAFE, INC.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 068734/0152 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 20, 2024
From: GLADWIN, S. CHRISTOPHER; TEMPLETON, CHUCK WILSON; RESCH, JASON K.; GRUBE, GARY W.
To: CLEVERSAFE, INC.
Reel/Frame 068336/0438 →
Continuity (8)
Continuation 18218705 · Jul 6, 2023
Continuation 17663926 · May 18, 2022
Continuation 17247424 · Dec 10, 2020
Continuation 16201878 · Nov 27, 2018
Continuation In Part 14452182 · Aug 5, 2014
Continuation 12954880 · Nov 28, 2010
Provisional Application 61299245 · Jan 28, 2010
Related Publication 20240411939A1 · Dec 12, 2024
References Cited (243)
US 4092732A · Ouchi · 1978 [cited by applicant]
US 4855584A · Tomiyama · 1989 [cited by applicant]
US 5361323A · Murata · 1994 [cited by applicant]
US 5454101A · Mackay · 1995 [cited by applicant]
US 5485474A · Rabin · 1996 [cited by applicant]
US 5535239A · Padovani · 1996 [cited by applicant]
US 5613001A · Bakhoum · 1997 [cited by applicant]
US 5621799A · Katta · 1997 [cited by applicant]
US 5774643A · Lubbers · 1998 [cited by applicant]
US 5793885A · Kasson · 1998 [cited by examiner]
US 5802364A · Senator · 1998 [cited by applicant]
US 5809285A · Hilland · 1998 [cited by applicant]
US 5890156A · Rekieta · 1999 [cited by applicant]
US 5910182A · Dent · 1999 [cited by applicant]
US 5983385A · Khayrallah · 1999 [cited by examiner]
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 6301558B1 · Isozaki · 2001 [cited by examiner]
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 6571212B1 · Dent · 2003 [cited by applicant]
US 6571282B1 · Bowman-Amuah · 2003 [cited by applicant]
US 6609223B1 · Wolfgang · 2003 [cited by applicant]
US 6668325B1 · Collberg · 2003 [cited by applicant]
US 6678828B1 · Pham · 2004 [cited by applicant]
US 6690795B1 · Richards · 2004 [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 6981217B1 · Knauft · 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 7272602B2 · Moulton · 2007 [cited by applicant]
US 7272613B2 · Sim · 2007 [cited by applicant]
US 7406595B1 · Boyle · 2008 [cited by applicant]
US 7457415B2 · Reitmeier · 2008 [cited by applicant]
US 7472334B1 · Scott · 2008 [cited by applicant]
US 7478316B2 · Koppich · 2009 [cited by applicant]
US 7509390B1 · Raman · 2009 [cited by applicant]
US 7509420B2 · Moulton · 2009 [cited by applicant]
US 7577689B1 · Masinter · 2009 [cited by applicant]
US 7636724B2 · de la Torre · 2009 [cited by examiner]
US 7707645B2 · Haruki · 2010 [cited by applicant]
US 7991746B2 · Krishnaiyer · 2011 [cited by applicant]
US 8275132B2 · Buchen · 2012 [cited by applicant]
US 8392474B2 · Franco · 2013 [cited by applicant]
US 8522125B1 · Feng · 2013 [cited by applicant]
US 8560930B2 · Li · 2013 [cited by applicant]
US 8626820B1 · Levy · 2014 [cited by applicant]
US 8649521B2 · Grube · 2014 [cited by applicant]
US 8677214B2 · Grube · 2014 [cited by applicant]
US 8744071B2 · Leggette · 2014 [cited by applicant]
US 8782494B2 · Grube · 2014 [cited by applicant]
US 8856617B2 · Grube · 2014 [cited by applicant]
US 8885821B2 · Grube · 2014 [cited by applicant]
US 8904080B2 · Martin · 2014 [cited by applicant]
US 8918897B2 · Resch · 2014 [cited by applicant]
US 8959336B1 · Lee · 2015 [cited by applicant]
US 8959366B2 · Grube · 2015 [cited by applicant]
US 9015301B2 · Redlich · 2015 [cited by applicant]
US 9021263B2 · Resch · 2015 [cited by applicant]
US 9076138B2 · Resch · 2015 [cited by applicant]
US 9128870B2 · Grube · 2015 [cited by applicant]
US 9135456B2 · O'Hare · 2015 [cited by applicant]
US 9246515B2 · Kong · 2016 [cited by examiner]
US 9854331B2 · Winograd · 2017 [cited by applicant]
US 9854332B2 · Winograd · 2017 [cited by applicant]
US 10282564B2 · Gladwin · 2019 [cited by applicant]
US 10891400B2 · Gladwin · 2021 [cited by applicant]
US 11366939B1 · Gladwin · 2022 [cited by applicant]
US 20020002675A1 · Bush · 2002 [cited by applicant]
US 20020003881A1 · Reitmeier · 2002 [cited by applicant]
US 20020046359A1 · Boden · 2002 [cited by applicant]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020078227A1 · Kronenberg · 2002 [cited by applicant]
US 20020095590A1 · Douceur · 2002 [cited by applicant]
US 20020140991A1 · Li · 2002 [cited by examiner]
US 20020166079A1 · Ulrich · 2002 [cited by applicant]
US 20020194570A1 · Birru · 2002 [cited by applicant]
US 20030002665A1 · Sako · 2003 [cited by applicant]
US 20030012372A1 · Cheng · 2003 [cited by applicant]
US 20030018927A1 · Gadir · 2003 [cited by applicant]
US 20030028879A1 · Gordon · 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 20030123664A1 · Pedlow · 2003 [cited by applicant]
US 20040008794A1 · McClellan · 2004 [cited by examiner]
US 20040012486A1 · Mani · 2004 [cited by applicant]
US 20040015723A1 · Pham · 2004 [cited by applicant]
US 20040015724A1 · Pham · 2004 [cited by applicant]
US 20040024963A1 · Talagala · 2004 [cited by applicant]
US 20040052378A1 · Shiragami · 2004 [cited by examiner]
US 20040062307A1 · Hallapuro · 2004 [cited by examiner]
US 20040117718A1 · Manasse · 2004 [cited by applicant]
US 20040122917A1 · Menon · 2004 [cited by applicant]
US 20040145661A1 · Murakami · 2004 [cited by applicant]
US 20040172549A1 · Kojima · 2004 [cited by applicant]
US 20040215998A1 · Buxton · 2004 [cited by applicant]
US 20040228493A1 · Ma · 2004 [cited by applicant]
US 20050002531A1 · Michaelsen · 2005 [cited by applicant]
US 20050071659A1 · Ferguson · 2005 [cited by applicant]
US 20050089234A1 · Base · 2005 [cited by applicant]
US 20050100022A1 · Ramprashad · 2005 [cited by applicant]
US 20050114594A1 · Corbett · 2005 [cited by applicant]
US 20050123271A1 · Ichinose · 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 20050144283A1 · Fatula · 2005 [cited by applicant]
US 20050144382A1 · Schmisseur · 2005 [cited by applicant]
US 20050165972A1 · Miyata · 2005 [cited by applicant]
US 20050229069A1 · Hassner · 2005 [cited by applicant]
US 20050265349A1 · Garg · 2005 [cited by applicant]
US 20060026295A1 · Iwamura · 2006 [cited by applicant]
US 20060047907A1 · Shiga · 2006 [cited by applicant]
US 20060056519A1 · Horowitz · 2006 [cited by applicant]
US 20060069719A1 · McCanne · 2006 [cited by applicant]
US 20060069964A1 · Hayashi · 2006 [cited by applicant]
US 20060129801A1 · Kang · 2006 [cited by applicant]
US 20060136448A1 · Cialini · 2006 [cited by applicant]
US 20060156059A1 · Kitamura · 2006 [cited by applicant]
US 20060177061A1 · Orsini · 2006 [cited by applicant]
US 20060212782A1 · Li · 2006 [cited by applicant]
US 20060224603A1 · Correll, Jr. · 2006 [cited by applicant]
US 20060265436A1 · Edmond · 2006 [cited by applicant]
US 20060281487A1 · Girardeau, Jr. · 2006 [cited by applicant]
US 20070016802A1 · Wingert · 2007 [cited by applicant]
US 20070067332A1 · Gallagher · 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 20070100913A1 · Sumner · 2007 [cited by applicant]
US 20070118731A1 · Zizzi · 2007 [cited by applicant]
US 20070150481A1 · Song · 2007 [cited by applicant]
US 20070160198A1 · Orsini · 2007 [cited by applicant]
US 20070168843A1 · Kanaoka · 2007 [cited by examiner]
US 20070174192A1 · Gladwin · 2007 [cited by applicant]
US 20070214285A1 · Au · 2007 [cited by applicant]
US 20070226145A1 · Ishigaki · 2007 [cited by applicant]
US 20070234110A1 · Soran · 2007 [cited by applicant]
US 20070263864A1 · Buchen · 2007 [cited by applicant]
US 20070266446A1 · Aaron · 2007 [cited by applicant]
US 20070283167A1 · Venters · 2007 [cited by applicant]
US 20070291940A1 · Candelore · 2007 [cited by applicant]
US 20080010218A1 · Zank · 2008 [cited by applicant]
US 20080049930A1 · You · 2008 [cited by applicant]
US 20080126357A1 · Casanova · 2008 [cited by applicant]
US 20080140724A1 · Flynn · 2008 [cited by applicant]
US 20080147821A1 · Dietrich · 2008 [cited by applicant]
US 20080183992A1 · Martin · 2008 [cited by applicant]
US 20080192936A1 · Bellwood · 2008 [cited by applicant]
US 20080222480A1 · Huang · 2008 [cited by applicant]
US 20080222481A1 · Huang · 2008 [cited by applicant]
US 20080244404A1 · Li · 2008 [cited by applicant]
US 20080250296A1 · Borri · 2008 [cited by examiner]
US 20080263113A1 · Krishnaiyer · 2008 [cited by applicant]
US 20080320151A1 · McCanne · 2008 [cited by applicant]
US 20090041235A1 · Reitmeier · 2009 [cited by applicant]
US 20090055547A1 · Hudson · 2009 [cited by applicant]
US 20090063934A1 · Jo · 2009 [cited by examiner]
US 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20090119515A1 · Nicolson · 2009 [cited by applicant]
US 20090125671A1 · Flynn · 2009 [cited by applicant]
US 20090182934A1 · Kim · 2009 [cited by examiner]
US 20090287956A1 · Flynn · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20100042583A1 · Gervais · 2010 [cited by applicant]
US 20100135384A1 · Berkvens · 2010 [cited by applicant]
US 20100172496A1 · Furukawa · 2010 [cited by applicant]
US 20100199089A1 · Vysogorets · 2010 [cited by applicant]
US 20100211737A1 · Flynn · 2010 [cited by applicant]
US 20100250497A1 · Redlich · 2010 [cited by applicant]
US 20100266122A1 · Suzaki · 2010 [cited by applicant]
US 20100293440A1 · Thatcher · 2010 [cited by applicant]
US 20110060887A1 · Thatcher et al. · 2011 [cited by applicant]
US 20110106904A1 · Resch · 2011 [cited by applicant]
US 20110145584A1 · Coburn · 2011 [cited by applicant]
US 20110161754A1 · Baptist · 2011 [cited by applicant]
US 20120011340A1 · Flynn · 2012 [cited by applicant]
US 20120066517A1 · Vysogorets · 2012 [cited by applicant]
US 20120066752A1 · Vysogorets · 2012 [cited by applicant]
US 20120066756A1 · Vysogorets · 2012 [cited by applicant]
US 20120066757A1 · Vysogorets et al. · 2012 [cited by applicant]
US 20120198302A1 · Otterstedt · 2012 [cited by applicant]
US 20120311403A1 · Gladwin · 2012 [cited by applicant]
US 20140245063A1 · Baptist · 2014 [cited by applicant]
US 20170031752A1 · Cilfone · 2017 [cited by applicant]
US 20200042381A1 · Hegde · 2020 [cited by applicant]
Aschenbrenner et al., Infrastructure for Interactivity—Decoupled Systems on the Loose, 2009, IEEE. [cited by applicant]
Bellare et al., Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals, Nov. 2007, ACM. [cited by applicant]
Bian, JigDFS: A Secure Distributed File System, 2009. [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]
Jensen et al., Resilia: a Safe and Secure Distributed Backup System for Small and Medium Enterprises, 2007, Springer. [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]
Schuman et al., A Performance Comparison of Open-Source Erasure Coding Libraries for Storage Applications, Aug. 2008, University of Tennessee. [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]
Storer et al., Long-Term Threats to Secure Archives, Oct. 2006, ACM. [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]
U.S. Appl. No. 61/221,762, filed Jun. 30, 2009; Leggette, et al. [cited by applicant]
U.S. Appl. No. 61/256,193, filed Oct. 29, 2009; Markison, et al. [cited by applicant]