TCP/IP offload device

Information

  • Patent Grant
  • 8539112
  • Patent Number
    8,539,112
  • Date Filed
    Monday, May 16, 2011
    13 years ago
  • Date Issued
    Tuesday, September 17, 2013
    11 years ago
Abstract
A host CPU runs a network protocol processing stack that provides instructions not only to process network messages but also to allocate processing of certain network messages to a specialized network communication device, offloading some of the most time consuming protocol processing from the host CPU to the network communication device. By allocating common and time consuming network processes to the device, while retaining the ability to handle less time intensive and more varied processing on the host stack, the network communication device can be relatively simple and cost effective. The host CPU, operating according to instructions from the stack, and the network communication device together determine whether and to what extent a given message is processed by the host CPU or by the network communication device.
Description
TECHNICAL FIELD

The present invention relates generally to computer or other networks, and more particularly to protocol processing for information communicated between hosts such as computers connected to a network.


BACKGROUND INFORMATION

One of the most CPU intensive activities associated with performing network protocol processing is the need to copy incoming network data from an initial landing point in system memory to a final destination in application memory. This copying is necessary because received network data cannot generally be moved to the final destination until the associated packets are: A) analyzed to ensure that they are free of errors, B) analyzed to determine which connection they are associated with, and C) analyzed to determine where, within a stream of data, they belong. Until recently, these steps had to be performed by the host protocol stack. With the introduction of the intelligent network interface device (as disclosed in U.S. patent application Ser. Nos. 09/464,283, 09/439,603, 09/067,544, and U.S. Provisional Application Ser. No. 60/061,809), these steps may now be performed before the packets are delivered to the host protocol stack.


Even with such steps accomplished by an intelligent network interface device, there is another problem to be addressed to reduce or eliminate data copying, and that is obtaining the address of the destination in memory and passing that address to the network interface device. Obtaining this address is often difficult because many network applications are written in such a way that they will not provide the address of the final destination until notified that data for the connection has arrived (with the use of the “select( )” routine, for example). Other attempts to obtain this address involve the modification of existing applications. One such example is the Internet Engineering Task Force (IETF) Remote DMA (RDMA) proposal, which requires that existing protocols such as NFS, CIFS, and HTTP be modified to include addressing information in the protocol headers. A solution is desired that does not require the modification of existing applications or protocols.


SUMMARY

A multi-packet message (for example, a session layer message) is to be received onto a Network Interface device (NI device) and the data payload of the message is to be placed into application memory in a host computer. The NI device receives the first packet of the message and passes a first part of this first packet to the operating system on the host. In one embodiment, the first part of the first packet includes the session layer header of the message. The operating system passes this first part of the first packet to an application program. The application program uses the first part of the first packet to identify an address of a destination in application memory where the entire data payload is to be placed. The application program returns the address to the operating system and the operating system in turn forwards the address to the NI device. The NI device then uses the address to place the data portions of the various packets of the multi-packet message into the destination in application memory. In one embodiment, the NI device DMAs the data portions of the packets from the NI device directly into the destination. In some embodiments, the NI device DMAs only data into the destination such that the destination contains the data payload in one contiguous block without any session layer header information, without any transport layer header information, and without any network layer header information.


In some embodiments, the NI device is an interface card that is coupled to the host computer via a parallel bus (for example, the PCI bus). In other embodiments, the NI device is integrated into the host computer. For example, the NI device may be part of communication processing device (CPD) that is integrated into the host computer.


Other structures and methods are described in the detailed description below. This summary does not purport to define the invention. The invention is defined by the claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a diagram of a Network Interface Device (NI device) in accordance with an embodiment of the present invention. The NI device performs fast-path processing on information passing from a packet-switched network (for example, the Internet), through the NI device, and to a host computer.



FIG. 2 is a diagram that illustrates a method in accordance with an embodiment of the present invention where network data from a multi-packet session message is transferred by the NI device directly into a destination in a host computer.



FIG. 3 is a flowchart of a method in accordance with an embodiment of the present invention.



FIG. 4 shows an NI device integrated into a host computer.





DETAILED DESCRIPTION


FIG. 1 is a diagram of a host computer 100 that is coupled to a packet-switched network 101 (for example, the Internet) via a Network Interface (NI) device 102. In the illustrated example, host computer 100 is an Intel x86-based system (for example, Compaq Proliant). Software executing on host computer 100 includes: 1) a Linux operating system 103, and 2) an application program 104 by the name of “Samba”. Operating system 103 includes a kernel 105. Kernel 105 includes: 1) driver software 106 for interfacing to and controlling NI device 102, and 2) a protocol stack 107. A part of protocol stack 107 is specially customized to support the NI device 102.


In one specific embodiment, NI device 102 is the Intelligent Network Interface Card (INIC) of FIGS. 21 and 22 of U.S. patent application Ser. No. 09/464,283 (the entire disclosure of 09/464,283 is incorporated herein by reference). The NI device 102 in this specific embodiment is an expansion card that plugs into a card edge connector on the host computer (for example, a personal computer). The card includes an application specific integrated circuit (ASIC) (for example, see ASIC 400 of FIG. 21 of U.S. application Ser. No. 09/464,283) designed by Alacritech, Inc. of 234 East Gish Road, San Jose, Calif. 95112. The card performs “fast-path processing” in hardware as explained in U.S. application Ser. No. 09/464,283. An INIC card (Model Number 2000-100001 called the “Alacritech 100x2 Dual-Server Adapter”) is available from Alacritech, Inc. of 234 East Gish Road, San Jose, Calif. 95112.



FIG. 2 is a diagram illustrating the transfer of data in a multi-packet session layer message 200 from a buffer 2114 (see FIG. 1) in NI device 102 to a second destination 110 in memory in host computer 100. The portion of the diagram to the left of the dashed line 201 (see FIG. 2) represents NI device 102, whereas the portion of the diagram to the right of the dashed line 201 represents host computer 100. Multi-packet message 200 includes approximately forty-five packets, four of which (202-205) are labeled on FIG. 2. The first packet 202 includes a portion 205 containing transport and network layer headers (for example, TCP and IP headers), a portion 206 containing a session layer header, and a portion 207 containing data. The subsequent packets 203-205 do not contain session layer header information, but rather include a first portion containing transport and network layer headers (for example, TCP and IP headers), and a second portion containing data.



FIG. 3 is a flowchart of a method in accordance with one specific embodiment of the present invention. In a first step (step 300), the Samba application program 104 initializes application-to-operating system communication by calling the “socket” function. The socket function causes kernel 105 to allocate a communication control block (CCB) that will be used to manage the connection. The Samba application program 104 then uses the “bind” routine to associate the socket with a particular local IP address and IP port. The Samba application program 104 then calls the “listen” routine to wait for an incoming connection to arrive from kernel 105. When an incoming connection arrives, the Samba application program 104 calls the “accept” routine to complete the connection setup. After setting up the socket, the Samba application program 104 uses the “select” routine to tell the kernel 105 to alert application 104 when data for that particular connection has arrived.


In a next step (step 301), driver 106 allocates a 256-byte buffer 108 in host memory as a place where NI device 102 can write data. Driver 106 then passes the address of 256-byte buffer 108 to NI device 102 so that NI device 102 can then use that address to write information into 256-byte buffer 108. Driver 106 does this by writing the address of 256-byte buffer 108 into a register 112 on the NI device 102. A status field at the top of the 256byte buffer 108 contains information indicating whether the 256-byte buffer contains data (and is valid) or not.


In step (step 302), NI device 102 receives the first packet 202 of message 200 (see FIG. 2) from network 101. NI device 102 looks at the IP source address, IP destination address, TCP source port and TCP destination port and from those four values determines the connection identified with the packet. (IP is the network layer. TCP is the transport layer.) NI device 102 then: 1) writes a unique identifier that identifies the connection into a designated field in the 256-byte buffer 108; 2) writes the first 192 bytes of the first packet into the 256-byte buffer (the MAC, IP and TCP headers are not written to the 256-byte buffer); 3) sets the status field of 256-byte buffer 108 to indicate that the 256-byte buffer is full; and 4) interrupts the kernel 105.


In a next step (step 303), kernel 105 responds by having the driver 106 look at the status field of the 256-byte buffer 108. If the status field indicates 256-byte buffer 108 is full and valid, then driver 106 passes the address of 256-byte buffer 108 to protocol stack 107. The first part of this 192 bytes is session layer header information, whereas the remainder of the 192 bytes is session layer data. Protocol stack 107 notifies application program 104 that there is data for the application program. Protocol stack 107 does this by making a call to the “remove_wait_queue” routine.


In a next step (step 304), the Samba application program 104 responds by returning the address of a first destination 109 in host memory. The Samba application program 104 does this by calling a socket routine called “recv”. The “recv” socket routine has several parameters: 1) a connection identifier that identifies the connection the first destination 109 will be for, 2) an address of the first destination 109 where the data will be put, and 3) the length of the first destination 109. (In some embodiments, Samba application program 104 calls “recv” to request less than 192 bytes.) Through this “recv” socket routine, kernel 105 receives from application program 104 the address of the first destination 109 and the length of the first destination 109. Kernel 105 then gives the address of the first destination 109 to the protocol stack 107.


In a next step (step 305), the protocol stack 107 moves the requested bytes in 256-byte buffer 108 to first destination 109 identified by the address. The first destination is in memory space of the application program 104 so that application program 104 can examine the requested bytes. If the application program 104 requested less than 192 bytes using “recv”, then driver 106 moves that subset of the 192 bytes to first destination 109 leaving the remainder of the 192 bytes in the 256-byte buffer. On the other hand, if the application program 104 requested all 192 bytes using “recv”, then driver 106 moves the full 192 bytes to first destination 109.


In a next step (step 306), the application examines the requested bytes in first destination 109. Application program 104 analyzes the session layer header portion, determines the amount of session layer data coming in the session layer message, and determines how long a second destination 110 should be so as to contain all the remaining session layer data of message 200. Application program 104 then returns to kernel 105 the address of second destination 110 and the length of the second destination 110. Application program 104 does this by calling the socket routine “recv”. Kernel 105 receives the address of second destination 110 and the length of the second destination 110 and gives that information to the protocol stack 107.


In a next step (step 307), the protocol stack 107 moves any session layer data in the 192 bytes (not session layer headers) in 256-byte buffer 108 to second destination 110 identified by the second address. This move of data is shown in FIG. 2 by arrow 208.


In a next step (step 308), the protocol stack 107 writes the address of second destination 110 and the length of second destination 110 into a predetermined buffer 111 in host memory. Driver 106 then writes the address of predetermined buffer 111 to a predetermined register 112 in NI device 102.


In a next step (step 309), NI device 102 reads the predetermined register 112 and retrieves the address of predetermined buffer 111. Using this address, NI device 102 reads the predetermined buffer 111 by DMA and retrieves the address of second destination 110 and the length of second destination 110.


In some embodiments, the second destination 110 is actually made up of a plurality of locations having different addresses of different lengths. The application program supplies a single virtual address for the NI device 102 to read (such as explained in step 310), but this virtual address is made up of many different physical pages. Driver 106 determines the addresses of the pages that are associated with this virtual address and passes these physical addresses and their lengths to NI device 102 by placing the addresses in predetermined buffer 111 and writing the address of predetermined buffer 111 to predetermined register 112 in NI device 102.


In a next step (step 310), NI device 102 transfers the data from the remaining portion of first packet 202 (without any session layer headers, and without any TCP or IP headers) directly into second destination 110 using DMA. In this example, the transfer is made across a parallel data bus (for example, across a PCI bus by which the NI device 102 is coupled to the host computer 100). This move of data is shown in FIG. 2 by arrow 209.


In a next step (step 311), subsequent packets are received onto NI device 102. For each packet, NI device 102 removes the TCP and IP headers and writes the remaining data (without session layer headers, TCP headers, or IP headers) directly to second destination 110 using DMA (for example, NI device 102 may write the data directly into the second destination across the PCI bus by which the NI device 102 is coupled to the host computer 100). The data from the many packets of the session layer message is written into second destination 110 such that there are no session layer headers, transport layer headers, or network layer headers between the data portions from the various packets of message 200.


In the above described specific embodiment, there is no session layer header, transport layer header, or network layer header between the data portions from the various packets of message 200 as the data portions are deposited into the second destination 110. This need not be the case, however. In some embodiments, session layer header information does appear in second destination 110. This is so because it is the application program that determines the length of the second destination 110.


In some embodiments, application program 104 returns a first destination that is larger than 192 bytes. In that case, there is no different second destination. The entire 192 bytes contained in the 256-byte buffer is moved to the first destination. The address of the remainder is given to the NI device as described above with respect to the second destination.


Although the NI device may be realized on an expansion card and interfaced to the host computer via a bus such as the PCI bus, the NI device can also be integrated into the host computer. For example, the NI device in some embodiments is disposed on the motherboard of the host computer and is substantially directly coupled to the host CPU. The NI device may, for example, be integrated into a memory controller integrated circuit or input/output integrated circuit that is coupled directly to the local bus of the host CPU. The NI device may be integrated into the Intel 82815 Graphics and Memory Controller Hub, the Intel 440BX chipset, or the Apollo VT8501 MVP4 Northbridge chip. FIG. 4 shows an NI device integrated into a host computer 400 in the form of a communication processing device (CPD) 401.


Although the present invention is described in connection with certain specific embodiments for instructional purposes, the present invention is not limited thereto. Advantages of the present invention may be realized wherein either no header information or just an insubstantial amount of header information is transferred from the network interface device into the second destination. All the data from the session layer message may be deposited into a single contiguous block of host memory (referred to as a destination) in some embodiments or may be deposited into several associated blocks (that together are referred to as a destination) of host memory in other embodiments. Accordingly, various modifications, adaptations, and combinations of various features of the described embodiments can be practiced without departing from the scope of the invention as set forth in the claims.

Claims
  • 1. A method comprising: receiving, by a network interface that is coupled to a computer, a plurality of network packets that each contain data, an Internet Protocol (IP) header and a Transmission Control Protocol (TCP) header;processing the IP and TCP headers of the packets by the network interface, including maintaining a TCP connection on the network interface corresponding to the packets and corresponding to an application running on the computer;obtaining a destination for the data in a memory of the computer, such that information that is later stored in the destination will be controlled by the application;providing an indication of the destination from the computer to the network interface; andtransferring the data to the destination, without transferring the IP headers or the TCP headers of the plurality of packets to the destination, and without processing the IP headers or the TCP headers by the computer.
  • 2. The method of claim 1, wherein the network interface and the computer both perform TCP processing for the TCP connection.
  • 3. The method of claim 1, wherein processing the IP and TCP headers of the packets by the network interface is performed by hardware fast-path processing.
  • 4. The method of claim 1, wherein obtaining the destination for the data in the memory of the computer includes providing, by the network interface to the computer, a session layer header from one of the packets.
  • 5. The method of claim 1, wherein obtaining the destination for the data in the memory of the computer includes analyzing a session layer header from one of the packets.
  • 6. The method of claim 1, wherein the application is denoted by a port number in the TCP header of the packets.
  • 7. The method of claim 1, wherein transferring the data to the destination is performed by direct memory access (DMA) of the network interface to a memory of the computer.
  • 8. A method comprising: receiving, by a network interface that is coupled to a computer, a plurality of packets that correspond to a Transmission Control Protocol (TCP) connection, each containing data, an Internet Protocol (IP) header and a TCP header, wherein the data is for a network file system application running on the computer;processing the IP and TCP headers of the packets by the network interface, including maintaining the TCP connection on the network interface;providing, by the network interface to the computer, a session layer header from one of the packets;analyzing, by the computer, the session layer header, including obtaining a destination for the data in a memory of the computer, such that information that is later stored in the destination will be controlled by the application; andtransferring the data to the destination, without transferring the IP headers or the TCP headers of the plurality of packets to the destination, and without processing the IP headers or the TCP headers by the computer.
  • 9. The method of claim 8, wherein the network interface and the computer both perform TCP processing for the TCP connection.
  • 10. The method of claim 8, wherein processing the IP and TCP headers of the packets by the network interface is performed by hardware fast-path processing.
  • 11. The method of claim 8, further comprising storing, by the network interface, the data from the packets without the IP headers or the TCP headers prior to transferring, by the network interface, the data to the destination.
  • 12. The method of claim 8, wherein the application is denoted by a port number in the TCP header of the packets.
  • 13. The method of claim 8, wherein transferring the data to the destination is performed by direct memory access (DMA) of the network interface to a memory of the computer.
  • 14. A method comprising: receiving, by a network interface that is coupled to a computer, a plurality of packets that correspond to a Transmission Control Protocol (TCP) connection, each containing data, an Internet Protocol (IP) header and a TCP header, wherein the data is for an application running on the computer;processing the IP and TCP headers of the packets by the network interface, including maintaining the TCP connection on the network interface;providing, by the network interface to the computer, a header portion of one of the packets;analyzing, by the computer, the header portion, including obtaining a destination for the data in a memory of the computer, such that information that is later stored in the destination will be controlled by the application; andtransferring the data to the destination, without transferring the IP headers or the TCP headers of the plurality of packets to the destination, and without processing the IP headers or the TCP headers by the computer.
  • 15. The method of claim 14, wherein the network interface and the computer both perform TCP processing for the TCP connection.
  • 16. The method of claim 14, wherein processing the IP and TCP headers of the packets by the network interface is performed by hardware fast-path processing.
  • 17. The method of claim 14, wherein the application is denoted by a port number in the transport layer header of the packets.
  • 18. The method of claim 14, wherein transferring the data to the destination is performed by direct memory access (DMA) of the network interface to a memory of the computer.
  • 19. The method of claim 14, wherein the header portion includes a session layer header.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit under 35 U.S.C. §120 of (is a continuation-in-part of) U.S. patent application Ser. No. 12/325,941, filed Dec. 1, 2008, which in turn claims the benefit under 35 U.S.C. §120 of (is a continuation of) U.S. patent application Ser. No. 10/881,271, filed Jun. 29, 2004, now U.S. Pat. No. 7,461,160; which in turn claims the benefit under 35 U.S.C. §120 of (is a continuation of) U.S. patent application Ser. No. 09/789,366, now U.S. Pat. No. 6,757,746, filed Feb. 20, 2001, which in turn claims the benefit under 35 U.S.C. §120 of (is a continuation-in-part of) U.S. patent application Ser. No. 09/464,283, now U.S. Pat. No. 6,427,173, filed Dec. 15, 1999; which in turn claims the benefit under 35 U.S.C. §120 of (is a continuation of) U.S. patent application Ser. No. 09/439,603, now U.S. Pat. No. 6,247,060, filed Nov. 12, 1999, which in turn claims the benefit under 35 U.S.C. §. 120 of (is a continuation of) U.S. patent application Ser. No. 09/067,544, now U.S. Pat. No. 6,226,680, filed Apr. 27, 1998; and which in turn claims the benefit under 35 U.S.C. §119(e)(1) of the Provisional Application filed under 35 U.S.C. §111(b), Ser. No. 60/061,809, filed on Oct. 14, 1997. The present application also claims the benefit under 35 U.S.C. §120 of (and is a continuation-in-part of) U.S. patent application Ser. No. 11/027,842, filed Dec. 30, 2004, which in turn claims the benefit under 35 U.S.C. §120 of (and is a continuation of) U.S. patent application Ser. No. 10/706,398, filed Nov. 12, 2003, now U.S. Pat. No. 6,941,386, which in turn claims the benefit under 35 U.S.C. §120 of (and is a continuation of) U.S. patent application Ser. No. 10/208,093, filed Jul. 29, 2002, now U.S. Pat. No. 6,697,868, which in turn claims the benefit under 35 U.S.C. §120 of (and is a continuation-in-part of) U.S. patent application Ser. No. 09/514,425, filed Feb. 28, 2000, now U.S. Pat. No. 6,427,171, which in turn claims the benefit under 35 U.S.C. §120 of (and is a continuation-in-part of): a) U.S. patent application Ser. No. 09/141,713, filed Aug. 28, 1998, now U.S. Pat. No. 6,389,479, which in turn claims the benefit under 35 U.S.C. §119 of provisional application 60/098,296, filed Aug. 27, 1998; b) U.S. patent application Ser. No. 09/067,544, filed Apr. 27, 1998, now U.S. Pat. No. 6,226,680, which in turn claims the benefit under 35 U.S.C. §119 of provisional application 60/061,809, filed Oct. 14, 1997; and c) U.S. patent application Ser. No. 09/384,792, filed Aug. 27, 1999, now U.S. Pat. No. 6,434,620, which in turn claims the benefit under 35 U.S.C. §119 of provisional application 60/098,296, filed Aug. 27, 1998. The subject matter of all of the above-identified patent applications (including the subject matter in the Microfiche Appendix of U.S. application Ser. No. 09/464,283), and of the two above-identified provisional applications, is incorporated by reference herein.

US Referenced Citations (326)
Number Name Date Kind
4366538 Johnson et al. Dec 1982 A
4485455 Boone et al. Nov 1984 A
4485460 Stambaugh Nov 1984 A
4589063 Shah et al. May 1986 A
4700185 Balph et al. Oct 1987 A
4991133 Davis et al. Feb 1991 A
5056058 Hirata et al. Oct 1991 A
5058110 Beach et al. Oct 1991 A
5097442 Ward et al. Mar 1992 A
5129093 Muramatsu et al. Jul 1992 A
5163131 Row et al. Nov 1992 A
5212778 Dally et al. May 1993 A
5274768 Traw et al. Dec 1993 A
5280477 Trapp Jan 1994 A
5281963 Ishikawa et al. Jan 1994 A
5289580 Latif et al. Feb 1994 A
5303344 Yokoyama et al. Apr 1994 A
5392391 Caulk et al. Feb 1995 A
5412782 Hausman et al. May 1995 A
5418912 Christenson May 1995 A
5448566 Richter et al. Sep 1995 A
5485455 Dobbins et al. Jan 1996 A
5485460 Schrier et al. Jan 1996 A
5485579 Hitz et al. Jan 1996 A
5506966 Ban Apr 1996 A
5511169 Suda Apr 1996 A
5517611 Deering May 1996 A
5517668 Szwerinski et al. May 1996 A
5522065 Neufeld May 1996 A
5524212 Somani et al. Jun 1996 A
5524250 Chesson et al. Jun 1996 A
5535375 Eshel et al. Jul 1996 A
5548730 Young et al. Aug 1996 A
5553241 Shirakihara Sep 1996 A
5557798 Skeen et al. Sep 1996 A
5566170 Bakke et al. Oct 1996 A
5574919 Netravali et al. Nov 1996 A
5588121 Reddin et al. Dec 1996 A
5590328 Seno et al. Dec 1996 A
5592622 Isfeld et al. Jan 1997 A
5596574 Perlman et al. Jan 1997 A
5598410 Stone Jan 1997 A
5602987 Harari et al. Feb 1997 A
5619650 Bach et al. Apr 1997 A
5629933 Delp et al. May 1997 A
5633780 Cronin May 1997 A
5634099 Andrews et al. May 1997 A
5634127 Cloud et al. May 1997 A
5642482 Pardillos Jun 1997 A
5664114 Krech, Jr. et al. Sep 1997 A
5671355 Collins Sep 1997 A
5678060 Yokoyama et al. Oct 1997 A
5682534 Kapoor et al. Oct 1997 A
5684954 Kaiserswerth et al. Nov 1997 A
5689550 Garson et al. Nov 1997 A
5692130 Shobu et al. Nov 1997 A
5699317 Sartore et al. Dec 1997 A
5699350 Kraslavsky Dec 1997 A
5701434 Nakagawa Dec 1997 A
5701516 Cheng et al. Dec 1997 A
5706514 Bonola Jan 1998 A
5724552 Taoda Mar 1998 A
5727142 Chen Mar 1998 A
5732220 Mayfield et al. Mar 1998 A
5742765 Wong et al. Apr 1998 A
5749095 Hagersten May 1998 A
5751715 Chan et al. May 1998 A
5751723 Vanden Heuvel et al. May 1998 A
5752078 Delp et al. May 1998 A
5758084 Silverstein et al. May 1998 A
5758089 Gentry et al. May 1998 A
5758186 Hamilton et al. May 1998 A
5758194 Kuzma May 1998 A
5768527 Zhu et al. Jun 1998 A
5768618 Erickson et al. Jun 1998 A
5771349 Picazo, Jr. et al. Jun 1998 A
5774660 Brendel et al. Jun 1998 A
5778013 Jedwab Jul 1998 A
5778419 Hansen et al. Jul 1998 A
5790804 Osborne Aug 1998 A
5794061 Hansen et al. Aug 1998 A
5799150 Hamilton et al. Aug 1998 A
5802258 Chen Sep 1998 A
5802580 McAlpine Sep 1998 A
5809328 Nogales et al. Sep 1998 A
5809527 Cooper et al. Sep 1998 A
5812775 Van Seters et al. Sep 1998 A
5815646 Purcell et al. Sep 1998 A
5819111 Davies et al. Oct 1998 A
5828835 Isfeld et al. Oct 1998 A
5835370 Nakamura Nov 1998 A
5848293 Gentry Dec 1998 A
5870394 Oprea Feb 1999 A
5872919 Wakeland Feb 1999 A
5878225 Bilansky et al. Mar 1999 A
5878227 Wade et al. Mar 1999 A
5892903 Klaus Apr 1999 A
5898713 Melzer et al. Apr 1999 A
5913028 Wang et al. Jun 1999 A
5915094 Kouloheris et al. Jun 1999 A
5917828 Thompson Jun 1999 A
5920566 Hendel et al. Jul 1999 A
5923759 Lee Jul 1999 A
5926642 Favor Jul 1999 A
5930830 Mendelson et al. Jul 1999 A
5931918 Row et al. Aug 1999 A
5935205 Murayama et al. Aug 1999 A
5935249 Stern et al. Aug 1999 A
5937169 Connery et al. Aug 1999 A
5941969 Ram et al. Aug 1999 A
5941972 Hoese et al. Aug 1999 A
5946708 Fang et al. Aug 1999 A
5950203 Stakuis et al. Sep 1999 A
5963876 Manssen et al. Oct 1999 A
5978844 Tsuchiya et al. Nov 1999 A
5987022 Geiger et al. Nov 1999 A
5991299 Radogna et al. Nov 1999 A
5996013 Delp et al. Nov 1999 A
5996024 Blumenau Nov 1999 A
6005849 Roach et al. Dec 1999 A
6009478 Panner et al. Dec 1999 A
6014380 Hendel et al. Jan 2000 A
6014557 Morton et al. Jan 2000 A
6016513 Lowe Jan 2000 A
6021446 Gentry, Jr. Feb 2000 A
6021507 Chen Feb 2000 A
6026452 Pitts Feb 2000 A
6034963 Minami et al. Mar 2000 A
6038562 Anjur et al. Mar 2000 A
6041058 Flanders et al. Mar 2000 A
6041381 Hoese Mar 2000 A
6044438 Olnowich Mar 2000 A
6047323 Krause Apr 2000 A
6047356 Anderson et al. Apr 2000 A
6049528 Hendel et al. Apr 2000 A
6057863 Olarig May 2000 A
6061368 Hitzelberger May 2000 A
6065096 Day et al. May 2000 A
6067569 Khaki et al. May 2000 A
6067595 Lindenstruth May 2000 A
6070200 Gates et al. May 2000 A
6078564 Lakshman et al. Jun 2000 A
6078733 Osborne Jun 2000 A
6085234 Pitts et al. Jul 2000 A
6097734 Gotesman et al. Aug 2000 A
6101555 Goshey et al. Aug 2000 A
6111673 Chang et al. Aug 2000 A
6115615 Ota et al. Sep 2000 A
6122670 Bennett et al. Sep 2000 A
6141701 Whitney Oct 2000 A
6141705 Anand et al. Oct 2000 A
6145017 Ghaffari Nov 2000 A
6157944 Pedersen Dec 2000 A
6157955 Narad et al. Dec 2000 A
6172980 Flanders et al. Jan 2001 B1
6172981 Cox et al. Jan 2001 B1
6173333 Jolitz et al. Jan 2001 B1
6178483 Runaldue et al. Jan 2001 B1
6181705 Branstad et al. Jan 2001 B1
6185215 Aho Feb 2001 B1
6202105 Gates et al. Mar 2001 B1
6219693 Napolitano et al. Apr 2001 B1
6223242 Sheafor et al. Apr 2001 B1
6226680 Boucher et al. May 2001 B1
6233242 Mayer et al. May 2001 B1
6233543 Butts et al. May 2001 B1
6243667 Kerr et al. Jun 2001 B1
6246683 Connery et al. Jun 2001 B1
6247060 Boucher et al. Jun 2001 B1
6279051 Gates et al. Aug 2001 B1
6289023 Dowling et al. Sep 2001 B1
6298403 Suri et al. Oct 2001 B1
6301612 Selitrennikoff et al. Oct 2001 B1
6324649 Eyres et al. Nov 2001 B1
6334153 Boucher et al. Dec 2001 B2
6343345 Hilla et al. Jan 2002 B1
6343360 Feinleib Jan 2002 B1
6345301 Burns et al. Feb 2002 B1
6345302 Bennett et al. Feb 2002 B1
6356951 Gentry, Jr. Mar 2002 B1
6370114 Gullicksen et al. Apr 2002 B1
6370599 Anan et al. Apr 2002 B1
6385647 Willis et al. May 2002 B1
6389468 Muller et al. May 2002 B1
6389479 Boucher et al. May 2002 B1
6393487 Boucher et al. May 2002 B2
6418169 Datari Jul 2002 B1
6421742 Tillier Jul 2002 B1
6421753 Hoese et al. Jul 2002 B1
6427169 Elzur Jul 2002 B1
6427171 Craft et al. Jul 2002 B1
6427173 Boucher et al. Jul 2002 B1
6430626 Witkowski et al. Aug 2002 B1
6434620 Boucher et al. Aug 2002 B1
6434651 Gentry, Jr. Aug 2002 B1
6449656 Elzur et al. Sep 2002 B1
6452915 Jorgensen Sep 2002 B1
6453360 Muller et al. Sep 2002 B1
6453406 Sarnikowski et al. Sep 2002 B1
6470397 Shah et al. Oct 2002 B1
6470415 Starr et al. Oct 2002 B1
6473425 Bellaton et al. Oct 2002 B1
6480489 Muller et al. Nov 2002 B1
6483804 Muller et al. Nov 2002 B1
6487202 Klausmeier et al. Nov 2002 B1
6487654 Dowling Nov 2002 B2
6490631 Teich et al. Dec 2002 B1
6502144 Accarie Dec 2002 B1
6523119 Pavlin et al. Feb 2003 B2
6526446 Yang et al. Feb 2003 B1
6542504 Mahler et al. Apr 2003 B1
6570884 Connery et al. May 2003 B1
6591302 Boucher et al. Jul 2003 B2
6591310 Johnson Jul 2003 B1
6594261 Boura et al. Jul 2003 B1
6631484 Born Oct 2003 B1
6648611 Morse et al. Nov 2003 B2
6650640 Muller et al. Nov 2003 B1
6657757 Chang et al. Dec 2003 B1
6658480 Boucher et al. Dec 2003 B2
6678283 Teplitsky Jan 2004 B1
6681364 Calvignac et al. Jan 2004 B1
6683851 Willkie et al. Jan 2004 B1
6687758 Craft et al. Feb 2004 B2
6697366 Kim Feb 2004 B1
6697868 Craft et al. Feb 2004 B2
6748502 Watanabe et al. Jun 2004 B2
6751665 Philbrick et al. Jun 2004 B2
6757746 Boucher et al. Jun 2004 B2
6765901 Johnson et al. Jul 2004 B1
6807581 Starr et al. Oct 2004 B1
6842896 Redding et al. Jan 2005 B1
6862264 Moura et al. Mar 2005 B1
6912522 Edgar Jun 2005 B2
6938092 Burns Aug 2005 B2
6941386 Craft et al. Sep 2005 B2
6965941 Boucher et al. Nov 2005 B2
6976148 Arimilli et al. Dec 2005 B2
6980545 Lindgren et al. Dec 2005 B1
6996070 Starr et al. Feb 2006 B2
7016361 Swonk et al. Mar 2006 B2
7042898 Blightman et al. May 2006 B2
7047320 Arimilli et al. May 2006 B2
7073196 Dowd et al. Jul 2006 B1
7076568 Philbrick et al. Jul 2006 B2
7089326 Boucher et al. Aug 2006 B2
7093099 Bodas et al. Aug 2006 B2
7124205 Craft et al. Oct 2006 B2
7133940 Blightman et al. Nov 2006 B2
7167926 Boucher et al. Jan 2007 B1
7167927 Philbrick et al. Jan 2007 B2
7174393 Boucher et al. Feb 2007 B2
7181531 Pinkerton et al. Feb 2007 B2
7185266 Blightman et al. Feb 2007 B2
7187679 Dally et al. Mar 2007 B2
7191241 Boucher et al. Mar 2007 B2
7191318 Tripathy et al. Mar 2007 B2
7237036 Boucher et al. Jun 2007 B2
7254696 Mittal et al. Aug 2007 B2
7260518 Kerr et al. Aug 2007 B2
7283522 Siddabathuni Oct 2007 B2
7284070 Boucher et al. Oct 2007 B2
7287092 Sharp Oct 2007 B2
7337241 Boucher et al. Feb 2008 B2
7461160 Boucher et al. Dec 2008 B2
7472156 Philbrick et al. Dec 2008 B2
7496689 Sharp et al. Feb 2009 B2
7502869 Boucher et al. Mar 2009 B2
7519699 Jain et al. Apr 2009 B2
7543087 Philbrick et al. Jun 2009 B2
7584260 Craft et al. Sep 2009 B2
7620726 Craft et al. Nov 2009 B2
7627001 Craft et al. Dec 2009 B2
7627684 Boucher et al. Dec 2009 B2
7640364 Craft et al. Dec 2009 B2
7664868 Boucher et al. Feb 2010 B2
7664883 Craft et al. Feb 2010 B2
7673072 Boucher et al. Mar 2010 B2
7694024 Philbrick et al. Apr 2010 B2
7738500 Jones et al. Jun 2010 B1
7809847 Boucher et al. Oct 2010 B2
7844743 Craft et al. Nov 2010 B2
7853723 Boucher et al. Dec 2010 B2
20010004354 Jolitz Jun 2001 A1
20010013059 Dawson et al. Aug 2001 A1
20010014892 Gaither et al. Aug 2001 A1
20010014954 Purcell et al. Aug 2001 A1
20010025315 Jolitz Sep 2001 A1
20010037406 Philbrick et al. Nov 2001 A1
20010048681 Bilic et al. Dec 2001 A1
20010053148 Bilic et al. Dec 2001 A1
20020073223 Darnell et al. Jun 2002 A1
20020112175 Makofka et al. Aug 2002 A1
20020156927 Boucher et al. Oct 2002 A1
20030014544 Pettey Jan 2003 A1
20030046330 Hayes Mar 2003 A1
20030066011 Oren Apr 2003 A1
20030067903 Jorgensen Apr 2003 A1
20030110344 Szczepanek et al. Jun 2003 A1
20030165160 Minami et al. Sep 2003 A1
20040010712 Hui et al. Jan 2004 A1
20040042458 Elzu Mar 2004 A1
20040042464 Elzur et al. Mar 2004 A1
20040049580 Boyd et al. Mar 2004 A1
20040049601 Boyd et al. Mar 2004 A1
20040054814 McDaniel Mar 2004 A1
20040059926 Angelo et al. Mar 2004 A1
20040088262 Boucher et al. May 2004 A1
20040153578 Elzur Aug 2004 A1
20040158640 Philbrick et al. Aug 2004 A1
20040210795 Anderson Oct 2004 A1
20040213290 Johnson et al. Oct 2004 A1
20040246974 Gyugyi et al. Dec 2004 A1
20040249957 Ekis et al. Dec 2004 A1
20050060538 Beverly Mar 2005 A1
20050144300 Craft et al. Jun 2005 A1
20060133386 McCormack et al. Jun 2006 A1
20060248208 Walbeck et al. Nov 2006 A1
20070083682 Bartley et al. Apr 2007 A1
20070140240 Dally et al. Jun 2007 A1
20080043732 Desai et al. Feb 2008 A1
20080170501 Patel et al. Jul 2008 A1
20080209084 Wang et al. Aug 2008 A1
20080240111 Gadelrab Oct 2008 A1
20090063696 Wang et al. Mar 2009 A1
20090086732 Boucher et al. Apr 2009 A1
Foreign Referenced Citations (16)
Number Date Country
689138 Dec 1995 EP
689139 Dec 1995 EP
695993 Feb 1996 EP
WO 9819412 May 1998 WO
WO 9850852 Nov 1998 WO
WO 9904343 Jan 1999 WO
WO 9965219 Dec 1999 WO
WO 0013091 Mar 2000 WO
WO 0104770 Jan 2001 WO
WO 0105107 Jan 2001 WO
WO 0105116 Jan 2001 WO
WO 0105123 Jan 2001 WO
WO 0140960 Jun 2001 WO
WO 0159966 Aug 2001 WO
WO 0186430 Nov 2001 WO
WO 2007130476 Nov 2007 WO
Non-Patent Literature Citations (88)
Entry
Beach, Bob. “UltraNet: An Architecture for Gigabit Networking.” IEEE Computer Society Press publication from 15th Conference on Local Computer Networks. Sep. 30-Oct. 3, 1990. 18 pages.
Chesson, et al. “The Protocol Engine Chipset.” IEEE Symposium Record from Hot Chips III. Aug. 26-27, 1991. 16 pages.
MacLean et al. “An Outboard Processor for High Performance Implementation of Transport Layer Protocols.” IEEE Global Telecommunications Conference, Globecom '91, presentation. Dec. 2-5, 1991. 7 pages.
Ross et al. “FX1000: A high performance single chip Gigabit Ethernet NIC.” IEEE article from Compcon '97 Proceedings. Feb. 23-26, 1997. 7 pages.
Strayer et al. “Ch. 9: The Protocol Engine.” From XTP: The Transfer Protocol. Jul. 1992. 12 pages.
Publication entitled “Protocol Engine Handbook.” Oct. 1990. 44 pages.
Koufopavlou et al. “Parallel TCP for High Performance Communication Subsystems.” IEEE Global Telecommunications Conference, Globecom '92, presentation. Dec. 6-9, 1992. 7 pages.
Lilienkamp et al. “Proposed Host-Front End Protocol.” Dec. 1984. 56 pages.
Thia et al. “High-Speed OSI Protocol Bypass Algorithm with Window Flow Control.” Protocols for High Speed Networks. 1993. pp. 53-68.
Jolitz, William et al. “TCP/IP Network Accelerator and Method of Use.” filed Jul. 17, 1997. U.S. Appl. No. 60/053,240.
Thia et al. “A Reduced Operational Protocol Engine (ROPE) for a multiple-layer bypass architecture.” Protocols for High Speed Networks. 1995. pp. 224-239.
Form 10-K for Exelan, Inc., for the fiscal year ending Dec. 31, 1987. 10 pages.
Form 10-K for Exelan, Inc., for the fiscal year ending Dec. 31, 1988. 10 pages.
Merritt, Rick. “Ethernet Interconnect Outpacing Infiniband at Intel.” EE Times article. Sep. 11, 2002. 9 pages.
Starr, David D. et al. “Intelligent Network Storage Interface Device.” for U.S. Appl. No. 09/675,700. Confirmation No. 9585; filed Sep. 29, 2000.
Boucher, Laurence B. et al. “Intelligent Network Interface System and Method for Accelerated Protocol Processing.” U.S. Appl. No. 09/692,561. Confirmation No. 5890; filed Oct. 18, 2000.
Craft, Peter K. et al. “Transferring Control of TCP Connections Between Hierarchy of Processing Mechanisms.” U.S. Appl. No. 11/249,006. Confirmation No. 3046; filed Oct. 11, 2005.
Starr, Daryl D. et al. “Accelerating Data Transfer in a Virtual Computer System with Tightly Coupled TCP Connections.” U.S. Appl. No. 12/410,366. Confirmation No. 3065; filed Mar. 24, 2009.
Craft, Peter, K. et al. “TCP Offload Send Optimization.” U.S Appl. No. 12/504,021, Confirmation No. 9303; filed Jul. 16, 2009.
Craft, Peter K. et al. “TCP Offload Device the Batches Session Layer Headers to Reduce Interrupts as Well as CPU Copies.” U.S. Appl. No. 12/581,342, Confirmation No. 2393; filed Oct. 19, 2009.
Philbrick, Clive M. et al. “Freeing Transmit Memory on a Network Interface Device Prior to Receiving an Acknowledgment That Transmit Data Has Been Received by a Remote Device.” U.S. Appl. No. 12/470,980. Confirmation Number: 4934; filed May 22, 2009.
Boucher, Laurence B. et al. “Obtaining a Destination Address So That a Network Interface Device Can Write Network Data Without Headers Directly Into Host Memory.” U.S. Appl. No. 12/325,941. Confirmation Number: 2493; filed Dec. 1, 2008.
Boucher, Laurence B. et al. “Enabling an Enhanced Function of an Electronic Device.” U.S. Appl. No. 11/985,948. Confirmation Number: 9878; filed Nov. 19, 2007.
Starr, Daryl D. et al. “Network Interface Device With 10 Gb/s Full-Duplex Transfer Rate.” U.S. Appl. No. 11/799,720. Confirmation Number: 6200; filed May 1, 2007.
Craft, Peter K. et al. “Peripheral Device That DMAS the Same Data to Different Locations in a Computer.” U.S. Appl. No. 11/788,719. Confirmation Number: 5750; filed Apr. 19, 2007.
Starr, Daryl D. et al. “TCP/IP Offload Device With Reduced Sequential Processing.” U.S. Appl. No. 11/348,810. Confirmation No. 8739; filed Feb. 6, 2006.
Craft, Peter K. et al. “Protocol Stack That Offloads a TCP Connection From a Host Computer to a Network Interface Device.” U.S. Appl. No. 11/027,842. Confirmation No. 6231; filed Dec. 30, 2004.
Boucher, Laurence B. et al. “Method and Apparatus for Dynamic Packet Batching With a High Performance Network Interface.” U.S. Appl. No. 10/678,336. Confirmation No. 9798; filed Oct. 3, 2003.
Philbrick Clive M. et al. “Method and Apparatus for Data Re-Assembly With a High Performance Network Interface.” U.S. Appl. No. 10/634,062. Confirmation No. 5537; filed Aug. 4, 2003.
Boucher, Laurence B. et al. “High Network Interface Device and System for Accelerated Communication.” U.S. Appl. No. 10/601,237. Confirmation No. 9286; filed Jun. 19, 2003.
Boucher, Laurence B. et al. “Method and Apparatus for Distributing Network Traffic Processing on a Multiprocessor Computer.” U.S. Appl. No. 10/438,719. Confirmation No. 7151; filed May 14, 2003.
Boucher, Laurence B. et al. “Parsing a Packet Header.” U.S. Appl. No. 10/277,604. Confirmation No. 7644; filed Oct. 18, 2002.
Starr, Daryl D.. et al. “Intelligient Network Storage Interface System.” U.S. Appl. No. 10/261,051. Confirmation No. 6753; filed Sep. 30, 2002.
Chandranmenon, Girish P. et al. “Trading Packet Headers for Packet Processing.” IEEE/ACM Transactions on Networking, vol. 4, No. 2. Apr. 1996. pp. 141-152.
U.S. Appl. No. 08/964,304, entitled “File Array Storage Architecture.” filed Nov. 4, 1997. Inventors Napolitano et al.
The Final Office Action for U.S. Appl. No. 11/027,842 mailed on Dec. 3, 2010.
Stevens, et al., “TCP/IP Illustrated, vol. 2.” pp. 754-757 1995.
Stevens, Richard. “TCP/IP Illustrated, vol. 1.” Chapters 1 and 17. Published 1994; 13th printing. 1999.
“Hardware Assisted Protocol Processing”, (which Eugene Feinber is working on). Downloaded from the internet and printed on Nov. 25, 1998. 1 page.
“Z85C30 CMOS SCC Serial Communication Controller”, Zilog Inc. Zilog product Brief. 1997. 3 pages.
“Smart LAN Work Requests.” Internet pages of Xpoint Technologies, Inc. printed Dec. 19, 1997. 5 pages.
“Asante and 100BASE-T Fast Ethernet.” Internet pages printed May 27, 1997. 7 pages.
“A Guide to the Paragon XP/S-A7 Supercomputer at Indiana University.” Internet pages printed Dec. 21, 1998. 13 pages.
Stevens, Richard. “TCP/IP Illustrated, vol. 1, The Protocols.” 1994. pp. 325-326.
“Northridge/Southbridge vs. Intel Hub Architecture.” Internet pages printed Feb. 19, 2001. 4 pages.
“Gigabit Ethernet Technical Brief, Achieving End-to-End Performance.” Alteon Networks, Inc., First Edition. Sep. 1996. 15 pages.
“Technical Brief on Alteon Ethernet Gigabit NIC Technology.” Internet pages downloaded from www.alteon.com. Printed Mar. 15, 1997. 14 pages.
“VT8501 Apollo MVP4.” VIA Technologies, Inc. Revision 1.3. Feb. 1, 2000. pp. i-iv, 1-11, cover and copyright page.
“iReady Rounding Out Management Team with Two Key Executives.” iReady News Archives article downloaded from http://www.ireadyco.com/archives/keyexec.html. Printed Nov. 28, 1998. 2 pages.
“The Internet Tuner.” Internet pages from iReady Products, web sitehttp://www.ireadyco.com/products2html. Printed Nov. 25, 1998. 2 pages.
iReady News Archives, Toshiba, iReady shipping Internet chip. Printed Nov. 25, 1998. 1 page.
“Technology.” Interprophet article downloaded fromhttp://www.interprophet.com/technology.html. Printed Mar. 1, 2000. 17 pages.
“The I-1000 Internet Tuner.” iReady Corporation article. Date unknown. 2 pages.
“About Us Introduction.” iReady article downloaded from the internet http://www.iReadyco.com/about.html. Pritned Nov. 25, 1998. 3 pages.
“Revolutionary Approach to Consumer Electronics Internet Connectivity Funded.” iReady News Archive article. San Jose, California. Nov. 20, 1997 (printed Nov. 2, 1998). 2 pages.
“Seiko Instruments Inc. (SII) Introduces World's First Internet-Ready Intelligent LCD Modules Based on iReady Technology.” iReady News Archive article. Santa Clara, CA and Chiba, Japan. Oct. 26, 1998 (printed Nov. 2, 1998). 2 pages.
“iReady internet Tuner to Web Enable Devices.” NEWSwatch article. Tuesday, Nov. 5, 1996 (printed Nov. 2, 1998). 2 pages.
Lammers, David. “Tuner for Toshiba, Toshiba Taps iReady for Internet Tuner.” EE Times article. Printed Nov. 2, 1998. 2 pages.
Carbone, J.S. “Comparison of Novell Netware and TCP/IP Protocol Architectures.” Printed Apr. 10, 1998. 19 pages.
“AEA-7110C-a DuraSAN product.” Adaptec article. Printed Oct. 1, 2001. 11 pages.
“iSCSI and 2Gigabit fibre Channel Host Bus Adapters from Emulex, QLogic, Adaptec, JNI.” iSCSI HBA article. Printed Oct. 1, 2001. 8 pages.
“FCE-3210/6410 32 and 64-bit PCI-to-Fibre Channel HBA.” iSCSI HBA article. Printed Oct. 1, 2001. 6 pages.
“iSCSI Storage.” ISCSI.com article. Pritned Oct. 1, 2001. 2 pages.
Kalampoulkas et al. “Two-Way TCP Traffic Over Rate Controlled Channels: Effects and Analysis.” IEEE Transactions on Networking. vol. 6, No. 6. Dec. 1998. 17 pages.
“Toshiba Delivers First Chips to Make Consumer Devices Internet-Ready Based on iReady Design.” IReady News article. Santa Clara, CA, and Tokyo, Japan. Oct. 14, 1998 (printed Nov. 2, 1998). 3 pages.
Jolitz, Lynne. “Frequently Asked Questions.” Internet pages of InterProphet. Printed Jun. 14, 1999. 4 pages.
Hitz et al. “File System Design for an NFS File Server Appliance.” Winter of 1992. 13 pages.
“Adaptec Announces EtherStorage Technology.” Adaptec Press Release article. May 4, 2000 (printed Jun. 15, 2000). 2 pages.
“EtherStorage Frequently Asked Questions.” Adapted article. Printed Jul. 19, 2000. 5 pages.
“EtherStorage White Paper.” Adapted article. Printed Jul. 19, 2000. 7 pages.
Berlino, J. et al. “Computers; Storage.” CIBC World Markets article. Aug. 7, 2000. 9 pages.
Milunovich, S. Merrill Lynch article entitled “Storage Futures.” Merrill Lynch article. May 10, 2000. 22 pages.
Taylor, S. “Montreal Start-Up Battles Data Storage Bottleneck.” CBS Market Watch article. Mar. 5, 2000 (printed Mar. 7, 2000). 2 pages.
Satran, J. et al. “SCSI/TCP (SCSI over TCP).” Internet-draft article. Feb. 2000 (printed May 19, 2000). 38 pages.
“Technical White Paper-Xpoint's Disk to LAN Acceleration Solution for Windows NT Server.” Internet pages. Printed Jun. 5, 1997. 14 pages.
Harrer, Christopher et al. “Network Accelerator Chip Architecture, twelve-slide presentation.” Jato Technologies article. Printed Aug. 19, 1998. 13 pages.
“Enterprise System Uses Flexible Spec.” EETimes article. Aug. 10, 1998 (printed Nov. 25, 1998). 3 pages.
“Smart Ethernet Network Interface Cards,” which Berend Ozceri is developing. Internet pages. Printed Nov. 25, 1998. 2 pages.
“GigaPower Protocol Processor Product Review.” Internet pages of Xaqti corporation. Printed Nov. 25, 1999. 4 pages.
Oren, Amit (inventor). Assignee: Siliquent Technologies Ltd. “CRC Calculations for Out of Order PUDs.” U.S. Appl. No. 60/283,896, filed Apr. 12, 2003.
Walsh, Robert J. “DART: Fast Application Level Networking via Data-Copy Avoidance.” Internet pages. Printed Jun. 3, 1999. 25 pages.
Tanenbaum, Andrew S. Computer Networks, Third Edition, ISBN 0-13-349945-6. Mar. 6, 1996.
Druschel, Peter et al. “LRP: A New Network Subsystem Architecture for Server Systems.” Article from Rice University. Oct. 1996. 14 pages.
“TCP Control Block Interdependence.” Internet RFC/STD/FYI/BCP Archives article with heading “RFC2140” web address http://www.faqs.org/rfcs/rfc2140.html. Printed Sep. 2, 2002. 9 pages.
“Tornado: for Intelligent Network Acceleration.” WindRiver article. Copyright Wind River Systems. 2001. 2 pages.
“Complete TCP/IP Offload for High-Speed Ethernet Networks.” WindRiver White Paper. Copyright Wind River Systems. 2002. 7 pages.
“Solving Server Bottlenecks with Intel Server Adapters.” Intel article. Copyright Intel Corporation. 1999. 8 pages.
Schwaderer et al. “XTP in VLSI Protocol Decomposition for ASIC Implementation.” IEEE Computer Society Press publication from 15th Conference on Local Computer Networks. Sep. 30-Oct. 3, 1990. 5 pages.
Related Publications (1)
Number Date Country
20110280243 A1 Nov 2011 US
Provisional Applications (2)
Number Date Country
60061809 Oct 1997 US
60098296 Aug 1998 US
Continuations (7)
Number Date Country
Parent 10881271 Jun 2004 US
Child 12325941 US
Parent 09789366 Feb 2001 US
Child 10881271 US
Parent 09439603 Nov 1999 US
Child 09464283 US
Parent 09067544 Apr 1998 US
Child 09439603 US
Parent 13108729 US
Child 09439603 US
Parent 10706398 Nov 2003 US
Child 11027842 US
Parent 10208093 Jul 2002 US
Child 10706398 US
Continuation in Parts (7)
Number Date Country
Parent 12325941 Dec 2008 US
Child 13108729 US
Parent 09464283 Dec 1999 US
Child 09789366 US
Parent 11027842 Dec 2004 US
Child 13108729 US
Parent 09514425 Feb 2000 US
Child 10208093 US
Parent 09141713 Aug 1998 US
Child 09514425 US
Parent 13108729 US
Child 09514425 US
Parent 09067544 Apr 1998 US
Child 13108729 US