Architecture for efficient utilization and optimum...

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S473000

Reexamination Certificate

active

07639700

ABSTRACT:
An architecture for optimizing network communications that utilizes a device positioned at two edges of a constrained Wide Area Network (WAN) link. The device intercepts outgoing network packets and reroutes them to a proxy application. The proxy application uses persistent connections with a network accelerator device at the other end of the persistent connection. The proxy applications transmit the intercepted data after compressing it using a dictionary-based compression algorithm. Packet mangling may involve spoofing the connection request at each end node; a proxy-to-proxy communication protocol specifies a way to forward an original address, port, and original transport protocol information end to end. The packet mangling and proxy-to-proxy communication protocol assure network transparency.

REFERENCES:
patent: 4891643 (1990-01-01), Mitchell et al.
patent: 5276898 (1994-01-01), Kiel et al.
patent: 5333212 (1994-07-01), Ligtenberg
patent: 5488483 (1996-01-01), Murayama
patent: 5559978 (1996-09-01), Spilo
patent: 5646946 (1997-07-01), VanderMeer et al.
patent: 5657452 (1997-08-01), Kralowetz et al.
patent: 5657525 (1997-08-01), Hoyt et al.
patent: 5768525 (1998-06-01), Kralowetz et al.
patent: 5909250 (1999-06-01), Hardiman
patent: 5945933 (1999-08-01), Kalkstein
patent: 6012062 (2000-01-01), Jagadish et al.
patent: 6115384 (2000-09-01), Parzych
patent: 6138156 (2000-10-01), Fletcher et al.
patent: 6178489 (2001-01-01), Singh
patent: 6304567 (2001-10-01), Rosenberg
patent: 6314095 (2001-11-01), Loa
patent: 6397259 (2002-05-01), Lincke et al.
patent: 6449658 (2002-09-01), Lafe et al.
patent: 6473458 (2002-10-01), Shimizu et al.
patent: 6477201 (2002-11-01), Wine et al.
patent: 6658463 (2003-12-01), Dillon et al.
patent: 6728785 (2004-04-01), Jungck
patent: 6763031 (2004-07-01), Gibson et al.
patent: 6879631 (2005-04-01), Schultz et al.
patent: 6882753 (2005-04-01), Chen et al.
patent: 6904176 (2005-06-01), Chui et al.
patent: 6907071 (2005-06-01), Frojdh et al.
patent: 2002/0071438 (2002-06-01), Singh
patent: 2002/0136224 (2002-09-01), Motley
patent: 2003/0177396 (2003-09-01), Bartlett et al.
patent: 2004/0015591 (2004-01-01), Wang
patent: 2004/0103215 (2004-05-01), Ernst et al.
patent: 2004/0103225 (2004-05-01), McAlpine et al.
patent: 2006/0265689 (2006-11-01), Kuznetsov et al.
patent: 0 929 173 (1999-07-01), None
patent: 0 947 104 (2002-11-01), None
patent: 1 276 324 (2003-01-01), None
patent: 1 424 779 (2004-06-01), None
patent: 1 434 437 (2004-06-01), None
patent: WO-00/07083 (2000-02-01), None
patent: WO-01/37516 (2001-05-01), None
patent: WO-01/71701 (2001-09-01), None
patent: WO-03/073719 (2003-09-01), None
patent: WO-2004/036501 (2004-04-01), None
Huffman, David A. (1952) “A Method for the Construction of Minimum-Redundancy Codes,” Proceedings of the I.R.E., 40:1098-1101.
Ziv, J. et al. (1977) “A Universal Algorithm for Sequential Data Compression,” IEEE Transactions on Information Theory, IT23(3):337-343.
Gailly, J., “gzip The data compression program”, Edition 1.2.4 for Gzip Version 1.2.4, pp. 1-13, Jul. 1993. Can be found at http://www.gnu.org/software/gzip/manual/html—mono/gzip.html.
“Gzip—Wikipedia, the free encyclopedia”, Wikipedia, pp. 1-4, Dec. 6, 2005. Can be found at http://en.wikipedia.org/wiki/Gzip.
Gailly, J., “Invoking gzip”, pp. 1-2, Jul. 1993. Can be found at http://www.math.utah.edu/docs/info/gzip—4.html#SEC7.
“Data compression—Wikipedia, the free encyclopedia”, Wikipedia, pp. 1-7, Dec. 6, 2005. Can be found at http://en.wikipedia.org/wiki/Data—compression—algorithm.
Roelofs, Greg, zlib A Massively Spiffy Yet Delicately Unobtrusive Compression Library (Also Free, Not to Mention Unencumbered by Patents), pp. 1-5, Last updated on Aug. 7, 2005. Can be found at http://www.zlib.net/.
Krintz, Chandra and Sucu, Sezgin, “Adaptive on-the-Fly Compression (Abstract)”, EEE Computer Society, vol. 17, No. 1, pp. 1-2, Jan. 2006. Can be found at http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/trans/td/&toc=comp/trans/td/2006/01/l1toc.xml&DOI=10.1109/TPDS.2006.3.
Gailly, J. and Adler, M., “The gzip home page”, pp. 1-8, Last updated Jul. 27, 2003. Can be found at http://www.gzip.org.
“AppCelera: Smart Compression”. eWEEK.com, Ziff Davis Publishing Holdings Inc., pp. 1-11, © 1996-2006. Can be found at http://www.eweek.com/article2/0,1759,755242,00.asp.
Gailly, J. and Adler, M., “zlib 1.1.4 Manual”, pp. 1-14, Mar. 11, 2002. Can be found at http://www.zlib.net/manual.html.
F5 Networks, Inc., “Configuration Guide for Local Traffic Management” Version 9.0, MAN-0122-01, Chapter 6, pp. 1-26, © 1996-2005.
Fielding, R., at al., “Hypertext Transfer Protocol—HTTP/1.1”, IEFT, RFC 2616, pp. 1-18. Jun. 1999.
Pierzchala, Stephen, “Compressing Web Content with mod—gzip and mod—deflate”, Linux Journal, pp. 1-10, Apr. 26, 2004. Can be found at http://linuxjournal.com/article/6802.
“Data compression ratio—Wikipedia, the free encyclopedia”, Wikipedia, pp. 1-2, Dec. 6, 2005. Can be found at http://en.wikipedia.org/wiki/Data—compression—ratio.
“HTTP Compression Speeds up the Web What is IETF Content-Encoding (or HTTP Compression)?”, pp. 1-5. Can be found at http://webreference.com/internet/software/servers/http/compression/2.html.
Deutsch, P., “GZIP file format specification version 4.3”, IETF, RFC 1952, pp. 1-12, May 1996.
Berners-Lee, T., et al., “Hypertext Transfer Protocol—HTTP/1.0”, IETF, RFC 1945, pp. 1-23, May 1996.
“HTTP Compression Speeds up the Web”, pp. 1-5. Can be found at http://webreference.com/internet/software/servers/http/compression/, Oct. 13, 2000.
Leurs, L., “Flate/deflate ompression”, pp. 1-2, © 2000. Can be found at http://prepressure.com/techno/compressionflate.htm.
Deutsch, P. and Gailly, J., “ZLIB Compressed Data Format Specification version 3.3”, IETF, RFC 1950, pp. 1-11, May 1996.
Jeannot, Emmanuel, et al., “Adaptive Online Data Compression”, 11th IEEE International Symposium on High Performance Distributed Computing, pp. 1-57, 2002.
Deutsch, P., “DEFLATE Compressed Data Format Specification version 1.3”, IETF, RFC 1951, pp. 1-17, May 1996.
Gailly, J., “Overview”, pp. 1-2, Jul. 1993. Can be found at http://www.math.utah.edu/docs/info/gzip—2.html#SEC5.
Friend, R. and Monsour, R., “IP Payload Compression Using LZS”, IETF, RFC 2395, pp. 1-9, Dec. 1998.
Heath, J. and Border, J., “IP Payload Compression Using ITU-T V.44 Packet Method”, IEFT, RFC 3051, pp. 1-8, Jan. 2001.
Seshan, Srinivasan, et al., “SPAND: Shared Passive Network Performance Discovery”, USENIX Symposium on Internet Technologies and Systems, pp. 1-13, Dec. 1997.
“HTTP Compression”, pp. 1-5, Last modified Jan. 17, 2006. Can be found at http://www.websiteoptimization.com/speed/tweak/compress/.
Peraira, R., “IP Payload Compression Using DEFLATE”, IEFT, RFC 2394, pp. 1-6, Dec. 1998.
Roelofs, Greg, et al., “zlib Frequently Asked Questions”, pp. 1-7, last modified Jul. 18, 2005 by Mark Adler, © 1996-2005. Can be found at http://www.zlib.net/zlib—faq.html#faq38 <http://www.zlib.net/zlib—faq.html>.

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

Architecture for efficient utilization and optimum... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Architecture for efficient utilization and optimum..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Architecture for efficient utilization and optimum... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4067436

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