Transaction accelerator for client-server communication systems

Electrical computers and digital processing systems: multicomput – Distributed data processing – Client/server

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S247000, C341S055000, C711S206000

Reexamination Certificate

active

07120666

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: 5414850 (1995-05-01), Whiting
patent: 5737594 (1998-04-01), Williams
patent: 5771355 (1998-06-01), Kuzma
patent: 5822746 (1998-10-01), Williams
patent: 5838963 (1998-11-01), Griffiths
patent: 5903723 (1999-05-01), Beck 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: 6233253 (2001-05-01), Settle et al.
patent: 6369723 (2002-04-01), Pieterse 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: 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: 1056279 (2000-11-01), None
patent: WO 98/16067 (1998-04-01), None
patent: WO 01/65831 (2001-09-01), None
patent: WO 01/97526 (2001-12-01), None
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.
Franaszek, P.; Robinson, J.; Thomas, J.; “Parallel compression with cooperative dictionary construction” Data Compression Conference, 1996. DCC '96. Proceedings , Mar. 31-Apr. 3, 1996 pp. 200-209.
Lin, K.; Chung, C.-P.; “Code compression techniques using operand field remapping” Computers and Digital Techniques, IEE Proceedings- , vol. 149 , Issue: 1 , Jan. 2002 pp. 25-31.
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”,A Peribit White Paper, Aug. 2002, pp. 1-13, URL=http://www.peribit.com/products/etc/0217w02punl.htm.
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.
Chakrabarti, Samidy; “Low-Bandwidth Web Access with Tandem Proxies”; 2002,Department of Electrical Engineering, Massachusetts Institute of Technology, pp. 1-64.
“Transmultiplexing, Transcontrol and Transscrambling of MPEC-2/DVB Signal”, Bungum, Int'l Broadcasting Convention, London, GB, Sep. 12, 1996, pp. 288-293.
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.
Udi 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.
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.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFUS-PAI-O-3647501

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.