Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-10-24
2006-10-24
To, Doris H. (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S473000
Reexamination Certificate
active
07126955
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: 5657452 (1997-08-01), Kralowetz et al.
patent: 5768525 (1998-06-01), Kralowetz et al.
patent: 5945933 (1999-08-01), Kalkstein
patent: 6012062 (2000-01-01), Jagadish et al.
patent: 6115384 (2000-09-01), Parzych
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: 6658463 (2003-12-01), Dillon 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/0103225 (2004-05-01), McAlpine et al.
patent: WO 01/37516 (2001-05-01), None
patent: WO 01/37516 (2001-05-01), None
Huffman, David A., “A Method for the Construction of Minimum-Redundancy Codes,”Proceedings of the I.R.E., 40:1098-1101 (1952).
Ziv, Jacob, et al., “A Universal Alorithm for Sequential Data Compression,”IEEE Transactions on Information Theory, IT23(3):337-343 (1977).
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.
Helmy Youssri
Nabhan Tarek
Branch John W.
Darby & Darby PC
F5 Networks, Inc.
Hyun Soon D.
To Doris H.
LandOfFree
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.
Profile ID: LFUS-PAI-O-3712470