Multiplex communications – Communication techniques for information carried in plural... – Assembly or disassembly of messages having address headers
Reexamination Certificate
2006-01-19
2009-08-18
Pham, Chi H. (Department: 2416)
Multiplex communications
Communication techniques for information carried in plural...
Assembly or disassembly of messages having address headers
C370S392000, C709S242000
Reexamination Certificate
active
07577164
ABSTRACT:
A computer implemented method and system for transferring data packets includes intercepting a stream of data packets at the connectionless network layer from a client or server, encoding and encapsulating the data packets, transmitting the encoded data packets, decoding and decapsulating the data packets, and injecting the decoded and decapsulated data packets into the connectionless network layer at a client or server. The encoding of the packets is based on detecting repetitions that could exist anywhere in the data stream. The repetitions are not necessarily within a single packet but could occur across multiple packets and multiple sessions. One of the encoding algorithms includes comparing the payloads of packets with identical signatures and transmitting the full packet only when the payload had not previously been sent.
REFERENCES:
patent: 4322795 (1982-03-01), Lange et al.
patent: 4876541 (1989-10-01), Storer
patent: 5049881 (1991-09-01), Gibson et al.
patent: 5087913 (1992-02-01), Eastman
patent: 5307413 (1994-04-01), Denzer
patent: 5371499 (1994-12-01), Graybill et al.
patent: 5377329 (1994-12-01), Seitz
patent: 5394879 (1995-03-01), Gorman
patent: 5450562 (1995-09-01), Rosenberg et al.
patent: 5485526 (1996-01-01), Tobin
patent: 5633871 (1997-05-01), Bloks
patent: 5708659 (1998-01-01), Rostoker et al.
patent: 5729228 (1998-03-01), Franaszek et al.
patent: 5754791 (1998-05-01), Dahlgren et al.
patent: 5864554 (1999-01-01), Rostoker et al.
patent: 5867114 (1999-02-01), Barbir
patent: 5892549 (1999-04-01), Feng
patent: 5903230 (1999-05-01), Masenas
patent: 5940596 (1999-08-01), Rajan et al.
patent: 5951623 (1999-09-01), Reynar et al.
patent: 5966385 (1999-10-01), Fujii et al.
patent: 5996022 (1999-11-01), Krueger et al.
patent: 6014712 (2000-01-01), Islam et al.
patent: 6067381 (2000-05-01), Benayoun et al.
patent: 6100824 (2000-08-01), MacLeod et al.
patent: 6339595 (2002-01-01), Rekhter et al.
patent: 6351465 (2002-02-01), Han
patent: 6369855 (2002-04-01), Chauvel et al.
patent: 6456209 (2002-09-01), Savari
patent: 6484210 (2002-11-01), Adriano et al.
patent: 6490356 (2002-12-01), Beuque
patent: 6498809 (2002-12-01), Dean et al.
patent: 6584093 (2003-06-01), Salama et al.
patent: 6614785 (2003-09-01), Huai et al.
patent: 6665725 (2003-12-01), Dietz et al.
patent: 6748520 (2004-06-01), Maynard et al.
patent: 6771646 (2004-08-01), Sarkissian et al.
patent: 6822589 (2004-11-01), Dye et al.
patent: 6907048 (2005-06-01), Treadaway et al.
patent: 7237036 (2007-06-01), Boucher et al.
patent: 7379475 (2008-05-01), Minami et al.
patent: 2001/0056416 (2001-12-01), Garcia-Luna-Aceves
patent: 2002/0044553 (2002-04-01), Chakravorty
patent: 2002/0184390 (2002-12-01), Alkhatib
patent: 2003/0058856 (2003-03-01), Salett et al.
patent: 2003/0152076 (2003-08-01), Lee et al.
patent: 2004/0062245 (2004-04-01), Sharp et al.
patent: 2005/0105506 (2005-05-01), Birdwell et al.
patent: 2180039 (1999-01-01), None
patent: 0 127 815 (1984-12-01), None
patent: 0 643 491 (1995-03-01), None
patent: 1 134 900 (2001-09-01), None
patent: WO 00/07124 (2000-10-01), None
First Substantive Examination Report from the European Patent Office for Application No. 01 959 237.7-2223, dated Aug. 18, 2005, 5 pgs.
Second Substantive Examination Report from the European Patent Office for Application No. 01 959 237.1-2223, dated Apr. 25, 2006, 5 pgs.
Obaidat, M.S., et al. “Verification of Computer User Using Keystroke Dynamics,” IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics, vol. 27, No. 2, pp. 261-269, Apr. 1997.
Liu, Z. et al., Scalable Robust Efficient Dictionary-Based Compression (SCRIBE), Mar. 22, 2001, [online] [Retrieved on Feb. 21, 2005] Retrieved from the Internet <URL:http://www.watersprings.org/pub/id/draft-liu-rohc-scribe-00.txt>.
Nevill-Manning, C. et al., “Identifying Hierarchical Structure In Sequences: A Linear-Time Algorithm,” Journal of Artificail Intelligence Research, Sep. 1997, pp. 67-82, vol. 7.
Nevill-Manning, C. et al., “Linear Time, Incremental Hierarchy Inference For Compression,” Data Compression Conference, 1997, DCC '97, Proceedings Snowbird, Mar. 25-27, 1997, Los Alamitos, CA, USA, IEEE Comput. Soc., Mar. 25, 1997, pp. 3-11.
Nevill-Manning, C. et al., “Phrase Hierarchy Inference And Compression In Bounded Space,” Data Compression Conference, 1998, DCC '98, Proceedings Snowbird, Mar. 1-Apr. 1998, Los Alamitos, CA, USA, IEEE Comput. Soc., Mar. 30, 1998, pp. 179-188.
Supplementary European Search Report of European Application No. 01955862.6, Feb. 22, 2005, 3 pgs.
Banga, G. et al., “Optimistic Deltas For WWW Latency Reduction,” 1997 Annual Technical Conference, Usenix Association, 1997, pp. 289-303.
Chi, C. et al., “Compression Proxy Server: Design And Implementation,” Proceedings of USITS'99: The 2ndUSENIX Symposium On Internet Technologies & Systems, The Usenix Association, Oct. 11-14, 1999, 13 pages.
Communication, EP 01959237.7, Jun. 9, 2005, 5 pages.
Heywood, P., “Compression And Routers, Together At Last,” International News Analysis, Data Communications, Apr. 24, 1995, pp. 55-56, 61-63, No. 5.
Nand, A. et al., “Mail Servers With Embedded Data Compression Mechanism,” IEEE, 1998, p. 566.
Nevill-Manning, C. et al., “Compression And Explanation Using Hierarchical Grammars,” The Computer Journal, 1997, pp. 103-116, vol. 40.
Sheu, S. et al., “A Link Level Compression Strategy For High-Speed Backbone ATM Networks,” pp. 1-5.
Clark, A.D., “Adaptive source coding techniques for communications systems,” Telecommunications, 1989, Second IEEE National Conference on Telecommunications, p. 53-60.
Juniper Networks, Inc.
Mew Kevin
Pham Chi H.
Shumaker & Sieffert P.A.
LandOfFree
Network architecture and methods for transparent on-line... 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 architecture and methods for transparent on-line..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network architecture and methods for transparent on-line... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4062360