Coded data generation or conversion – Digital code to digital code converters
Reexamination Certificate
2008-12-08
2010-12-14
Nguyen, Linh V (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
C341S051000, C707S793000, C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07852237
ABSTRACT:
In a coding system, input data within a system is encoded. The input data might include sequences of symbols that repeat in the input data or occur in other input data encoded in the system. The encoding includes determining a target segment size, determining a window size, identifying a fingerprint within a window of symbols at an offset in the input data, determining whether the offset is to be designated as a cut point and segmenting the input data as indicated by the set of cut points. For each segment so identified, the encoder determines whether the segment is to be a referenced segment or an unreferenced segment, replacing the segment data of each referenced segment with a reference label and storing a reference binding in a persistent segment store for each referenced segment, if needed. Hierarchically, the process can be repeated by grouping references into groups, replacing the grouped references with a group label, storing a binding between the grouped references and group label, if one is not already present, and repeating the process. The number of levels of hierarchy can be fixed in advanced or it can be determined from the content encoded.
REFERENCES:
patent: 4377803 (1983-03-01), Lotspiech et al.
patent: 4641274 (1987-02-01), Swank
patent: 5414850 (1995-05-01), Whiting
patent: 5737594 (1998-04-01), Williams
patent: 5754774 (1998-05-01), Bittinger et al.
patent: 5822746 (1998-10-01), Williams
patent: 5990810 (1999-11-01), Williams
patent: 6076084 (2000-06-01), Harlan
patent: 6148342 (2000-11-01), Ho
patent: 6163811 (2000-12-01), Porter
patent: 6178461 (2001-01-01), Chan et al.
patent: 6301376 (2001-10-01), Draganoff
patent: 6333932 (2001-12-01), Kobayasi et al.
patent: 6341171 (2002-01-01), De Lanauze
patent: 6415280 (2002-07-01), Farber et al.
patent: 6415329 (2002-07-01), Gelman et al.
patent: 6449658 (2002-09-01), Lafe et al.
patent: 6452915 (2002-09-01), Jorgensen
patent: 6553141 (2003-04-01), Huffman
patent: 6642860 (2003-11-01), Meulenbroeks
patent: 6667700 (2003-12-01), McCanne et al.
patent: 6678828 (2004-01-01), Zhang et al.
patent: 6704730 (2004-03-01), Moulton et al.
patent: 6791947 (2004-09-01), Oskouy et al.
patent: 6828925 (2004-12-01), McCanne et al.
patent: 6856651 (2005-02-01), Singh
patent: 6883035 (2005-04-01), Hannu et al.
patent: 6915302 (2005-07-01), Christofferson et al.
patent: 6961009 (2005-11-01), McCanne et al.
patent: 7269689 (2007-09-01), Eshghi et al.
patent: 7366859 (2008-04-01), Per et al.
patent: 7370120 (2008-05-01), Kirsch et al.
patent: 7398283 (2008-07-01), Margolus et al.
patent: 7412462 (2008-08-01), Margolus et al.
patent: 2002/0003795 (2002-01-01), Oskouy et al.
patent: 2002/0037035 (2002-03-01), Singh
patent: 2002/0087547 (2002-07-01), Kausik et al.
patent: 2002/0138511 (2002-09-01), Psounis et al.
patent: 2002/0194382 (2002-12-01), Kausik et al.
patent: 2003/0028761 (2003-02-01), Platt
patent: 2007/0083571 (2007-04-01), Meller et al.
patent: 2007/0150891 (2007-06-01), Shapiro
patent: WO 96/25801 (1996-08-01), None
Chakrabarti; “Low-Bandwidth Web Access with Tandem Proxies;” Sep. 2002;Massachusetts Institute of Technology; pp. 1-64.
Manber, Udi et al.; “A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File;” Mar. 1993;Department of Computer Science; Technical Report #93-07; University of Arizona; Tucson, Arizona; pp. 1-12.
Manber, Udi et al.; “Finding Similar Files in a Large File System;” Oct. 1993;Department of Computer Science; Technical Report #93-33; University of Arizona; Tucson, Arizona; pp. 1-10.
Manber, Udi et al.; “GLIMPSE: A Tool to Search Through Entire File Systems;” Oct. 1993;Department of Computer Science; Technical Report #93-34; University of Arizonal; Tucson, Arizona; pp. 1-10.
Mellia, Marco et al.; “TCP Smart-Framing: using smart segments to enhance the performance of TCP;” (date unknown)Dipartimento di Elettronica, Politecnico di Torino, 10129 Torino, Italy; pp. 1708-1712.
Muthitacharoen, et al.; “A Low-bandwidth Network File System;” 2001;Symposium on Operating Systems Principles; pp. 147-187; URL=http://www.pdos.lcs.mit.edu/papers/lbfs:sosp01/lbfs.pdf, no month.
Muthitacharoen, A. et al.; “A Low-bandwidth Network File System,” Oct. 21-24, 2001;Proceedings of the 18th ACM Symposium on Operating System Principles(SOSP'01); pp. 174-187.
Sayood, Khalid et al.; “Recursively Indexed Quantization of Memoryless Sources;” Sep. 1992;IEEE Transactions On Information Theory; vol. IT-38; No. 5; pp. 1602-1609.
Spring, Neil T.; “A Protocol-Independent Technique for Eliminating Redundant Network Traffic;” Aug. 2000;Proceedings of {ACM} {SIGCOMM}; 9 pp; URL=http://www.acm.org/sigs/sigcomm/sigcomm2000/conf/paper/sigcomm2000-3-1.pdf.
“Unleashing the True Power of Today's Networks;” Aug. 2002;A Peribit White Paper; pp. 1-13; URL=http://www.peribit.com/products/etc/0217w02punl.htm.
Factor, Michael and Sheinwald, Dafna; “Compression in the presence of shared data;” 2001;Information Sciences; vol. 135; pp. 29-41.
Housel, B.C. and Shields, I., “Emulator Express: A system for optimizing emulator performance for wireless networks;” 2000;IBM Systems Journal; vol. 39; No. 2; pp. 384-402.
Factor, Michael et al., “Compression in the Presence of Shared Data,” Jun. 2001, Information Sciences: An International Journal, vol. 135, Issue 1-2, pp. 29-41.
Feldmeier, D.C. et al., “Protocol Boosters,” Apr. 1998, IEEE JSAC, vol. 16, Issue No. 3, pp. 437-444.
Housel, B.C. et al., “Emulator Express: A System for Optimizing Emulator Performance for Wireless Networks,” 2000,IBM Systems Journal, vol. 39, No. 2, pp. 384-402.
Johnson, J.H., “Identifying Redundancy in Source Code Using Fingerprints,” Oct. 25-28, 1993,Proceedings of CAS CON '93, Toronto, Ontario, Canada, pp. 171-183.
Demmer Michael J.
McCanne Steven
Nguyen Linh V
Riverbed Technology, Inc.
Townsend & Townsend and Crew LLP
LandOfFree
Content-based segmentation scheme for data compression in... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Content-based segmentation scheme for data compression in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Content-based segmentation scheme for data compression in... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4165967