Multiplex communications – Communication techniques for information carried in plural... – Adaptive
Reexamination Certificate
2006-12-29
2010-06-08
Duong, Frank (Department: 2474)
Multiplex communications
Communication techniques for information carried in plural...
Adaptive
Reexamination Certificate
active
07733910
ABSTRACT:
Shift-varying segmentation uses a shift-varying predicate function to evaluate input data within a sliding window to determine if the current sliding window position should be a segment boundary. The shift-varying predicate function is a function of both the input data within the sliding window and the position of the sliding window relative to a previous segment boundary or the beginning of the input data. The shift-varying predicate function includes a containment property and may compute a hash value from the input data in the sliding window. The hash value is compared to a threshold value that is a function of the sliding window position. As the sliding window position advances away from a previous segment boundary, the probability of a segment boundary at the window position increases. Shift-varying segmentation can be used in compression, transaction acceleration, and data storage applications.
REFERENCES:
patent: 4641274 (1987-02-01), Swank
patent: 5754774 (1998-05-01), Bittinger et al.
patent: 5990810 (1999-11-01), Williams
patent: 6076084 (2000-06-01), Harlan
patent: 6163811 (2000-12-01), Porter
patent: 6178461 (2001-01-01), Chan et al.
patent: 6415329 (2002-07-01), Gelman et al.
patent: 6704730 (2004-03-01), Moulton 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: 6961009 (2005-11-01), McCanne et al.
patent: 7098815 (2006-08-01), Samuels et al.
patent: 7116249 (2006-10-01), McCanne et al.
patent: 7269689 (2007-09-01), Eshghi et al.
patent: 7272602 (2007-09-01), Moulton
patent: 7281006 (2007-10-01), Hsu et al.
patent: 7370120 (2008-05-01), Kirsch et al.
patent: 2004/0215746 (2004-10-01), McCanne et al.
Hsu et al, Duplicate Management for Reference Data, IBM Research Report, 15 pages, Oct. 2003.
Collberg et al, SLINKY: Static Linking Reloaded, USENIX Annual Technical Conference, 14 pages, 2005.
Broder, A.Z. et al.; “Syntactic clustering of the web”; WWW6/Computer Networks, 29(813) :1157-1166, 1997.
Chakrabarti,, Samidh; “Low-Bandwidth Web Access with Tandem Proxies” Sep. 2002; 1-64; Massachusetts Institute of Technology.
Douglis, Fred, et al., “Application-specific Delta-encoding via Resemblance Detection”, Jun. 2003, Proceedings of the 2003 USENIX Annual Technical Conference.
Manber, Udi et al., “A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File”, Department of Computer Science, Mar. 1993, pp. 1-12, Technical Report #93-07, University of Arizona, Tucson, Arizona.
Manber, Udi et al., “Finding Similar Files in a Large File System”, Department of Computer Science, Oct. 1993, pp. 1-10, Technical Report #93-33, University of Arizona, Tucson, Arizona.
Manber, Udi et al., “Glimpse: A Tool to Search Through Entire File Systems”, Department of Computer Science, Oct. 1993, pp. 1-10, Technical Report #93-94, University of Arizona, Tucson, Arizona.
Muthitacharoen, Athicha et al., “A Low-bandwidth Network File System”, Symposium on Operating Systems Principles, 2001, pp. 147-187.
Rabin, M. O. “Fingerprinting by random polynomials”; Center for Research in Computing Technology, Harvard University, Report TR-15-81, 1981.
Spring, Neil T. et al., “A Protocol-Independent Technique for Eliminating Redundant Network Traffic”, Aug. 2000, Proceedings of ACM SIGCOMM.
Tolia, Niraj, et al.,; “Opportunistic Use of Content Addressable Storage for Distributed File Systems”; Jun. 2003, Proceedings of the 2003 USENIX Annual Technical Conference.
Tolia, Niraj et al., “An Architecture for Internet Data Transfer”, Third Symposium on Networked Systems Design and Implementation, May 2006.
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, pp. 1-14.
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.
Purushottam, Kulkarni, et al., “Redundancy Elimination Within Large Collections of Files,” Jun. 27-Jul. 2, 2004, Proceedings of the General Track: 2004 USENIX Annual Technical Conference, University of Massachusetts, Boston, Massachusetts, 14 pages total.
Rhea, Sean C. et al., “Value-Based Web Caching,” May 2003,Proceedings of the 12th International Conference on World Wide Web, Budapest, Hungary, pp. 619-628.
Anderson David B.
Mace James E.
McCanne Steven
Duong Frank
Riverbed Technology, Inc.
Townsend and Townsend / and Crew LLP
LandOfFree
Data segmentation using shift-varying predicate function... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data segmentation using shift-varying predicate function..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data segmentation using shift-varying predicate function... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4153674