Multiplex communications – Pathfinding or routing – Store and forward
Reexamination Certificate
2011-01-18
2011-01-18
Pham, Chi H (Department: 2416)
Multiplex communications
Pathfinding or routing
Store and forward
C370S353000, C370S395410
Reexamination Certificate
active
07873065
ABSTRACT:
A method, system, and apparatus are directed towards selectively concatenating data into a packet to modify a number of packets transmitted over a network based on a combination of network and/or send-queue metrics. In one embodiment, Nagle's algorithm is used for concatenating data into a packet. The concatenation may be selectively enabled based on heuristics applied to the combination of metrics. In one embodiment, the result may indicate that there should be a concatenation, or that data should be sent immediately, or that a current state for whether to concatenate or not should be maintained. The heuristics may include an expert system, decision tree, truth table, function, or the like. The heuristics may be provided by a user, or another computing device. In another embodiment, the concatenation may be enabled based on a conditional probability determined from the combination of metrics.
REFERENCES:
patent: 4021782 (1977-05-01), Hoerning
patent: 4054951 (1977-10-01), Jackson et al.
patent: 4316222 (1982-02-01), Subramaniam et al.
patent: 4386416 (1983-05-01), Giltner et al.
patent: 4593324 (1986-06-01), Ohkubo et al.
patent: 4626829 (1986-12-01), Hauck
patent: 4701745 (1987-10-01), Waterworth et al.
patent: 4862167 (1989-08-01), Copeland, III
patent: 4876541 (1989-10-01), Storer
patent: 4890282 (1989-12-01), Lambert et al.
patent: 4897717 (1990-01-01), Hamilton et al.
patent: 4906991 (1990-03-01), Fiala et al.
patent: 4971407 (1990-11-01), Hoffman
patent: 4988998 (1991-01-01), O'Brien
patent: 5003307 (1991-03-01), Whiting et al.
patent: 5016009 (1991-05-01), Whiting et al.
patent: 5109433 (1992-04-01), Notenboom
patent: 5126739 (1992-06-01), Whiting et al.
patent: 5146221 (1992-09-01), Whiting et al.
patent: 5150430 (1992-09-01), Chu
patent: 5155484 (1992-10-01), Chambers, IV
patent: 5167034 (1992-11-01), MacLean, Jr. et al.
patent: 5212742 (1993-05-01), Normile et al.
patent: 5249053 (1993-09-01), Jain
patent: 5280600 (1994-01-01), Van Maren et al.
patent: 5293388 (1994-03-01), Monroe et al.
patent: 5319638 (1994-06-01), Lin
patent: 5341440 (1994-08-01), Earl et al.
patent: 5367629 (1994-11-01), Chu et al.
patent: 5379036 (1995-01-01), Storer
patent: 5410671 (1995-04-01), Elgamal et al.
patent: 5414425 (1995-05-01), Whiting et al.
patent: 5463390 (1995-10-01), Whiting et al.
patent: 5479587 (1995-12-01), Campbell et al.
patent: 5488364 (1996-01-01), Cole
patent: 5504842 (1996-04-01), Gentile
patent: 5506944 (1996-04-01), Gentile
patent: 5539865 (1996-07-01), Gentile
patent: 5542031 (1996-07-01), Douglass et al.
patent: 5544290 (1996-08-01), Gentile
patent: 5546395 (1996-08-01), Sharma et al.
patent: 5546475 (1996-08-01), Bolle et al.
patent: 5553160 (1996-09-01), Dawson
patent: 5615287 (1997-03-01), Fu et al.
patent: 5638498 (1997-06-01), Tyler et al.
patent: 5768445 (1998-06-01), Troeller et al.
patent: 5768525 (1998-06-01), Kralowetz et al.
patent: 5774715 (1998-06-01), Madany et al.
patent: 5805932 (1998-09-01), Kawashima et al.
patent: 5825890 (1998-10-01), Elgamal et al.
patent: 5850565 (1998-12-01), Wightman et al.
patent: 5874907 (1999-02-01), Craft
patent: 5884269 (1999-03-01), Cellier et al.
patent: 5892847 (1999-04-01), Johnson
patent: 5951623 (1999-09-01), Reynar et al.
patent: 5991515 (1999-11-01), Fall et al.
patent: 6006264 (1999-12-01), Colby et al.
patent: 6052785 (2000-04-01), Lin et al.
patent: 6061454 (2000-05-01), Malik et al.
patent: 6070179 (2000-05-01), Craft
patent: 6098108 (2000-08-01), Sridhar et al.
patent: 6185625 (2001-02-01), Tso et al.
patent: 6223287 (2001-04-01), Douglas et al.
patent: 6243761 (2001-06-01), Mogul et al.
patent: 6314465 (2001-11-01), Paul et al.
patent: 6367009 (2002-04-01), Davis et al.
patent: 6442140 (2002-08-01), Kirschenbaum
patent: 6584567 (2003-06-01), Bellwood et al.
patent: 6598071 (2003-07-01), Hayashi et al.
patent: 6643701 (2003-11-01), Aziz et al.
patent: 6662233 (2003-12-01), Skarpness et al.
patent: 6674717 (2004-01-01), Duong-van et al.
patent: 6681327 (2004-01-01), Jardin
patent: 6718388 (2004-04-01), Yarborough et al.
patent: 6728785 (2004-04-01), Jungck
patent: 6757255 (2004-06-01), Aoki et al.
patent: 6810411 (2004-10-01), Coughlin et al.
patent: 6842768 (2005-01-01), Shaffer et al.
patent: 6973622 (2005-12-01), Rappaport et al.
patent: 7012893 (2006-03-01), Bahadiroglu
patent: 7051126 (2006-05-01), Franklin
patent: 7126955 (2006-10-01), Nabhan et al.
patent: 7142512 (2006-11-01), Kobayashi et al.
patent: 7287094 (2007-10-01), Mogul
patent: 7293094 (2007-11-01), Vaman et al.
patent: 7296089 (2007-11-01), Krishnamurthy et al.
patent: 7299300 (2007-11-01), Desai et al.
patent: 7388841 (2008-06-01), Shao et al.
patent: 2002/0073238 (2002-06-01), Doron
patent: 2002/0199012 (2002-12-01), Cable et al.
patent: 2003/0028606 (2003-02-01), Koopmans et al.
patent: 2003/0126255 (2003-07-01), Rice et al.
patent: 2004/0010621 (2004-01-01), Afergan et al.
patent: 2004/0054805 (2004-03-01), Sen et al.
patent: 2004/0236826 (2004-11-01), Harville et al.
patent: 2005/0015765 (2005-01-01), Covell et al.
patent: 2005/0063303 (2005-03-01), Samuels et al.
patent: 2005/0074007 (2005-04-01), Samuels et al.
patent: 2005/0100014 (2005-05-01), Brown et al.
patent: 2005/0108420 (2005-05-01), Brown et al.
patent: 2005/0187979 (2005-08-01), Christensen et al.
patent: 2005/0201383 (2005-09-01), Bhandari et al.
patent: 2005/0265235 (2005-12-01), Accapadi et al.
patent: 2007/0261004 (2007-11-01), Swildens et al.
About Computing & Technology, “Wireless/Networking, Nagle algorithm,” visited Dec. 6, 2005, 2 pages, <http://compnetworking.about.com/od/tcpip/l/bldef—nagle.htm>.
Australia's Academic and Research Network, “Programs and large MTU, Nagle algorithm,” visited Dec. 9, 2005, 3 pages, <http://www.aarnet.edu.au/engineering
etworkdesign/mtu/programming.html>.
Berners-Lee, T. et al., RFC 1945, “Hypertext Transfer Protocol—HTTP/1.0,” May 1996, 51 pages.
Dierks, T. et al., RFC 2246, “The TLS Protocol, Verison 1.0,” Jan. 1999, 80 pages.
Fielding, R. et al., RFC 2616, “Hypertext Transfer Protocol—HTTP/1.1,” Jun. 1999, 114 pages.
fifi.org, “Manpage of TCP,” visited Dec. 9, 2005, 6 pages, <http://www.fifi.org/cgi-bin/man2html/usr/share/man/man7/tcp.7.gz>.
Freier, A. et al., Netscape Communications Corporation, “The SSL Protocol, Version 3.0,” Mar. 1996, 60 pages.
Kessler, G. et al., RFC 1739, “A Primer on Internet and TCP/IP Tools,” Dec. 1994, 46 pages.
Nagle, J., RFC 896, “Congestion control in IP/TCP internetworks,” Jan. 6, 1984, 13 pages.
OpenSSL, visited Apr. 12, 2006, 1 page, <www.openssl.org>.
Paxson, V., RFC 2525, “Known TCP Implementation Problems,” Mar. 1999, 61 pages.
Rescorla, E. “SSL and TLS, Designing and Building Secure Systems”, 2001, Addison-Wesley, 46 pages.
RSA Laboratories, “PKCS #1 v2.0: RSA Cryoptography Standard,” Oct. 1, 1998, 35 pages.
SearchNetworking.com, “Nagle's algorithm,” visited Dec. 6, 2005, 3 pages, <http://searchnetworking.techtarget.com/sDefinition/0,,sid7—gci754347,00.html>.
Tormasov, A. et at., “TCP/IP options for high-performance data transmission,” visited Dec. 9, 2005, 4 pages, <http://builder.com.com/5100-6732-1050878.html>.
W3C, “HTTP/1.1 and Nagle's Algorithm,” visited Dec. 6, 2005, 3 pages, <http://www.w3.org/Protocols/HTTP/Performance/Nagle/>.
“HTTP Compression Speeds up the Web”, pp. 1-5 can be found at http://www.webreference.com/internet/software/ servers/http/compression/, accessed Dec. 30, 2004.
“Use HTTP Compression”, pp. 1-4, can be found at http://www.websiteoptimization.com/speed/tweak/compress/, accessed Dec. 30, 2004.
“AppCelera: Smart Compression”, pp. 1-5, can be found at http://www.eweek.com/article2/0,1759,755242,00.asp, accessed Dec. 30, 2004.
Srinivasan Seshan et al., “SPAND: Shared Passive Network Performance Discovery
Mukerji Arindum
Rothstein Jesse Abraham
F5 Networks, Inc.
Frommer & Lawrence & Haug LLP
Huang Weibin
Pham Chi H
Wiegand Jamie L.
LandOfFree
Selectively enabling network packet concatenation based on... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Selectively enabling network packet concatenation based on..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Selectively enabling network packet concatenation based on... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2732673