IP Library Granted Patent US 12,259,990
Granted Patent B2
US 12,259,990 · App. 18/344,040 · Granted Mar 25, 2025

Mitigating data loss in a storage network

Inventors: Teague S. Algie (Chicago, IL); Jason K. Resch (Warwick, RI)
Assignee: Pure Storage, Inc.
G06F21/6218G06F3/0604G06F3/0622G06F3/0647G06F3/067G06F11/1076G06F11/1088G06F21/552G06F21/554G06F21/64H04L9/085H04L9/0891H04L9/0894H04L63/10H04L67/1097H04W12/082H04W12/65
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,259,990
App. No.
18/344,040
Granted
Mar 25, 2025
Kind
B2
Abstract

A method for execution by a storage network starts by maintaining loading and data access rate information for a storage node and estimating a future data access rate for the storage node. The method continues by determining a probability level of potential future data loss, based on the estimated future data access rate and in response to a determination that the probability level of potential future data loss compares unfavorably to a maximum probability of data loss threshold level the method continues by facilitating migration of at least a portion of data stored on the storage node for temporary storage in another storage node of the storage network.

Claims (39)

1. A method for execution by a storage network, the method comprises:

maintaining loading and data access rate information for a solid-state storage node of the storage network, wherein the storage network includes a plurality of solid-state storage nodes and wherein a data object stored in the storage network is dispersed error encoded in accordance with dispersed error encoding parameters to produce a plurality of encoded data slices for storage in different ones of the plurality of storage nodes, wherein the plurality of storage nodes includes the solid-state storage node;

estimating a future data access rate for the solid-state storage node;

determining a probability level of potential future data loss, based on the estimated future data access rate and a data access tasks maximum for the solid-state storage node; and

in response to a determination that the probability level of potential future data loss compares unfavorably to a predetermined maximum probability of data loss threshold level, facilitating migration of at least a portion of data stored on the solid-state storage node to another storage node of the storage network for temporary storage.

2. The method of claim 1 , further comprising:

suspending, upon the probability level of potential future data loss comparing unfavorably to a maximum probability of data loss threshold level, the execution of one or more ongoing data access tasks for the storage node.

3. The method of claim 2 , wherein the data is stored as sets of encoded data slices and the suspending includes one or more of: storing fewer slices of each set of newly stored encoded data slices, or prioritizing data access tasks.

4. The method of claim 1 , wherein the estimated future data access rate is based on write data access and maintenance tasks associated with the s storage node.

5. The method of claim 1 , wherein the estimated future data access rate is based on write data access and an elapsed time for data stored in the storage node.

6. The method of claim 1 , wherein the estimated future data access rate is generated based on one or more of: storage node loading information, interpreting a task queue, interpreting current loading rates, interpreting a schedule, or interpreting a message.

7. The method of claim 1 , wherein the determining includes at least one of: estimating a future capacity for execution of maintenance tasks or estimating a data retrieval reliability level.

8. The method of claim 1 , wherein the data is stored as sets of encoded data slices and the facilitating includes one or more of: storing additional encoded data slices of each set of newly stored encoded data slices, prioritizing maintenance tasks, or a de-prioritizing data access tasks.

9. The method of claim 8 , wherein the storing additional slices of each set of newly stored encoded data slices includes increasing a write threshold number.

10. The method of claim 8 , wherein the storing additional slices of each set of newly stored encoded data slices includes decreasing a read threshold number.

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

an interface;

a local memory; and

a processing module operably coupled to the interface and the local memory, wherein the processing module functions to:

maintain loading and data access rate information for a solid-state storage node of the storage network, wherein the storage network includes a plurality of solid-state storage nodes and wherein a data object stored in the storage network is dispersed error encoded in accordance with dispersed error encoding parameters to produce a plurality of encoded data slices for storage in different ones of the plurality of storage nodes, wherein the plurality of storage nodes includes the solid-state storage node;

estimate a future data access rate for the solid-state storage node;

determine a probability level of potential future data loss, based on the estimated future data access rate and a data access tasks maximum for the solid-state storage node; and

in response to a determination that the probability level of potential future data loss compares unfavorably to a predetermined maximum probability of data loss threshold level, suspend, upon a current data access task rate being greater than a maximum task rate level, facilitate execution of a preventative data loss mitigation process.

12. The computing device of claim 11 , wherein the data is stored as sets of encoded data slices and the suspending includes one or more of: storing fewer slices of each set of newly stored encoded data slices, or prioritizing data access tasks.

13. The computing device of claim 11 , wherein the estimated future data access rate is based on write data access and maintenance tasks associated with the storage node.

14. The computing device of claim 11 , wherein the estimated future data access rate is based on write data access and an elapsed time for data stored in the storage node.

15. The computing device of claim 11 , wherein the estimated future data access rate is generated based on one or more of: storage node loading information, interpreting a task queue, interpreting current loading rates, interpreting a schedule, or interpreting a message.

16. The computing device of claim 11 , wherein the determining includes at least one of: estimating a future capacity for execution of maintenance tasks or estimating a data retrieval reliability level.

17. The computing device of claim 11 , wherein the data is stored as sets of encoded data slices and the facilitating includes one or more of: storing additional encoded data slices of each set of newly stored encoded data slices, prioritizing maintenance tasks, or a de-prioritizing data access tasks.

18. The computing device of claim 17 , wherein the processing module functions to store additional slices of each set of newly stored encoded data slices by increasing a write threshold number.

19. The computing device of claim 18 , wherein the processing module functions to store additional slices of each set of newly stored encoded data slices by decreasing a read threshold number.

20. A system comprises:

an interface;

a local memory; and

a processing module operably coupled to the interface and the local memory, wherein the processing module functions to:

maintain loading and data access rate information for a solid-state storage node of a storage network, wherein data is stored as sets of encoded data slices in the storage node;

estimate a future data access rate for the solid-state storage node;

determine a probability level of potential future data loss, based on the estimated future data access rate and a predetermined threshold number of write accesses for the solid-state storage node; and

in response to a determination that the probability level of potential future data loss compares unfavorably to a predetermined maximum probability of data loss threshold level, store additional encoded data slices of each set of any encoded data slices for which a write access task is received by the storage node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 10, 2023
From: ALGIE, TEAGUE S.; RESCH, JASON K.
To: PURE STORAGE, INC.
Reel/Frame 065166/0256 →
Continuity (5)
Continuation 17451917 · Oct 22, 2021
Continuation 16049731 · Jul 30, 2018
Continuation In Part 14986279 · Dec 31, 2015
Provisional Application 62121667 · Feb 27, 2015
Related Publication 20230359755A1 · Nov 9, 2023
References Cited (238)
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 6874092B1 · Motoyama · 2005 [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 7047322B1 · Bauman · 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 7529785B1 · Spertus · 2009 [cited by applicant]
US 7636724B2 · De La Torre · 2009 [cited by applicant]
US 7681104B1 · Sim-Tang · 2010 [cited by applicant]
US 7840992B1 · Dufrene · 2010 [cited by applicant]
US 7984258B2 · Sicola · 2011 [cited by examiner]
US 8019938B2 · Flynn · 2011 [cited by applicant]
US 8516343B2 · Flynn · 2013 [cited by examiner]
US 8548913B2 · Grube · 2013 [cited by applicant]
US 8549518B1 · Aron · 2013 [cited by applicant]
US 8706914B2 · Duchesneau · 2014 [cited by applicant]
US 8805793B2 · Patiejunas · 2014 [cited by applicant]
US 8838539B1 · Ashcraft · 2014 [cited by applicant]
US 8862541B1 · Cox · 2014 [cited by applicant]
US 8880801B1 · Robins · 2014 [cited by examiner]
US 8904229B1 · Veraswamy · 2014 [cited by applicant]
US 8990538B2 · Worthington · 2015 [cited by examiner]
US 9021296B1 · Kiselev · 2015 [cited by applicant]
US 9037921B1 · Brooker · 2015 [cited by examiner]
US 9275063B1 · Natanzon · 2016 [cited by applicant]
US 9485309B2 · Shishkin · 2016 [cited by applicant]
US 9519664B1 · Kharatishvili · 2016 [cited by applicant]
US 9542296B1 · Engers · 2017 [cited by examiner]
US 9547458B2 · Harnik · 2017 [cited by examiner]
US 9552242B1 · Leshinsky · 2017 [cited by applicant]
US 9552254B1 · Franklin · 2017 [cited by applicant]
US 9569455B1 · Bono · 2017 [cited by applicant]
US 9639589B1 · Theimer · 2017 [cited by applicant]
US 9641615B1 · Robins · 2017 [cited by applicant]
US 9652326B1 · Bauer · 2017 [cited by examiner]
US 9772916B2 · Rangasamy · 2017 [cited by applicant]
US 9779015B1 · Oikarinen · 2017 [cited by applicant]
US 9779035B1 · Patiejunas · 2017 [cited by applicant]
US 9785510B1 · Madhavarapu · 2017 [cited by applicant]
US 9792192B1 · Brooker · 2017 [cited by examiner]
US 9817587B1 · Leshinsky · 2017 [cited by applicant]
US 9842117B1 · Zhou · 2017 [cited by applicant]
US 9842227B2 · Eigner · 2017 [cited by applicant]
US 9923970B2 · Bestler · 2018 [cited by applicant]
US 9973215B1 · Sivakumar · 2018 [cited by applicant]
US 10042710B2 · Mutalik · 2018 [cited by applicant]
US 10095578B2 · Resch · 2018 [cited by applicant]
US 10198319B1 · Sieklucki · 2019 [cited by applicant]
US 10241712B1 · Elliott, IV · 2019 [cited by applicant]
US 10264071B2 · Pradeep · 2019 [cited by applicant]
US 10303564B1 · Gupta · 2019 [cited by applicant]
US 10402268B2 · Grube · 2019 [cited by applicant]
US 10469578B2 · Dhuse · 2019 [cited by applicant]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020091965A1 · Moshayedi · 2002 [cited by examiner]
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 20030212519A1 · Campos · 2003 [cited by applicant]
US 20040024963A1 · Talagala · 2004 [cited by applicant]
US 20040122917A1 · Menon · 2004 [cited by applicant]
US 20040153479A1 · Mikesell et al. · 2004 [cited by applicant]
US 20040215998A1 · Buxton · 2004 [cited by applicant]
US 20040228493A1 · Ma · 2004 [cited by applicant]
US 20040252628A1 · Detzler · 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 20050138392A1 · Johnson · 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 20060259949A1 · Schaefer · 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 20070174541A1 · Chandrasekaran · 2007 [cited by applicant]
US 20070214285A1 · Au · 2007 [cited by applicant]
US 20070234110A1 · Soran · 2007 [cited by applicant]
US 20070283167A1 · Venters · 2007 [cited by applicant]
US 20080168135A1 · Redlich · 2008 [cited by applicant]
US 20080172744A1 · Schmidt · 2008 [cited by applicant]
US 20080183975A1 · Foster · 2008 [cited by applicant]
US 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20090216910A1 · Duchesneau · 2009 [cited by applicant]
US 20090307524A1 · Kumano · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20100076805A1 · Batsakis · 2010 [cited by applicant]
US 20100122148A1 · Flynn · 2010 [cited by examiner]
US 20100199089A1 · Vysogorets · 2010 [cited by applicant]
US 20100293439A1 · Flynn · 2010 [cited by examiner]
US 20100306524A1 · Runkis · 2010 [cited by applicant]
US 20100306544A1 · Lionetti · 2010 [cited by applicant]
US 20100332751A1 · Quigley · 2010 [cited by applicant]
US 20110078372A1 · Gladwin · 2011 [cited by applicant]
US 20110173378A1 · Filor · 2011 [cited by examiner]
US 20110197280A1 · Young · 2011 [cited by applicant]
US 20110261813A1 · Baptist · 2011 [cited by applicant]
US 20120054456A1 · Grube · 2012 [cited by applicant]
US 20120079190A1 · Colgrove · 2012 [cited by applicant]
US 20120166611A1 · Kim · 2012 [cited by applicant]
US 20120170435A1 · Trantham · 2012 [cited by examiner]
US 20120233228A1 · Barton · 2012 [cited by applicant]
US 20120243687A1 · Li et al. · 2012 [cited by applicant]
US 20120278579A1 · Goss · 2012 [cited by applicant]
US 20130013931A1 · O'Hare · 2013 [cited by applicant]
US 20130036314A1 · Glew · 2013 [cited by applicant]
US 20130036327A1 · Flynn · 2013 [cited by examiner]
US 20130111462A1 · Umansky · 2013 [cited by applicant]
US 20130204849A1 · Chacko · 2013 [cited by applicant]
US 20130208893A1 · Shablygin · 2013 [cited by applicant]
US 20130227236A1 · Flynn · 2013 [cited by applicant]
US 20130290399A1 · Gordon · 2013 [cited by applicant]
US 20130318392A1 · Guo · 2013 [cited by examiner]
US 20130326284A1 · Losh · 2013 [cited by examiner]
US 20140006797A1 · Cordella · 2014 [cited by applicant]
US 20140007239A1 · Sharpe · 2014 [cited by applicant]
US 20140019683A1 · Ishikawa · 2014 [cited by applicant]
US 20140108474A1 · David · 2014 [cited by applicant]
US 20140136809A1 · Engle · 2014 [cited by applicant]
US 20140143543A1 · Aikas · 2014 [cited by applicant]
US 20140156716A1 · Baptist · 2014 [cited by applicant]
US 20140173268A1 · Hashimoto · 2014 [cited by examiner]
US 20140181363A1 · Hoang · 2014 [cited by examiner]
US 20140201541A1 · Paul · 2014 [cited by applicant]
US 20140207850A1 · Bestler · 2014 [cited by applicant]
US 20140214447A1 · Brooker · 2014 [cited by examiner]
US 20140250300A1 · Runkis · 2014 [cited by applicant]
US 20140283146A1 · Obukhov · 2014 [cited by applicant]
US 20140298135A1 · Dhuse · 2014 [cited by applicant]
US 20140330921A1 · Storm · 2014 [cited by applicant]
US 20140337667A1 · Postage · 2014 [cited by applicant]
US 20150032674A1 · Cichosz · 2015 [cited by applicant]
US 20150067245A1 · Kruger · 2015 [cited by applicant]
US 20150113203A1 · Dancho · 2015 [cited by applicant]
US 20150169419A1 · Carney · 2015 [cited by applicant]
US 20150186411A1 · Iliadis · 2015 [cited by examiner]
US 20150194983A1 · Varanasi · 2015 [cited by applicant]
US 20150234719A1 · Coronado · 2015 [cited by examiner]
US 20150244778A1 · Zhang · 2015 [cited by applicant]
US 20150269023A1 · Taranta, II · 2015 [cited by applicant]
US 20150293986A1 · Verge · 2015 [cited by applicant]
US 20150317223A1 · Cho · 2015 [cited by applicant]
US 20160011816A1 · Aizman · 2016 [cited by applicant]
US 20160057226A1 · Bestler · 2016 [cited by applicant]
US 20160070490A1 · Koarashi · 2016 [cited by examiner]
US 20160110249A1 · Orme · 2016 [cited by examiner]
US 20160147471A1 · O'Hare · 2016 [cited by applicant]
US 20160179403A1 · Kurotsuchi · 2016 [cited by examiner]
US 20160191509A1 · Bestler · 2016 [cited by applicant]
US 20160203479A1 · Durant · 2016 [cited by applicant]
US 20160217823A1 · Arslan · 2016 [cited by examiner]
US 20160231948A1 · Gupta · 2016 [cited by examiner]
US 20160246742A1 · Kimmel · 2016 [cited by applicant]
US 20160253118A1 · Hori · 2016 [cited by examiner]
US 20160277373A1 · Murray · 2016 [cited by applicant]
US 20160371145A1 · Akutsu · 2016 [cited by applicant]
US 20170048021A1 · Yanovsky · 2017 [cited by applicant]
US 20170054592A1 · Olrog · 2017 [cited by examiner]
US 20170075965A1 · Liu · 2017 [cited by applicant]
US 20170077950A1 · Pavlov · 2017 [cited by applicant]
US 20170160941A1 · Baptist · 2017 [cited by applicant]
US 20170264317A1 · Datta · 2017 [cited by applicant]
US 20180024746A1 · Jagadeesh · 2018 [cited by applicant]
US 20180089029A1 · Resch · 2018 [cited by applicant]
US 20180101438A1 · Kazi · 2018 [cited by applicant]
US 20180246793A1 · Jin · 2018 [cited by applicant]
US 20190036648A1 · Yanovsky · 2019 [cited by applicant]
US 20190095101A1 · Leggette · 2019 [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]