Electrical computers and digital processing systems: multicomput – Distributed data processing – Client/server
Reexamination Certificate
2005-09-15
2008-09-23
Nguyen, Phuoc H (Department: 2143)
Electrical computers and digital processing systems: multicomput
Distributed data processing
Client/server
C709S216000, C709S236000, C709S245000, C709S246000, C709S247000, C711S001000, C711S147000, C711S209000, C341S051000, C341S055000
Reexamination Certificate
active
07428573
ABSTRACT:
In a network having transaction acceleration, for an accelerated transaction, a client directs a request to a client-side transaction handler that forwards the request to a server-side transaction handler, which in turn provides the request, or a representation thereof, to a server for responding to the request. The server sends the response to the server-side transaction handler, which forwards the response to the client-side transaction handler, which in turn provides the response to the client. Transactions are accelerated by the transaction handlers by storing segments of data used in the transactions in persistent segment storage accessible to the server-side transaction handler and in persistent segment storage accessible to the client-side transaction handler. When data is to be sent between the transaction handlers, the sending transaction handler compares the segments of the data to be sent with segments stored in its persistent segment storage and replaces segments of data with references to entries in its persistent segment storage that match or closely match the segments of data to be replaced. The receiving transaction store reconstructs the data sent by replacing segment references with corresponding segment data from its persistent segment storage, requesting missing segments from the sender as needed. The transaction accelerators could handle multiple clients and/or multiple servers and the segments stored in the persistent segment stores can relate to different transactions, different clients and/or different servers. Persistent segment stores can be prepopulated with segment data from other transaction accelerators.
REFERENCES:
patent: 4988998 (1991-01-01), O'Brien
patent: 5371852 (1994-12-01), Attanasio et al.
patent: 5414850 (1995-05-01), Whiting
patent: 5737594 (1998-04-01), Williams
patent: 5754774 (1998-05-01), Bittinger et al.
patent: 5771355 (1998-06-01), Kuzma
patent: 5822746 (1998-10-01), Williams
patent: 5838963 (1998-11-01), Griffiths
patent: 5867661 (1999-02-01), Bittinger et al.
patent: 5903723 (1999-05-01), Beck et al.
patent: 5931913 (1999-08-01), Meriwether et al.
patent: 5977890 (1999-11-01), Rigoutsos et al.
patent: 5990810 (1999-11-01), Williams
patent: 5999949 (1999-12-01), Crandall
patent: 6009462 (1999-12-01), Birrell et al.
patent: 6163811 (2000-12-01), Porter
patent: 6178461 (2001-01-01), Chan et al.
patent: 6369723 (2002-04-01), Pieterse et al.
patent: 6397253 (2002-05-01), Quinlan et al.
patent: 6415329 (2002-07-01), Gelman et al.
patent: 6449658 (2002-09-01), Lafe et al.
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), Pham et al.
patent: 6704730 (2004-03-01), Moulton et al.
patent: 6721780 (2004-04-01), Kasriel et al.
patent: 6772193 (2004-08-01), Igawa et al.
patent: 7058699 (2006-06-01), Chiou et al.
patent: 7120666 (2006-10-01), McCanne et al.
patent: 7181523 (2007-02-01), Sim
patent: 2002/0087547 (2002-07-01), Kausik et al.
patent: 2002/0138511 (2002-09-01), Psounis et al.
patent: 2002/0165911 (2002-11-01), Gabber et al.
patent: 2002/0169818 (2002-11-01), Stewart et al.
patent: 2002/0169828 (2002-11-01), Blanchard
patent: 2002/0194382 (2002-12-01), Kausik et al.
patent: 2003/0046369 (2003-03-01), Sim et al.
patent: 2003/0105837 (2003-06-01), Kamen et al.
patent: 2004/0088376 (2004-05-01), McCanne et al.
patent: 2004/0215746 (2004-10-01), McCanne et al.
patent: 0813326 (1997-12-01), None
patent: 1056279 (2000-12-01), None
patent: 2002-2359649 (2002-12-01), None
patent: WO 95-20793 (1995-08-01), None
patent: WO 98/16067 (1998-04-01), None
patent: WO 01-63420 (2001-08-01), None
patent: WO 01/65831 (2001-09-01), None
patent: WO 01-80022 (2001-10-01), None
patent: WO 01/97526 (2001-12-01), None
Padmanabhan et al., “Using Predictive Prefetching to Improve World Wide Web Latency,”IEEE Transactions on Antennas and Propagation, 26(3):22-36 (1996).
Sayood, Khalid et al., “Recursively Indexed Quantization of Memoryless Sources”, IEEE Transactions On Information Theory, Sep. 1992, pp. 1602-1609, vol. IT-38, No. 5.
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-34, 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., “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.
Amer et al. “File access prediction with adjustable accuracy” Institute of Electrical and Electrical Engineers, Conference Proceedings of the 2002 IEEE International Performance,Computing and Communications Conference, Phoenix, AZ, Apr. 3-5, 2002 vol. Conf. 21, pp. 131-140.
Chakrabarti, Samidy; “Low-Bandwidth Web Access with Tandem Proxies”; 2002,Department of Electrical Engineering, Massachusetts Institute of Technology, pp. 1-64.
Franaszek et al. “Parallel compression with cooperative dictionary construction” Data Compression Conference, 1996 DCC '96. Proceedings, Mar. 31-Apr. 3, 1996, pp. 200-209.
Lin et al. “Code compression techniques using operand field remapping” Computers and Digital Techniques, IEEE Proceedings vol. 149, Issue 1, Jan. 2002, pp. 25-31.
Khalid Sayood et al., “Recursively Indexed Quantization of Memoryless Sources”, IEEE Transactions On Information Theory, vol. IT-38, No. 5, pp. 1602-1609, Sep. 1992.
Muthitacharoen, et al., “A Low-bandwidth Network File System”,Symposium on Operating Systems Principles, 2001, pp. 147-187, URL=http://www.pdos.lcs.mit.edu/papers/lbfs:sosp01/lbfs.pdf.
Padmanabhan et al. “Using predictive prefetching to improve World Wide Web latency” IEEE Transactions on Antennas and Propagation, IEEE Inc. New York, US. vol. 26, No. 3, Jul. 1996 pp. 22-36.
Spring et al. “A protocol -independent technique for eliminating redundant network traffic”, Aug. 2000, Proceedings of ACM SIGCOMM 9, pp. www.acm.org.
“Transmultiplexing, Transcontrol and Transscrambling of MPEC-2/DVB Signal”, Bungum, Int'l Broadcasting Convention, London, GB, Sep. 12, 1996, pp. 288-293.
UDI Manber, “Finding Similar Files In a Large File System”, Department of Computer Science, University of Arizona, TR 93-33, Oct. 1993.
UDI Manber et al., “GLIMPSE: A Tool to Search Through Entire File Systems”, Department of Computer Science, University of Arizona, TR 93-34, Oct. 1993.
“Unleashing the True Power of Today's Networks”,A Peribit White Paper, Aug. 2002, pp. 1-13, URL=http://www.peribit.com/products/etc/0217w02punl.htm.
Mellia, M.; Meo, M.; “TCP Smart-Framing: using smart segments to enhance the performance of TCP” Casetti, C.; Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE , vol. 3 , Nov. 25-29, 2001 pp. 1708-1712 vol. 3.
Idi Manber, “A Text Compression Scheme that Allows Fast Searching Directly in the Compressed File” Department of Computer Science, University of Arizona, Technical Report #93-07, Mar. 1993.
URL=http://www.pdos.lcs.mit.edu/papers/lbfs:sosp01/lbfs.pdf. cited by other, Dec. 2001.
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.
Demmer Michael J.
McCanne Steven
Nguyen Phuoc H
Riverbed Technology, Inc.
Townsend and Townsend / and Crew LLP
LandOfFree
Transaction accelerator for client-server communication systems does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Transaction accelerator for client-server communication systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transaction accelerator for client-server communication systems will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3992783