Network file system-based data storage system

Details Network file system-based data storage system Network file system-based data storage system

2007-04-19

2010-06-29

Cottingham, John R. (Department: 2167)

Data processing: database and file management or data structures

File or database maintenance

Database recovery

Reexamination Certificate

active

07747581

ABSTRACT:
A network file system-based data storage system that converts random I/O requests into a piecewise sequential data structure to facilitate variable length data segment redundancy identification and elimination. For one embodiment of the invention a stateless network file system is employed. For one such embodiment, that provides multiple-client access to stored data, multiple Writes are buffered and then broken into variable length data segments. Redundant segment elimination is then effected. One embodiment of the invention allows sharing of the variable length data segments among files.

REFERENCES:
patent: 4814746 (1989-03-01), Miller et al.
patent: 5204958 (1993-04-01), Cheng et al.
patent: 5640554 (1997-06-01), Take
patent: 5754888 (1998-05-01), Yang et al.
patent: 5990810 (1999-11-01), Williams
patent: 6032216 (2000-02-01), Schmuck et al.
patent: 6057790 (2000-05-01), Igata et al.
patent: 6148382 (2000-11-01), Bitner et al.
patent: 6343341 (2002-01-01), Cabrera et al.
patent: 6928526 (2005-08-01), Zhu et al.
patent: 6952730 (2005-10-01), Najork et al.
patent: 6961893 (2005-11-01), Mukund et al.
patent: 7093099 (2006-08-01), Bodas et al.
patent: 7136903 (2006-11-01), Phillips et al.
patent: 7143251 (2006-11-01), Patterson
patent: 7260703 (2007-08-01), Moore et al.
patent: 7373464 (2008-05-01), Zhu et al.
patent: 7424498 (2008-09-01), Patterson
patent: 7451168 (2008-11-01), Patterson
patent: 2001/0037323 (2001-11-01), Moulton et al.
patent: 2002/0161860 (2002-10-01), Godlin et al.
patent: 2004/0098415 (2004-05-01), Bone et al.
patent: 2007/0101074 (2007-05-01), Patterson
patent: 2008/0183767 (2008-07-01), Zhu et al.
“Data Domain Delivers Breakthrough Protection and Simplicity in a Cost-Effective, Disk-Based Recovery Appliance”, Jun. 9, 2003, 2 pgs., downloaded from http://www.datadomain.com
ews/press—rel—060903.html on Jan. 26, 2009.
“Data Domain Ships First Recovery Appliance That Combines Massive Data Compression with High Throughput,” Feb. 3, 2004, 2 pgs., downloaded from http://www.datadomain.com
ews/press—rel—020304.html on Jan. 26, 2009.
Jacob Ziv et al., “A Universal Algorithm for Sequential Data Compression,” May 1977, pp. 337-343, IEEE Transactions on Information Theory, vol. IT-23, No. 3.
R. Hugo Patterson et al., “Method and Apparatus for Storing Composite Data Streams,” U.S. Appl. No. 10/779,355, filed Feb. 13, 2004.
Andrei Z. Broder: “Some applications of Rabin's fingerprinting method”, published in R. Capocelli, A. De Santis, U. Vaccaro (eds), Sequences II: Methods in Communications, Security, and Computer Science, Springler-Verlag, 1993.
Matei Ripeanu et al.: “Bloom Filter at http://www.nist.gov/dads/HTML/bloomfilt.html”, Nist Centennial, 2002.
Sean Quinlan et al.: “Venti: a new approach to archival storage”, Proceedings of the FAST 2002 Conference on File and Storage Technologies, Monterey California, 2002.
Athicha Muthitacharoen et al.: “A Low-bandwidth Network File System”, MIT Laboratory for Computer Science and NYU Department of Computer Science.
Udi Manber : “Finding Similar Files in A Large File System”, Department of Computer Science at University of Arizona, 1993.
Sharp, J., and Jagger, J. Microsoft® Visual C#®.NET Step by Step: Version 2003 [online]. Microsoft Press, 2003 [retrieved on Dec. 5, 2006]. Retrieved from the Internet:< URL: http://proquest.safaribooksonline.com/0735619093 > Chapter 13, Section: “How Does the Garbage Collector Run?.”.
M. Burrows et al., “A Block-sorting Lossless Data Compression Algorithm,” SRC Research Report, May 10, 1994, 24 pgs., Digital Equipment Corporation, Palo Alto, California.
L. Peter Deutsch, “GZIP file format specification version 4.3,” Network Working Group, RFC 1952, May 1996, pp. 1-12.
John G. Cleary et al., “Unbounded Length Contexts for PPM,” Proceedings DCC-95, 1995, pp. 1-10, IEEE Computer Society Press.
Non-Final Office Action dated Dec. 27, 2006, U.S. Appl. No. 10/942,174.
Final Office Action dated Jul. 11, 2007, U.S. Appl. No. 10/942,174.
Non-Final Office Action dated Feb. 4, 2008, U.S. Appl. No. 10/942,174.
Final Office Action dated Jun. 17, 2008, U.S. Appl. No. 10/942,174.
Non-Final Office Action dated Sep. 25, 2008, U.S. Appl. No. 10/942,174.
Final Office Action dated Aug. 13, 2009, U.S. Appl. No. 10/942,174.
Notice of Allowance dated Dec. 28, 2009, U.S. Appl. No. 10/942,174.

Affiliated with

Also associated with

Rating

Network file system-based data storage system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Network file system-based data storage system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network file system-based data storage system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4158330