Accelerating network performance by striping and...

Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S352000, C370S392000, C370S477000, C709S228000, C709S232000, C709S247000

Reexamination Certificate

active

10632519

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 multiple, preferably persistent connections with a network accelerator device at the other end of the persistent connection. The proxy applications transmit the intercepted data. 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 layer 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: 6577653 (2003-06-01), Rochberger et al.
patent: 6658463 (2003-12-01), Dillon et al.
patent: 6775305 (2004-08-01), Delvaux
patent: 6816455 (2004-11-01), Goldberg et al.
patent: 6820133 (2004-11-01), Grove et al.
patent: 7139811 (2006-11-01), Lev Ran et al.
patent: 2002/0013840 (2002-01-01), Border et al.
patent: 2002/0042839 (2002-04-01), Peiffer et al.
patent: 2002/0055966 (2002-05-01), Border et al.
patent: 2002/0055983 (2002-05-01), Goddard
patent: 2002/0071436 (2002-06-01), Border et al.
patent: 2002/0071438 (2002-06-01), Singh
patent: 2002/0136224 (2002-09-01), Motley
patent: 2003/0123481 (2003-07-01), Neale et al.
patent: 2003/0177395 (2003-09-01), Pardee et al.
patent: 2003/0177396 (2003-09-01), Bartlett et al.
patent: 2003/0219022 (2003-11-01), Dillon et al.
patent: 2004/0001519 (2004-01-01), Fisher et al.
patent: 2004/0015591 (2004-01-01), Wang
patent: 2004/0093420 (2004-05-01), Gamble
patent: 2004/0103225 (2004-05-01), McAlpine et al.
patent: 2004/0111523 (2004-06-01), Hall et al.
patent: 2004/0172475 (2004-09-01), Tenereillo et al.
patent: 2004/0215746 (2004-10-01), McCanne et al.
patent: 2004/0243703 (2004-12-01), Demmer et al.
patent: 2005/0044242 (2005-02-01), Stevens et al.
patent: 2005/0243835 (2005-11-01), Sharma et al.
patent: WO 01/37516 (2001-05-01), None
RFC 2616, Hypertext Transfer Protocol-HTTP/1.1, Jun. 1999, pp. 1-147.
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).
Sivakumar, H. et al. (2000) “PSockets: The Case for Application-level Network Striping for Data Intensive Applications using High Speed Wide Area Networks,” Proceedings of Super Computing 2000 (SC2000), Dallas, Texas.

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

Accelerating network performance by striping and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Accelerating network performance by striping and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accelerating network performance by striping and... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3870106

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