The field of technology is data processing, or, more specifically, methods, apparatuses, and products for preventing duplicate entries of identical data in a storage device.
Data centers may include many computing components including servers, network devices, and storage arrays. Such storage arrays may include hard disk drives (‘HDDs’), solid-state drives (‘SSDs’), or other storage devices. To preserve the storage devices and more efficiently utilize the finite amount of storage in a storage array, data deduplication techniques may be implemented to eliminate duplicate copies of repeating data. Traditional data deduplication techniques, however, require large amounts of overhead in memory utilization and input/output (‘I/O’) operations.
Methods, apparatus, and products for preventing duplicate entries of identical data in a storage device, including: receiving a write request to write data to the storage device; calculating one or more signatures for the data associated with the write request; determining whether any of the calculated signatures match a calculated signature contained in a recently read signature buffer, each entry in the recently read signature buffer associating a calculated signature for data that has been read with an address of a storage location within the storage device where the data is stored; and responsive to determining that one of the calculated signatures matches a calculated signature contained in the recently read signature buffer, determining whether the data associated with the calculated signature is a duplicate of data stored at a particular address that is associated with the calculated signature contained in the recently read signature buffer.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of example embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of example embodiments of the invention.
Example methods, apparatuses, and products for preventing duplicate entries of identical data in a storage device in accordance with the present invention are described with reference to the accompanying drawings, beginning with
The computing devices (164, 166, 168, 170) in the example of
The local area network (160) of
The example storage arrays (102, 104) of
Each storage array controller (106, 112) may be implemented in a variety of ways, including as a Field Programmable Gate Array (‘FPGA’), a Programmable Logic Chip (‘PLC’), an Application Specific Integrated Circuit (‘ASIC’), or computing device that includes discrete components such as a central processing unit, computer memory, and various adapters. Each storage array controller (106, 112) may include, for example, a data communications adapter configured to support communications via the SAN (158) and the LAN (160). Although only one of the storage array controllers (112) in the example of
Each NVRAM device (148, 152) may be configured to receive, from the storage array controller (106, 112), data to be stored in the storage devices (146). Such data may originate from any one of the computing devices (164, 166, 168, 170). In the example of
A ‘storage device’ as the term is used in this specification refers to any device configured to record data persistently. The term ‘persistently’ as used here refers to a device's ability to maintain recorded data after loss of a power source. Examples of storage devices may include mechanical, spinning hard disk drives, Solid-state drives (e.g., “Flash drives”), and the like.
The storage array controllers (106, 112) of
The arrangement of computing devices, storage arrays, networks, and other devices making up the example system illustrated in
Preventing duplicate entries of identical data in a storage device in accordance with embodiments of the present invention is generally implemented with computers. In the system of
The storage array controller (202) of
The storage array controller (202) of
Stored in RAM (214) is an operating system (246). Examples of operating systems useful in storage array controllers (202) configured for preventing duplicate entries of identical data in a storage device according to embodiments of the present invention include UNIX™ Linux™, Microsoft Windows™, and others as will occur to those of skill in the art. Also stored in RAM (236) is an array management module (248), a module that includes computer program instructions for preventing duplicate entries of identical data in a storage device according to embodiments of the present invention. The functionality of the array management module (248) will be described in greater detail below, but readers will appreciate that while the array management module (248) and the operating system (246) in the example of
The storage array controller (202) of
The storage array controller (202) of
The storage array controller (202) of
The storage array controller (202) of
Readers will recognize that these components, protocols, adapters, and architectures are for illustration only, not limitation. Such a storage array controller may be implemented in a variety of different ways, each of which is well within the scope of the present invention.
For further explanation,
The example method depicted in
The example method depicted in
The example method depicted in
Readers will appreciate that multiple signatures (316) for the data (308) may be generated not only by applying multiple hash functions to the same data (308), but multiple signatures (316) for the data (308) may also be generated by applying one or more hash functions to different portions of the data (308). Consider an example in which the data (308) includes 4 kilobytes (‘KBs’). In such an example, a hash function may be applied to all 4 KBs to generate a first signature, a hash function may be applied to the first 512 bytes only to generate a second signature, a hash function may be applied to the last 512 bytes only to generate a third signature, a hash function may be applied to a middle 512 bytes only to generate a fourth signature, and so on. Readers will appreciate that the decision to apply multiple hash functions to data, to segment the data into a plurality of portions (which may or may not overlap), or any combination thereof are all design decisions that are well within the scope of the present disclosure.
The example method depicted in
In the example method depicted in
If the deduplication module (310) determines that the calculated signatures (316) for the data (308) associated with the write request (306) does (338) match one or more of the a calculated signatures (320, 322, 324, 326) contained in a recently read signature buffer (318), the deduplication module (310) can determine (340) whether the data (308) associated with the calculated signature (316) is a duplicate of data stored at a particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318). Determining (340) whether the data (308) associated with the calculated signature (316) is a duplicate of data stored at a particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318) may be carried out, for example, by obtaining the data that is stored at the particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318) and performing a bit-by-bit comparison of the retrieved data to the data (308) associated with the calculated signature (316).
Determining (340) whether the data (308) associated with the calculated signature (316) is a duplicate of data stored at a particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318) can be carried out in response to affirmatively (338) determining that one of the calculated signatures (316) matches a calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318). Readers will appreciate that affirmatively (338) determining that one of the calculated signatures (316) matches a calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318) may only be indicative that the data (308) associated with the calculated signature (316) may be a duplicate of data stored at a particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318). For example, if a particular hash function is used that is relatively weak, but relatively quick to perform, collisions may occur where distinct data results in the same hash value. As such, in order to definitively determine whether the data (308) associated with the calculated signature (316) is a duplicate of data stored at a particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318), the data (308) associated with the calculated signature (316) and the data stored at a particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318) must actually be compared.
In response to affirmatively (344) determining that the data (308) associated with the write request (306) is a duplicate of data stored at a particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318), a reference (348) to the particular address (328, 330, 332, 334) is returned. The reference (348) to the particular address (328, 330, 332, 334) where data is stored that is a duplicate of the data (308) associated with the write request (306) may be embodied, for example, as a pointer to the particular address (328, 330, 332, 334) where data is stored that is a duplicate of the data (308) associated with the write request (306), as the particular address (328, 330, 332, 334) itself where data is stored that is a duplicate of the data (308) associated with the write request (306), and so on. In the example method depicted in
In response to determining that the data (308) associated with the write request (306) is not (350) a duplicate of data stored at a particular address (328, 330, 332, 334) that is associated with the calculated signature (320, 322, 324, 326) contained in the recently read signature buffer (318), the write request (306) is forwarded (352) to the storage device (360, 362, 364). The write request (306) may be forwarded (352) to the storage device (360, 362, 364) so that the storage device (360, 362, 364) can service the write request (306). Readers will appreciate that forwarding (352) the write request (306) to the storage device (360, 362, 364) does not necessarily result in the data (308) associated with the write request (306) being written to the storage device (360, 362, 364). The data (308) associated with the write request (306) may not ultimately be written to the storage device (360, 362, 364) because a controller or other form of computer logic may determine that some data, already stored in the storage device (360, 362, 364) but not reflected in the recently read signature buffer (318), matches the data (308) associated with the write request (306). Readers will further appreciate that the data (308) associated with the write request (306) may undergo further processing prior to forwarding (352) the write request (306) to the storage device (360, 362, 364). For example, the data (308) associated with the write request (306) may be compressed, encrypted, or otherwise processed according to various design decisions that are each within the scope of the present disclosure.
Although the example described above makes reference to preventing duplicate entries of identical data in a storage device (360, 362, 364), readers will appreciate that the steps described above can be applied to a single storage device and also applied to multiple storage devices, such as all of the storage devices (360, 362, 364) in the storage device array (358). Preventing duplicate entries of identical data across all storage devices (360, 362, 364) in the storage device array (358) may be carried out, for example, through the use of an addressing scheme where the addresses in each storage device (360, 362, 364) are unique, by associating a device identifier with the addresses (328, 330, 332, 334) stored in the recently read signature buffer (318) if the addresses in each storage device are not unique, and so on. Because the deduplication module (310) may reside on a storage array controller that facilitates accesses to all storage devices (360, 362, 364) in the storage device array (358), the deduplication module (310) may be configured to maintain a recently read signature buffer (318) that includes information describing data read from all storage devices (360, 362, 364) in the storage device array (358). In the event that redundant storage array controllers facilitate accesses to all storage devices (360, 362, 364) in the storage device array (358), the storage array controllers may be configured to communicate with each other to maintain a recently read signature buffer (318) that includes information describing data read from all storage devices (360, 362, 364) in the storage device array (358).
For further explanation,
The example method depicted in
The example method depicted in
The example method depicted in
In the example method depicted in
In response to affirmatively (414) determining that the calculated signature (408) for the stored data (402) matches calculated signature in an entry of the recently read signature buffer (318), the entry in the recently read signature buffer (318) may be refreshed (416). Refreshing (416) the entry in the recently read signature buffer (318) that matches the calculated signature (408) for the stored data (402) may be carried out, for example, by updating a timestamp identifying the time at which the stored data (402) was retrieved (404) in response to a read request. In an alternative embodiment where the recently read signature buffer (318) is sorted, for example, such that older entries appear at the front of the recently read signature buffer (318) and newer entries appear at the back recently read signature buffer (318), refreshing (416) the entry in the recently read signature buffer (318) that matches the calculated signature (408) for the stored data (402) may be carried out by moving the entry to a location within the recently read signature buffer (318) that is designated for newer entries. Readers will appreciate that the recently read signature buffer (318) may be organized in other ways and that refreshing (416) the entry in the recently read signature buffer (318) that matches the calculated signature (408) for the stored data (402) may be carried in accordance with any corresponding organization policy. Furthermore, refreshing (416) the entry in the recently read signature buffer (318) that matches the calculated signature (408) for the stored data (402) might only be carried out for a subset of situations in which the calculated signature (408) for the stored data (402) is affirmatively (414) determined to match a calculated signature in an entry of the recently read signature buffer (318), as retaining the original signature may be preferable in certain circumstances.
For further explanation,
In the example method depicted in
In the example method depicted in
For further explanation,
The example method depicted in
The example method depicted in
In the example method depicted in
The example method depicted in
Example embodiments of the present invention are described largely in the context of a fully functional computer system. Readers of skill in the art will recognize, however, that the present invention also may be embodied in a computer program product disposed upon computer readable media for use with any suitable data processing system. Such computer readable storage media may be any transitory or non-transitory media. Examples of such media include storage media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of such media also include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a computer program product. Persons skilled in the art will recognize also that, although some of the example embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware, as hardware, or as an aggregation of hardware and software are well within the scope of embodiments of the present invention.
It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present invention without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present invention is limited only by the language of the following claims.
This application is a continuation application of and claims priority from U.S. patent application Ser. No. 14/722,249, filed May 27, 2015.
Number | Name | Date | Kind |
---|---|---|---|
5706210 | Kumano et al. | Jan 1998 | A |
5799200 | Brant et al. | Aug 1998 | A |
5933598 | Scales et al. | Aug 1999 | A |
6012032 | Donovan et al. | Jan 2000 | A |
6085333 | DeKoning et al. | Jul 2000 | A |
6643641 | Snyder | Nov 2003 | B1 |
6647514 | Umberger et al. | Nov 2003 | B1 |
6789162 | Talagala et al. | Sep 2004 | B1 |
7089272 | Garthwaite et al. | Aug 2006 | B1 |
7107389 | Inagaki et al. | Sep 2006 | B2 |
7146521 | Nguyen | Dec 2006 | B1 |
7334124 | Pham et al. | Feb 2008 | B2 |
7437530 | Rajan | Oct 2008 | B1 |
7493424 | Bali et al. | Feb 2009 | B1 |
7669029 | Mishra et al. | Feb 2010 | B1 |
7689609 | Lango et al. | Mar 2010 | B2 |
7743191 | Liao | Jun 2010 | B1 |
7899780 | Shmuylovich et al. | Mar 2011 | B1 |
8042163 | Karr et al. | Oct 2011 | B1 |
8086585 | Brashers et al. | Dec 2011 | B1 |
8271700 | Annem et al. | Sep 2012 | B1 |
8387136 | Lee et al. | Feb 2013 | B2 |
8437189 | Montierth et al. | May 2013 | B1 |
8465332 | Hogan et al. | Jun 2013 | B2 |
8527544 | Colgrove et al. | Sep 2013 | B1 |
8566546 | Marshak et al. | Oct 2013 | B1 |
8578442 | Banerjee | Nov 2013 | B1 |
8613066 | Brezinski et al. | Dec 2013 | B1 |
8620970 | English et al. | Dec 2013 | B2 |
8751463 | Chamness | Jun 2014 | B1 |
8762642 | Bates et al. | Jun 2014 | B2 |
8769622 | Chang et al. | Jul 2014 | B2 |
8800009 | Beda, III et al. | Aug 2014 | B1 |
8812860 | Bray | Aug 2014 | B1 |
8850546 | Field et al. | Sep 2014 | B1 |
8898346 | Simmons | Nov 2014 | B1 |
8909854 | Yamagishi et al. | Dec 2014 | B2 |
8931041 | Banerjee | Jan 2015 | B1 |
8949863 | Coatney et al. | Feb 2015 | B1 |
8984602 | Bailey et al. | Mar 2015 | B1 |
8990905 | Bailey et al. | Mar 2015 | B1 |
9124569 | Hussain et al. | Sep 2015 | B2 |
9134922 | Rajagopal et al. | Sep 2015 | B2 |
9209973 | Aikas et al. | Dec 2015 | B2 |
9250823 | Kamat et al. | Feb 2016 | B1 |
9300660 | Borowiec et al. | Mar 2016 | B1 |
9418011 | Soares | Aug 2016 | B2 |
9444822 | Borowiec et al. | Sep 2016 | B1 |
9507532 | Colgrove et al. | Nov 2016 | B1 |
20020013802 | Mori et al. | Jan 2002 | A1 |
20030145172 | Galbraith et al. | Jul 2003 | A1 |
20030191783 | Wolczko et al. | Oct 2003 | A1 |
20030225961 | Chow et al. | Dec 2003 | A1 |
20040080985 | Chang et al. | Apr 2004 | A1 |
20040111573 | Garthwaite | Jun 2004 | A1 |
20040153844 | Ghose et al. | Aug 2004 | A1 |
20040193814 | Erickson et al. | Sep 2004 | A1 |
20040260967 | Guha et al. | Dec 2004 | A1 |
20050160416 | Jamison | Jul 2005 | A1 |
20050188246 | Emberty et al. | Aug 2005 | A1 |
20050216800 | Bicknell et al. | Sep 2005 | A1 |
20060015771 | Vana Gundy et al. | Jan 2006 | A1 |
20060129817 | Borneman et al. | Jun 2006 | A1 |
20060161726 | Lasser | Jul 2006 | A1 |
20060230245 | Gounares et al. | Oct 2006 | A1 |
20060239075 | Williams et al. | Oct 2006 | A1 |
20070022227 | Miki | Jan 2007 | A1 |
20070028068 | Golding et al. | Feb 2007 | A1 |
20070055702 | Fridella et al. | Mar 2007 | A1 |
20070109856 | Pellicone et al. | May 2007 | A1 |
20070150689 | Pandit et al. | Jun 2007 | A1 |
20070168321 | Saito et al. | Jul 2007 | A1 |
20070220227 | Long | Sep 2007 | A1 |
20070294563 | Bose | Dec 2007 | A1 |
20070294564 | Reddin et al. | Dec 2007 | A1 |
20080005587 | Ahlquist | Jan 2008 | A1 |
20080077825 | Bello et al. | Mar 2008 | A1 |
20080162674 | Dahiya | Jul 2008 | A1 |
20080195833 | Park | Aug 2008 | A1 |
20080270678 | Cornwell et al. | Oct 2008 | A1 |
20080282045 | Biswas et al. | Nov 2008 | A1 |
20090077340 | Johnson et al. | Mar 2009 | A1 |
20090100115 | Park et al. | Apr 2009 | A1 |
20090113136 | Aharonov | Apr 2009 | A1 |
20090198889 | Ito et al. | Aug 2009 | A1 |
20100052625 | Cagno et al. | Mar 2010 | A1 |
20100211723 | Mukaida | Aug 2010 | A1 |
20100246266 | Park et al. | Sep 2010 | A1 |
20100257142 | Murphy et al. | Oct 2010 | A1 |
20100262764 | Liu et al. | Oct 2010 | A1 |
20100325345 | Ohno et al. | Dec 2010 | A1 |
20100332754 | Lai et al. | Dec 2010 | A1 |
20110072290 | Davis et al. | Mar 2011 | A1 |
20110119429 | Tu | May 2011 | A1 |
20110125955 | Chen | May 2011 | A1 |
20110131231 | Haas et al. | Jun 2011 | A1 |
20110167221 | Pangal et al. | Jul 2011 | A1 |
20120023144 | Rub | Jan 2012 | A1 |
20120054264 | Haugh et al. | Mar 2012 | A1 |
20120079318 | Colgrove et al. | Mar 2012 | A1 |
20120131253 | McKnight et al. | May 2012 | A1 |
20120303919 | Hu et al. | Nov 2012 | A1 |
20120311000 | Post et al. | Dec 2012 | A1 |
20130007845 | Chang et al. | Jan 2013 | A1 |
20130031414 | Dhuse et al. | Jan 2013 | A1 |
20130036272 | Nelson | Feb 2013 | A1 |
20130071087 | Motiwala et al. | Mar 2013 | A1 |
20130145447 | Maron | Jun 2013 | A1 |
20130191555 | Liu | Jul 2013 | A1 |
20130198459 | Joshi et al. | Aug 2013 | A1 |
20130205173 | Yoneda | Aug 2013 | A1 |
20130219164 | Hamid | Aug 2013 | A1 |
20130227201 | Talagala et al. | Aug 2013 | A1 |
20130227209 | Czerkowicz | Aug 2013 | A1 |
20130290607 | Chang et al. | Oct 2013 | A1 |
20130311434 | Jones | Nov 2013 | A1 |
20130318297 | Jibbe et al. | Nov 2013 | A1 |
20130332614 | Brunk et al. | Dec 2013 | A1 |
20140020083 | Fetik | Jan 2014 | A1 |
20140074850 | Noel et al. | Mar 2014 | A1 |
20140082715 | Grajek et al. | Mar 2014 | A1 |
20140086146 | Kim et al. | Mar 2014 | A1 |
20140090009 | Li et al. | Mar 2014 | A1 |
20140096220 | Da Cruz Pinto et al. | Apr 2014 | A1 |
20140101434 | Senthurpandi et al. | Apr 2014 | A1 |
20140164774 | Nord et al. | Jun 2014 | A1 |
20140173232 | Reohr et al. | Jun 2014 | A1 |
20140195636 | Karve et al. | Jul 2014 | A1 |
20140201512 | Seethaler et al. | Jul 2014 | A1 |
20140201541 | Paul et al. | Jul 2014 | A1 |
20140207743 | Quinn | Jul 2014 | A1 |
20140208155 | Pan | Jul 2014 | A1 |
20140215590 | Brand | Jul 2014 | A1 |
20140229654 | Goss et al. | Aug 2014 | A1 |
20140230017 | Saib | Aug 2014 | A1 |
20140258526 | Le Sant et al. | Sep 2014 | A1 |
20140282983 | Ju et al. | Sep 2014 | A1 |
20140285917 | Cudak et al. | Sep 2014 | A1 |
20140325262 | Cooper et al. | Oct 2014 | A1 |
20140351627 | Best et al. | Nov 2014 | A1 |
20140373104 | Gaddam et al. | Dec 2014 | A1 |
20140373126 | Hussain et al. | Dec 2014 | A1 |
20150019797 | Huang | Jan 2015 | A1 |
20150026387 | Sheredy et al. | Jan 2015 | A1 |
20150074463 | Jacoby et al. | Mar 2015 | A1 |
20150089569 | Sondhi et al. | Mar 2015 | A1 |
20150095515 | Krithivas et al. | Apr 2015 | A1 |
20150113203 | Dancho et al. | Apr 2015 | A1 |
20150121137 | McKnight et al. | Apr 2015 | A1 |
20150134920 | Anderson et al. | May 2015 | A1 |
20150149822 | Coronado et al. | May 2015 | A1 |
20150193169 | Sundaram et al. | Jul 2015 | A1 |
20150339060 | Shin | Nov 2015 | A1 |
20150378888 | Zhang et al. | Dec 2015 | A1 |
20160098323 | Mutha et al. | Apr 2016 | A1 |
20160350009 | Cerreta et al. | Dec 2016 | A1 |
20160352720 | Hu et al. | Dec 2016 | A1 |
20160352830 | Borowiec et al. | Dec 2016 | A1 |
20160352834 | Borowiec et al. | Dec 2016 | A1 |
Number | Date | Country |
---|---|---|
0725324 | Aug 1996 | EP |
WO-2012087648 | Jun 2012 | WO |
WO2013071087 | May 2013 | WO |
WO-2014110137 | Jul 2014 | WO |
WO-2016015008 | Dec 2016 | WO |
WO-2016190938 | Dec 2016 | WO |
WO-2016195759 | Dec 2016 | WO |
WO-2016195958 | Dec 2016 | WO |
WO-2016195961 | Dec 2016 | WO |
Entry |
---|
Paul Sweere, Creating Storage Class Persistent Memory with NVDIMM, Published in Aug. 2013, Flash Memory Summit 2013, <http://ww.flashmemorysummit.com/English/Collaterals/Proceedings/2013/20130814_T2_Sweere.pdf>, 22 pages. |
PCMag. “Storage Array Definition”. Published May 10, 2013. <http://web.archive.org/web/20130510121646/http://www.pcmag.com/encyclopedia/term/52091/storage-array>, 2 pages. |
Google Search of “storage array define” on Nov. 4, 2015 for U.S. Appl. No. 14/725,278, Results limited to entries dated before 2012, 1 page. |
Techopedia. “What is a disk array”. Published Jan. 13, 2012. <http://web.archive.org/web/20120113053358/http://www.techopedia.com/definition/1009/disk-array>, 1 page. |
Webopedia. “What is a disk array”. Published May 26, 2011. <http://web/archive.org/web/20110526081214/http://www.webopedia.com/TERM/D/disk_array.html>, 2 pages. |
Li et al., Access Control for the Services Oriented Architecture, Proceedings of the 2007 ACM Workshop on Secure Web Services (SWS '07), Nov. 2007, pp. 9-17, ACM New York, NY. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/015006, dated Apr. 29, 2016, 12 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/015008, dated May 4, 2016, 12 pages. |
C. Hota et al., Capability-based Cryptographic Data Access Control in Cloud Computing, Int. J. Advanced Networking and Applications, col. 1, Issue 1, dated Aug. 2011, 10 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/020410, dated Jul. 8, 2016, 17 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/032084, dated Jul. 18, 2016, 12 pages. |
Faith, “dictzip file format”, GitHub.com (online). [Accessed Jul. 28, 2015], 1 page, URL: https://github.com/fidlej/idzip. |
Wikipedia, “Convergent Encryption”, Wikipedia.org (online), accessed Sep. 8, 2015, 2 pages, URL: en.wikipedia.org/wiki/Convergent_encryption. |
Storer et al., “Secure Data Deduplication”, Proceedings of the 4th ACM International Workshop on Storage Security and Survivability (StorageSS'08), Oct. 2008, 10 pages, ACM New York, NY. USA. DOI: 10.1145/1456469.1456471. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/016333, dated Jun. 8, 2016, 12 pages. |
ETSI, Network Function Virtualisation (NFV); Resiliency Requirements, ETSI GS NFCV-REL 001, V1.1.1, http://www.etsi.org/deliver/etsi_gs/NFV-REL/001_099/001/01.01.01_60/gs_NFV-REL001v010101p.pdf (online), dated Jan. 2015, 82 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/032052, dated Aug. 30, 2016, 17 pages. |
Microsoft, “Hybrid for SharePoint Server 2013—Security Reference Architecture”, <http://hybrid.office.com/img/Security_Reference_Architecture.pdf> (online), dated Oct. 2014, 53 pages. |
Microsoft, “Hybrid Identity”, <http://aka.ms/HybridIdentityWp> (online), dated Apr. 2014, 36 pages. |
Microsoft, “Hybrid Identity Management”, <http://download.microsoft.com/download/E/A/E/EAE57CD1-A80B-423C-96BB-142FAAC630139/Hybrid_Identity_Datasheet.pdf> (online), published Apr. 2014, 17 pages. |
Jacob Bellamy-McIntyre et al., “OpenID and the Enterprise: A Model-based Analysis of Single Sign-On Authentication”, 2011 15th IEEE International Enterprise Distributed Object Computing Conference (EDOC), DOI: 10.1109/EDOC.2011.26, ISBN: 978-1-4577-0362-1, <https://www.cs.auckland.ac.nz/˜lutteroth/publications/McIntyreLutterothWeber2011-OpenID.pdf> (online), dated Aug. 29, 2011, 10 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/035492, dated Aug. 17, 2016, 10 pages. |
Kong, Using PCI Express As The Primary System Interconnect In Multiroot Compute, Storage, Communications and Embedded Systems, White Paper, IDT.com (online), Aug. 28, 2008, 12 pages, URL: www.idt.com/document/whp/idt-pcie-multi-root-white-paper. |
Hu et al., Container Marking: Combining Data Placement, Garbage Collection and Wear Levelling for Flash, 19th Annual IEEE International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunications Systems, Jul. 25-27, 2011, 11 pages, ISBN: 978-0-7695-4430-4, DOI: 10.1109/MASCOTS.2011.50. |
International Search Report and Written Opinion, PCT/US2016/036693, dated Aug. 29, 2016, 10 pages. |
International Search Report and Written Opinion, PCT/US2016/038758, dated Oct. 7, 2016, 10 pages. |
International Search Report and Written Opinion, PCT/US2016/040393, dated Sep. 22, 2016, 10 pages. |
International Search Report and Written Opinion, PCT/US2016/044020, dated Sep. 30, 2016, 11 pages. |
International Search Report and Written Opinion, PCT/US2016/044874, dated Oct. 7, 2016, 11 pages. |
International Search Report and Written Opinion, PCT/US2016/044875, dated Oct. 5, 2016, 13 pages. |
International Search Report and Written Opinion, PCT/US2016/044876, dated Oct. 21, 2016, 12 pages. |
International Search Report and Written Opinion, PCT/US2016/044877, dated Sep. 29, 2016, 13 pages. |
Number | Date | Country | |
---|---|---|---|
Parent | 14722249 | May 2015 | US |
Child | 15418253 | US |