Method and system for executing protocol stack instructions...

Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S203000, C709S219000, C709S228000, C709S237000, C709S250000, C718S105000, C370S395520

Reexamination Certificate

active

07421505

ABSTRACT:
According to one embodiment, a first computing device receives first information that has been formed according to application software instructions. Independent of the application software instructions, the first computing device forms second information for causing a second computing device to perform an operation. In response to receiving the first information, the first computing device executes protocol stack instructions to form a packet including at least the first and second information. The first computing device outputs the packet to the second computing device.

REFERENCES:
patent: 3622707 (1971-11-01), Golembeski
patent: 4383280 (1983-05-01), Copeland
patent: 5619650 (1997-04-01), Bach et al.
patent: 5708832 (1998-01-01), Inniss
patent: 5745703 (1998-04-01), Cejtin et al.
patent: 5764914 (1998-06-01), Goto
patent: 5774660 (1998-06-01), Brendel et al.
patent: 5828569 (1998-10-01), Fisher
patent: 5889776 (1999-03-01), Liang
patent: 5918017 (1999-06-01), Attanasio et al.
patent: 5937169 (1999-08-01), Connery et al.
patent: 6006264 (1999-12-01), Colby et al.
patent: 6023563 (2000-02-01), Shani
patent: 6052733 (2000-04-01), Mahalingam et al.
patent: 6061349 (2000-05-01), Coile et al.
patent: 6070191 (2000-05-01), Narendran et al.
patent: 6085238 (2000-07-01), Yuasa et al.
patent: 6104717 (2000-08-01), Coile et al.
patent: 6105119 (2000-08-01), Kerr et al.
patent: 6141705 (2000-10-01), Anand et al.
patent: 6157955 (2000-12-01), Narad et al.
patent: 6179489 (2001-01-01), So et al.
patent: 6182139 (2001-01-01), Brendel
patent: 6185619 (2001-02-01), Joffe et al.
patent: 6195705 (2001-02-01), Leung
patent: 6226678 (2001-05-01), Mattaway et al.
patent: 6226680 (2001-05-01), Boucher et al.
patent: 6246683 (2001-06-01), Connery et al.
patent: 6247060 (2001-06-01), Boucher et al.
patent: 6252878 (2001-06-01), Locklear, Jr. et al.
patent: 6253230 (2001-06-01), Couland et al.
patent: 6256322 (2001-07-01), Wilson, Jr.
patent: 6298370 (2001-10-01), Tang et al.
patent: 6330231 (2001-12-01), Bi
patent: 6330602 (2001-12-01), Law et al.
patent: 6334153 (2001-12-01), Boucher et al.
patent: 6338089 (2002-01-01), Quinlan
patent: 6363477 (2002-03-01), Fletcher et al.
patent: 6370584 (2002-04-01), Bestavros et al.
patent: 6374300 (2002-04-01), Masters
patent: 6389462 (2002-05-01), Cohen et al.
patent: 6389479 (2002-05-01), Boucher et al.
patent: 6393487 (2002-05-01), Boucher et al.
patent: 6400730 (2002-06-01), Latif et al.
patent: 6415329 (2002-07-01), Gelman
patent: 6427171 (2002-07-01), Craft et al.
patent: 6427173 (2002-07-01), Boucher et al.
patent: 6434620 (2002-08-01), Boucher et al.
patent: 6442612 (2002-08-01), Hugosson et al.
patent: 6452922 (2002-09-01), Ho
patent: 6453360 (2002-09-01), Muller et al.
patent: 6457050 (2002-09-01), Cowan
patent: 6473425 (2002-10-01), Bellaton et al.
patent: 6490632 (2002-12-01), Vepa et al.
patent: 6512774 (2003-01-01), Vepa et al.
patent: 6523068 (2003-02-01), Beser et al.
patent: 6539494 (2003-03-01), Abramson et al.
patent: 6546425 (2003-04-01), Hanson
patent: 6549522 (2003-04-01), Flynn
patent: 6567377 (2003-05-01), Vepa et al.
patent: 6578066 (2003-06-01), Logan et al.
patent: 6587438 (2003-07-01), Brendel
patent: 6590861 (2003-07-01), Vepa et al.
patent: 6591302 (2003-07-01), Boucher et al.
patent: 6598077 (2003-07-01), Primak et al.
patent: 6606301 (2003-08-01), Muller et al.
patent: 6628615 (2003-09-01), Joseph
patent: 6650640 (2003-11-01), Muller et al.
patent: 6665304 (2003-12-01), Beck
patent: 6671273 (2003-12-01), Beck
patent: 6691165 (2004-02-01), Bruck et al.
patent: 6697868 (2004-02-01), Craft et al.
patent: 6718361 (2004-04-01), Basani et al.
patent: 6725272 (2004-04-01), Susai et al.
patent: 6735169 (2004-05-01), Albert et al.
patent: 6748420 (2004-06-01), Quatrano et al.
patent: 6754713 (2004-06-01), Dascalu
patent: 6757746 (2004-06-01), Boucher et al.
patent: 6772333 (2004-08-01), Brendel
patent: 6778540 (2004-08-01), Ratcliff et al.
patent: 6785226 (2004-08-01), Oltman et al.
patent: 6788649 (2004-09-01), Dugan et al.
patent: 6788692 (2004-09-01), Boudreau
patent: 6788980 (2004-09-01), Johnson
patent: 6799202 (2004-09-01), Hankinson et al.
patent: 6801949 (2004-10-01), Bruck et al.
patent: 6807176 (2004-10-01), Egbert et al.
patent: 6807183 (2004-10-01), Chow et al.
patent: 6823373 (2004-11-01), Pancha et al.
patent: 6826615 (2004-11-01), Barrall et al.
patent: 6850531 (2005-02-01), Rao et al.
patent: 6879559 (2005-04-01), Blackmon
patent: 6891839 (2005-05-01), Albert et al.
patent: 6904519 (2005-06-01), Anand et al.
patent: 6941386 (2005-09-01), Craft et al.
patent: 6961346 (2005-11-01), Michalewicz et al.
patent: 7003574 (2006-02-01), Bahl
patent: 7017049 (2006-03-01), Hand et al.
patent: 7165120 (2007-01-01), Giles
patent: 2001/0023460 (2001-09-01), Boucher et al.
patent: 2001/0027496 (2001-10-01), Boucher et al.
patent: 2001/0037406 (2001-11-01), Philbrick et al.
patent: 2002/0095519 (2002-07-01), Philbrick et al.
patent: 2002/0133529 (2002-09-01), Schmidt
patent: 2002/0152403 (2002-10-01), Hand et al.
patent: 2002/0161839 (2002-10-01), Colasurdo et al.
patent: 2003/0135666 (2003-07-01), Kim
patent: 2003/0140153 (2003-07-01), Lawrence
patent: 1 041 496 (2000-10-01), None
“The 7 layers of the OSI Model”, http://webopedia.com/quick—ref/OSI—Layers.asp.
“Protocol Stack”, http://webopedia.com/TERM/p/protocol—stack.html.
Luis Aversa and Azer Bestavros.Load Balancing a Cluster of Web Servers Using Distributed Packet Rewriting. Technical Report BUCS-TR-1999-001, Boston University, Computer Science Department, Jan. 1999.
Luis Aversa and Azer Bestavros.Load Balancing a Cluster of Web Servers Using Distributed Packet Rewriting. InProceedings of IPCCC'2000: The IEEE International Performance, Computing, and Communication Conference, Phoenix, AZ, Feb. 2000.
Beestermöller, H., et al., “An online and offline programmable Multi-Loop Controller for Distributed Systems,”IEEE, 1994, pp. 15-20.
Information Sciences Institute, “Transmission Control Protocol,”RFC 793, 91 pages, Sep. 1981. Retrieved Apr. 15, 2005, from http://rfc.sunsite.dk/rfc/rfc793.html.
Postel, J., “User Datagram Protocol,”RFC 768, pp. 1-5, Aug. 28, 1980. Retrieved Jun. 2, 2005, from http://rfc.sunsite.dk/rfc/rfc768.html.
Perkins, C., “IP Encapsulation within IP,”RFC 2003, IBM, Oct. 1996, retrieved Jun. 20, 2005, from http://www.ietf.org/rfc/rfc2003.txt?number=2003, pp. 1-14.
Bestavros et al. “Distributed Packet Rewriting and its Application to Scalable Server Architectures”Conference on Network Protocols, Oct. 1998, pp. 290-297.
Dias et al. “A Scalable and Highly Available Web Server”COMPCON '96, 1996, IEEE pp. 85-92.
Defense Advanced Research Projects Agency. “Request from Comments (RFC) 793: Transmission Control Protocol”, published by Network Working Group, Sep. 1981, 85 pages.
Snoeren et al., “TCP Connection Migration,” IETF Memo <draft-snoeren-tcp-migrate-00>, Nov. 2000, 13 pages.
Stevens, W. Richard, “The Protocols,”TCP/IP Illustrated, vol. 1, Addison-Wesley, copyright 1994, pp. 12, 254.

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

Method and system for executing protocol stack instructions... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for executing protocol stack instructions..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for executing protocol stack instructions... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3965652

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