TCP offload device that batches session layer headers to reduce interrupts as well as CPU copies

Information

  • Patent Grant
  • 9306793
  • Patent Number
    9,306,793
  • Date Filed
    Monday, October 19, 2009
    15 years ago
  • Date Issued
    Tuesday, April 5, 2016
    8 years ago
Abstract
A TCP offload system is disclosed including apparatuses and methods for batching session (sometimes called application) layer headers to reduce interrupts as well as CPU copies. One embodiment includes receiving a plurality of TCP packets, comprising processing the packets by TCP, including removing TCP headers from TCP data, associating the TCP data with a TCP connection for an application, and updating a TCP control block (TCB) that defines the TCP connection; locating a plurality of upper layer headers in the TCP data, the headers each corresponding to application data contained in the packets, wherein the plurality of upper layer headers correspond to a protocol that is higher than TCP; processing the plurality of upper layer headers by the application to obtain memory locations for the application data; and placing the application data in the locations, after the processing of the plurality of upper layer headers by the application.
Description
BACKGROUND AND DISCLOSURE OF THE INVENTION

This invention relates to network communication, for example serial communication between devices using a protocol such as Transmission Control Protocol (TCP).


TCP has been employed for decades and has increased in popularity, or at least in usage, over the years. An advantage of TCP is its guaranteed delivery of error free data. Unfortunately, this guarantee comes with a price of greater complexity relative to some other network protocols. Such complexity can slow TCP communication, or at least make it difficult for TCP to be used as network data rates increase, for example from 100 MB/s ten years ago to 10 GB/s currently. Moreover, even for a 100 MB/s transmission line rate that was conventional ten years ago, TCP processing at the endpoints of the network proved a bottleneck that slowed network communication, as well as consumed inordinate CPU cycles.


A solution to the TCP bottleneck was provided by Alacritech, Inc., which offloaded established TCP connections from the host CPU to hardware that could process data transfer much more rapidly, significantly increasing TCP data transfer rates while reducing CPU utilization. Descriptions and claims to such a solution can be found in multiple patents, including U.S. Pat. Nos. 7,337,241; 7,284,070; 7,254,696; 7,237,036; 7,191,318; 7,191,241; 7,185,266; 7,174,393; 7,167,927; 7,167,926; 7,133,940; 7,124,205; 7,093,099; 7,089,326; 7,076,568; 7,042,898; 6,996,070; 6,965,941; 6,941,386; 6,938,092; 6,807,581; 6,757,746; 6,751,665; 6,697,868; 6,687,758; 6,658,480; 6,591,302; 6,470,415; 6,434,620; 6,427,173; 6,427,171; 6,393,487; 6,389,479; 6,334,153; 6,247,060; and 6,226,680, which are incorporated by reference herein.


For a situation in which an application is running on a host CPU while a TCP connection for that application is handled by a network interface card (NIC), however, communications between the host and the device could sometimes hamper performance. For example, to receive data for an offloaded connection, the network interface card would “indicate” a small amount of data that included a session layer header to the host. The host would move that small amount of data, via the device driver and the host's TCP/IP stack, to the application, which would then process the session layer header to allocate buffers for the data corresponding to the session layer header. The card could then place the data, by direct memory access (DMA), into the buffers allocated by the application, so that the host CPU could completely avoid copying the application data. This was sometimes termed a “zero-copy receive.”


Zero-copy receive works particularly well for receiving relatively large blocks of data transported in multiple packets, in which case the data can be placed in a destination with relatively few interrupts. But for relatively small blocks of data transported in one or two packets, the interrupts generated when the session layer headers and data cross an input/output (I/O) bus can impair performance. The present inventors have discovered that one reason for this is that interrupt aggregation, which may otherwise allow several received packets to be passed from a NIC to a host CPU with a single interrupt, can be rendered ineffective by the sequential transport of session layer headers across the I/O bus, each of which needs to be processed by an application before the next session layer header is transported over the I/O bus.


In the case of a solicited receive, in which the data being received is in response to a read request, there is an opportunity to pre-post a receive buffer along with the request. That is, because the application will be receiving data that it has requested, a buffer for that data can be allocated at the time the request is made. This allows the response to be placed in the appropriate memory location when the response arrives, without processing the session layer header by the application. For an unsolicited receive, however, a mechanism does not exist to pre-allocate a buffer or buffers for incoming data, because the amount of data and the aspect of the application that is involved are not known before the data is received. Moreover, as a practical matter, pre-posting buffers for solicited receives is not widely employed by current commercial applications, so that the performance issues described above affect more than merely unsolicited receives.


The most common applications that use TCP, such as Server Message Block (SMB) and Common Internet File System (CIFS), Network File System (NFS), and Internet Small Computer System Interface (iSCSI), all have certain aspects in common. Data sent by a client (or initiator) to a server (or target), is comprised of a session layer header (sometimes called an application header), possibly followed by session layer data (sometimes called application data). When session-layer data exists, the session layer header describes the nature and length of the data. Since these session layer headers and data exist within the TCP data stream, they can be located anywhere in received TCP packet.


Because TCP is a byte-stream protocol that is designed to deliver data in the correct order to the applications above it, which are designed to process that data in order, having session layer headers located anywhere in received TCP packet is usually immaterial, because the application simply processes the data in order as it works its way through packets. But an issue exists for offloaded TCP, as mentioned above, because the sequential processing of session layer headers and data can result in extra interrupts for relatively small data blocks.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a schematic diagram of a prior art series of packets received for a TCP connection, including headers and data.



FIG. 2 shows a schematic diagram of a method for processing a series of packets such as those shown in FIG. 1.



FIG. 3 shows a schematic diagram of a system for processing a series of packets such as those shown in FIG. 1.



FIG. 4 shows a block diagram of a system for processing a series of packets such as those shown in FIG. 1.





DETAILED DESCRIPTION

An example of the issue and some solutions that have been developed may be instructive at this point. Note that while this example centers around data sent from an iSCSI initiator to an iSCSI target, the same logic applies in the other direction (iSCSI target to iSCSI initiator). Furthermore the same reasoning also applies to other applications that share a similar format (session-layer header followed by session layer payload), including both SMB/CIFS and NFS. Moreover, while TCP is discussed as the transport layer protocol, other similar connection-based, byte-stream protocols could instead be employed.


In the example shown in FIG. 1, three iSCSI Protocol Data Units (PDUs) for a particular TCP connection have been received by an iSCSI target. These PDUs include an iSCSI write request with 4 KB of application data, an iSCSI read request, and a subsequent 4 KB iSCSI write request. Assuming a standard Ethernet maximum transmission unit (MTU) size of approximately 1.5 KB and no IP or TCP options, the corresponding packets on the wire would appear as shown in FIG. 1.


Packet #1 includes MAC, IP and TCP headers 21 totaling 54 B, the iSCSI write request #1 session layer header 22 of 48 B, and the first 1412 B of the iSCSI write request #1 payload 23. Packet #2 includes MAC, IP and TCP headers 24 totaling 54 B, and the next 1460 B of the iSCSI write request #1 payload 25. Packet #3 includes MAC, IP and TCP headers 26 totaling 54 B, the last 1224 B of the iSCSI write request #1 payload 27, the iSCSI read request session layer header 28 of 48 B, the iSCSI write request #2 session layer header 29 of 48 B, and the first 140 B of the iSCSI write request #2 payload 30. Packet #4 includes MAC, IP and TCP headers 31 totaling 54 B, and the next 1460 B of the iSCSI write request #2 payload 32. Packet #5 includes MAC, IP and TCP headers 33 totaling 54 B, and the next 1460 B of the iSCSI write request #2 payload 34. Finally, packet #6 includes MAC, IP and TCP headers 35 totaling 54 B, and the remaining 1036 B of the iSCSI write request #2 payload 36.


Thus, one can see that the first 4 KB write spans the first three packets (1412 bytes of the first, 1460 of the second, and 1224 of the third, totaling 4096 bytes). This places the subsequent iSCSI headers at offsets 1278 and 1326 into the third packet respectively. Then, the second iSCSI request spans packets 3, 4, 5, and 6, again totaling 4096 bytes.


Conventionally, the above packets would typically have been processed as follows:


1) One or more packets will be received by the NIC and DMAd into packet buffers allocated by the NIC device driver. Assuming a fast network, and some amount of interrupt latency (interrupt aggregation enabled), this could include all six of the above packets. The remainder of this example assumes this to be the case.


2) Interrupt occurs.


3) The NIC device driver delivers all six packets to the protocol stack (Microsoft's TCPIP.SYS for example).


4) The protocol stack processes the MAC, IP, and TCP protocol headers (21, 24, 26, 31, 33 and 35), and “indicates” the TCP payload, starting with the first iSCSI write request, up to the iSCSI target software.


5) iSCSI target software processes the iSCSI Write Request #1 header 22, locates the memory location for iSCSI payload (23, 25 and 27), and passes this memory location down to the protocol stack.


6) The protocol stack copies, using the host processor, the payload (23, 25 and 27) for iSCSI write request #1 from packets 1, 2 and 3, into the memory location specified by the iSCSI target software.


7) The protocol stack completes this posted buffer and indicates the remainder of packet #3 to the iSCSI target software.


8) The iSCSI target software processes the iSCSI read request 28 and the second iSCSI write request 29, locates the memory location for the iSCSI write #2 payload (30, 32, 34 and 36) and passes this memory location down to the stack.


9) The protocol stack copies the application data (30, 32, 34 and 36) from packets 3, 4, 5 and 6 into this memory location and completes the posted buffer.


With the use of TCP offload, for example a TCP offload engine (TOE) device such as that invented by Alacritech in conjunction with a Microsoft® TCP Chimney protocol stack, there is an opportunity to eliminate the data copies in steps 6 and 9 in the above sequence of operations. As one example, the following may occur:


1) TOE device processes the MAC, IP and TCP headers (21, 24, 26, 31, 33 and 35) of each packet.


2) TOE device interrupts the host and delivers the TCP payload of Packet #1, including iSCSI Write Request #1 and iSCSI Write #1 payload of Packet #1 (22 and 23), to the device driver.


3) Device driver and protocol stack deliver TCP payload of Packet #1 (22 and 23) to iSCSI target software.


4) iSCSI target software processes Write Request 22, locates the memory location for iSCSI payload 23, and passes this memory location down to the protocol stack and TOE device driver.


5) TOE device driver passes this memory location to the TOE device.


6) TOE device DMAs the payload (23, 25 and 27) for iSCSI write #1 directly into the memory location specified by the iSCSI target software.


7) TOE device interrupts the host, completes the posted buffer for iSCSI write #1 and delivers the remainder of packet #3 which contains the iSCSI headers for the iSCSI read 28 and the second iSCSI write 29.


8) The TCP data from packet #3 (28, 29 and 30) is delivered to the iSCSI target software.


9) iSCSI target software processes iSCSI headers (28 and 29), locates memory location for iSCSI payload and passes this memory location down to the stack and TOE device driver.


10) TOE device driver passes this memory location to the TOE device.


11) TOE device DMAs the payload (30, 32, 34 and 36) for iSCSI write #2 directly into the memory location specified by the iSCSI target software.


12) TOE device interrupts the host, and completes the posted buffer for iSCSI write #2.


An issue with this approach is that eliminating these data copies comes at the expense of extra interrupts, as well as associated trips through the stack and device driver. In the prior conventional sequence of events there is a single interrupt and a single indication from the network device driver up to the TCPIP stack. In the sequence of events described immediately above, there are three interrupts—the original indication, the first buffer completion and second data indication, and lastly the second buffer completion. Furthermore, while the posted buffer in the first sequence of operations is only handed down as far as the stack, in the second sequence of operations it gets passed down to the device driver and out to the card as well, each portion of which requires some amount of overhead.


These two scenarios illustrate a trade-off between “batching”—processing several things at once as illustrated in the first case—and “zero copy”. When payload sizes are relatively small, as is the case in this example, the overhead of extra interrupts and trips through the protocol stack outweigh the zero-copy benefits. As payload sizes get larger (64 KB for example) the zero-copy benefits outweigh the batching benefits.


What would be desirable is a means to process a batch of session layer headers while holding the session layer payload out on the TOE device until corresponding buffers can be posted. Note that one difficulty with this objective is that session layer headers need not be located near the front of received packets, contiguous with TCP headers, but may instead be buried within the session layer payload data like in packet #3, with the session layer data and headers all being simply data to the TCP layer.


In one embodiment in accordance with this objective, assuming the same packets were received as in the above examples, the following sequence of events occurs as shown in FIG. 2:


Step 1 (50): A network interface including a TOE device receives a plurality of TCP packets that include session layer headers and session layer data.


Step 2 (55): As the packets arrive, the interface processes MAC, IP and TCP headers (21, 24, 26, 31, 33 and 35).


Step 3 (60): The interface locates the iSCSI headers (22, 28 and 29) within TCP data stream and delivers them, independently of the data, to the host. Note that this step can occur along with Step 2, so that for example the interface can locate iSCSI header 22 prior to or at the same time as processing MAC, IP and TCP headers 24.


Step 4 (65): iSCSI target software on the host processes the three iSCSI headers (22, 28 and 29) and posts receive buffers for the application data from iSCSI write #1 and iSCSI write #2.


Step 5 (70): The interface DMAs the iSCSI payload (23, 25 and 27) into the posted buffer for write #1 and DMAs the iSCSI payload (30, 32, 34 and 36) into the posted buffer for write #2, and completes the posted buffers back to the iSCSI target.


Note that this is substantially different than conventional receive processing in several ways.


First, a unique aspect of the above sequence of operations is that data is delivered to the session layer (iSCSI target software in this example) is discontiguous—48 bytes from the first packet, and 96 from the third packet, with a gap in between. As such, this may involve significantly modifying the session-layer software to make it aware that it will be handed discontiguous blocks of data and that corresponding data buffers will be expected for the missing pieces.


Furthermore, since this solution may involve modifications to the session-layer software, we may as well go one step further and have the session-layer software (iSCSI target software in this example but also applicable to SMB/CIFS and NFS) communicate directly with the TOE device, rather than have data indications travel up through the NIC device driver and TCP/IP stack, or have posted receive buffers travel down the other direction.


Lastly, for the above sequence of operations the network interface has been enhanced to do a certain amount of session-layer header processing in order to locate the position of each session-layer header within the TCP data stream. Note that this would be virtually impossible to accomplish without TCP offload since there would be no way to verify the continuity of integrity of the data stream without first processing the corresponding TCP headers. TCP retransmissions or dropped packets would wreak havoc on any attempts to do this without TOE. In one embodiment, the network interface may analyze each received session layer header to determine the length of any corresponding application data that follows the header, in order to calculate the offset of the next session layer header.


In one exemplary embodiment, a session layer descriptor ring can be used to implement the transfer of a plurality of session layer headers from the network interface to the host for processing by the application. Note that a descriptor ring is merely used as an example, and that any host memory structure that is accessible by the NIC and maintains the session layer headers in order, such as a first-in first-out (FIFO) memory or a queue could instead be used. In one implementation, a first descriptor ring may be used for the session layer headers, and a second descriptor ring or other ordered memory structure may be used for the locations for storing session layer data, or for pointers to those locations. In one implementation, pointers to session layer headers can be used, wherein the pointers are stored in a memory structure that maintains the pointers in order. Note that session layer headers are sometimes called application layer headers.


In our iSCSI target example, the “session layer header” ring may consist of a collection of “descriptors” where each descriptor includes 48-bytes for an iSCSI header, and possibly additional status information to be shared between the iSCSI target software and the network interface. Entries on this ring can be filled in by the network interface as it encounters session layer headers. As it fills in entries on this ring, it would advance its location in the ring and notify the host (iSCSI target software) that its ring location has changed. The iSCSI target software would then walk down the ring, processing these descriptors and the iSCSI session-layer headers contained within them.


The second ring may serve as a “buffer pointer” ring. Each entry within this ring would contain a pointer to a block of memory (or a scatter gather list representing such memory), and possibly associated status and/or flags. These entries would be filled in by the iSCSI target software as it processes iSCSI headers which describe subsequent iSCSI payload. Referring now to FIG. 3, which shows at the bottom the stream of received packet data corresponding to a particular TCP connection from FIG. 1, the following could take place:


1) TOE device processes MAC, IP and TCP headers 21 of packet #1.


2) Network interface processes TCP data of packet #1, including filling in the first entry in the session layer header ring by DMAing the session layer header 22 for iSCSI write #1 into it and filling in associated status 72, while holding on to the payload 23.


3) Network interface advances its current session header ring location to entry #2.


4) TOE device processes MAC, IP and TCP headers 24 of packet #2 and network interface holds on to the payload 25.


5) TOE device processes MAC, IP and TCP headers 26 of packet #2 and network interface fills in entries two and three of the session header ring with iSCSI headers 28 & 29, optionally including status 73 & 74, while hanging on to the end of the iSCSI write #1 payload 27 and the start of iSCSI write #2 payload 30.


6) Network interface advances its current session header ring location to entry #4.


7) Interrupt occurs—This could have occurred after step 4, but in this example is delayed due to interrupt aggregation.


8) The iSCSI target software compares its current session header ring location (1) to the network interface's current session header ring location (4) and determines that there are 3 headers to be processed.


9) The iSCSI target software processes entry #1 in the session header ring, and locates the memory location associated with iSCSI write #1.


10) The iSCSI target software fills in the first entry in the buffer pointer ring with a pointer 75 to this memory location (or a scatter gather list associated with it) as well as corresponding status and/or flags 76. In an alternative embodiment, instead of using a pointer ring the iSCSI target software may at this time simply provide a buffer for iSCSI write #1.


11) The iSCSI target software advances its buffer pointer ring location to entry 2.


12) The iSCSI target software processes entry #2 in the session header ring and arranges for a read response to be sent.


13) The iSCSI target software processes entry #3 in the session header ring and locates the memory locations associated with iSCSI write #2.


14) The iSCSI target software fills in the second entry in the buffer pointer ring with a pointer 77 to this memory location (or a scatter gather list associated with it) as well as corresponding status and/or flags 78.


15) The iSCSI target software advances its buffer pointer ring location to entry 3.


16) The iSCSI target software notifies the network interface (via a register write for example) of its new location in the buffer pointer ring.


17) The network interface compares its buffer pointer ring location against the host's newly written ring location and determines that there are two new entries to be processed.


18) The network interface processes the first entry in the buffer pointer ring to obtain the memory location for iSCSI write #1.


19) The network interface DMAs payload data (23, 25 and 27) from packets 1, 2 and 3 into the memory location specified by the buffer pointer ring entry #1, buffer 80.


20) The network interface processes the second entry in the buffer pointer ring to obtain the memory location for iSCSI write #2.


21) The network interface DMAs payload data (30, 32, 34 and 36) from packets 3, 4, 5 and 6 into the memory location specified by the buffer pointer ring entry #2, buffer 81.


22) The network interface advances its buffer pointer ring location to entry 3 and notifies the host (iSCSI target software).


23) The iSCSI target software compares the network interface's previous location (1) to the network interface's new location (3) and determines that entries 1 and 2 of the buffer pointer ring are now completed.


Thus, multiple session layer PDUs have been processed in a batch while the host CPU has been freed of copying data or even headers.


A schematic block diagram of a system that performs the above methods is shown in FIG. 4. A device 100 such as a computer has an interface such as network interface 102 that is connected to a serial link 104 such as a network, for example to receive Ethernet frames 105. The interface 102 has a TOE 106 including transport mechanism or processor 108 that processes at least data transfers for established TCP connections. Optionally, the TOE 106 may fully offload TCP, including establishing and terminating TCP connections as well as performing data transfer and all other details of the TCP protocol. The TOE 106 may also include mechanisms 110 and 112 to process network layer protocols (e.g., IP) and data link or media access control (MAC) protocols, respectively.


The interface 102 also includes a mechanism 114, such as instructions running on a processor, to analyze received session layer headers (e.g., SMB, iSCSI and NFS) to be able to locate such session layer headers even when they are surrounded by application data, so that the session layer headers can be removed from the application data and provided by the interface to a memory structure 116 such as a descriptor ring. The application data is split from the session layer headers and held on the interface in a memory 120 that preserves its order. An application 122 that corresponds to the TCP connection running on the interface can access the memory structure 116 holding the session layer headers, and in processing the headers determines a location such as buffer 130 for the corresponding application data. The address of that location may be held in memory structure 124 as a pointer to the buffer 130 for the data. The session layer mechanism 114 accesses the pointers in memory structure 124 to direct a DMA unit of interface 102 to move the application data to buffer 130. In an alternative embodiment the application data that has been received can be held on a buffer of the device 100, and moved to a buffer such as buffer 130 denoted by the application by a DMA unit of the device, rather than by a DMA unit of the interface 102.


As will be recognized by those skilled in the art, the innovative concepts described in the present application can be modified and varied over a tremendous range of applications, and accordingly the scope of patented subject matter is not limited by any of the specific exemplary teachings given. While the invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention. None of the description in the present application should be read as implying that any particular element, step, or function is an essential element which must be included in the claim scope. THE SCOPE OF PATENTED SUBJECT MATTER IS DEFINED ONLY BY THE ALLOWED CLAIMS. Moreover, none of these claims are intended to invoke paragraph six of 35 USC Section 112 unless the exact words “means for” are followed by a participle.

Claims
  • 1. A method comprising: running an application on a device having an interface;running, on the interface, a transmission control protocol (TCP) connection for the application, including maintaining a TCP control block (TCB) by the interface;receiving, by the interface, a packet including a TCP header, an upper layer header corresponding to a protocol higher than TCP, and application data, wherein the upper layer header is separated from the TCP header by the application data;associating, by the interface, the packet with the TCP connection, including processing the packet against the TCB;providing the upper layer header to the device;processing the upper layer header by the application; andproviding, by the interface to the device, the application data, after the processing of the upper layer header.
  • 2. The method of claim 1, wherein receiving the packet is not in response to a request by the application for the application data.
  • 3. The method of claim 1, further comprising: analyzing the upper layer header, prior to providing the upper layer header to the device.
  • 4. The method of claim 1, further comprising: receiving a second packet corresponding to the TCP connection and containing a second upper layer header; andprocessing the second upper layer header by the application prior to providing, by the network interface to the device, the application data.
  • 5. The method of claim 1, further comprising: splitting, by the interface, the upper layer header from the data; andproviding the upper layer header and the data to the device separately.
  • 6. The method of claim 1, wherein providing, by the interface to the device, the application data includes providing the application data to a descriptor ring.
  • 7. The method of claim 1, wherein processing the upper layer header by the application includes determining a location for the application data, and further comprising placing a description of that location in a descriptor ring.
  • 8. The method of claim 1, wherein processing the upper layer header by the application includes determining a location for the application data, and wherein providing, by the interface to the device, the application data includes placing the application data in the location.
  • 9. The method of claim 1, wherein the upper layer header is a session layer header.
  • 10. The method of claim 1, wherein the upper layer header is an Internet Small Computer System Interface (iSCSI) header.
  • 11. The method of claim 1, wherein the upper layer header is a Server Message Block (SMB) header.
  • 12. The method of claim 1, wherein the upper layer header is a Network File System (NFS) header.
  • 13. The method of claim 1, wherein the interface includes a TCP Offload Engine (TOE).
  • 14. The method of claim 1, further comprising: establishing the TCP connection by the device, prior to running the TCP connection by the interface.
  • 15. A method comprising: running an application on a device having an interface;running, on the interface, a transmission control protocol (TCP) connection for the application, including maintaining a TCP control block (TCB) by the interface;receiving, by the interface, a plurality of packets each including a TCP header, wherein a first of the packets contains a first upper layer header and corresponding first data, a second of the packets contains a second upper layer header and corresponding second data, and the upper layer headers correspond to a protocol higher than TCP;associating, by the interface, the packets with the TCP connection, including processing the packets against the TCB;providing, by the interface to the device, the first and second upper layer headers;processing the first upper layer header by the application, including allocating a first destination for the first data;then processing the second upper layer header by the application, including allocating a second destination for the second data; andproviding, by the interface to the first destination, the first data, after the processing of the second upper layer header.
  • 16. The method of claim 15, wherein providing, by the interface to the device, the first and second upper layer headers includes storing the headers in a memory structure holding a plurality of upper layer headers in an order in which they were transmitted.
  • 17. The method of claim 15, wherein providing, by the interface to the device, the first and second upper layer headers includes storing the headers in a descriptor ring.
  • 18. The method of claim 15, further comprising: storing a pointer to the first destination and a pointer to the second destination in a memory of the device that is accessible by the interface.
  • 19. An apparatus comprising: a device including a processor running an application;an interface for the device, the interface running a Transmission Control Protocol (TCP) connection for the application; anda memory structure that is accessible by the device and the interface, the memory structure storing a plurality of upper layer headers in an order in which they were received by the interface, such that the plurality of upper layer headers are present simultaneously in the memory structure, wherein the upper layer headers are separated from received data that they refer to and the upper layer headers correspond to a protocol higher than TCP.
  • 20. The apparatus of claim 19, further comprising: a second memory structure that is accessible by the device and the interface, the second memory structure adapted to store a plurality of pointers to locations for storing the data, the second memory structure adapted to store the pointers in an order in which the upper layer headers were processed by the application.
  • 21. The apparatus of claim 19, wherein the interface is adapted to analyze the session layer headers.
  • 22. The apparatus of claim 19, wherein the interface is adapted to separate the upper layer headers from the data and to provide the upper layer headers and the data separately to the device.
CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit under 35 U.S.C. §119 of provisional application No. 61/107,439, filed by the same inventors on Oct. 22, 2008, which is incorporated by reference herein.

US Referenced Citations (301)
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
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
5517668 Szwerinski et al. May 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
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
5619650 Bach et al. Apr 1997 A
5629933 Delp et al. May 1997 A
5633780 Cronin et al. 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
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
5727142 Chen 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
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 McAlpice 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
5848293 Gentry Dec 1998 A
5870394 Oprea Feb 1999 A
5872919 Wakeland et al. 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
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
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 et al. 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
6070200 Gates et al. May 2000 A
6078564 Lakshman et al. Jun 2000 A
6078733 Osborne Jun 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
6173333 Jolitz et al. Jan 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
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
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 et al. Mar 2002 B1
6370599 Anand 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
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
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
6181705 San-Hong Kim Feb 2004 B1
6687758 Craft et al. Feb 2004 B2
6697366 Kim Feb 2004 B1
6697868 Craft et al. Feb 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
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
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
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
20040010545 Pandya Jan 2004 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
20040064590 Starr et al. Apr 2004 A1
20040088262 Boucher et al. May 2004 A1
20040153578 Elzur Aug 2004 A1
20040210795 Anderson Oct 2004 A1
20040213290 Johnson et al. Oct 2004 A1
20040240435 Boucher et al. Dec 2004 A1
20040246974 Gyugyi et al. Dec 2004 A1
20040249957 Ekis et al. Dec 2004 A1
20050060538 Beverly Mar 2005 A1
20050108518 Pandya May 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
20080095182 Elzur et al. Apr 2008 A1
20080170501 Patel et al. Jul 2008 A1
20080209084 Wang et al. Aug 2008 A1
20080240111 Gadelrab Oct 2008 A1
20080253395 Pandya Oct 2008 A1
20090063696 Wang et al. Mar 2009 A1
Foreign Referenced Citations (13)
Number Date Country
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 2007-130476 Nov 2007 WO
Non-Patent Literature Citations (88)
Entry
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.
Merritt, Rick. “Ethernet Interconnect Infiniband at Intel.” EE Times article. Sep. 12, 2003. 3 pages.
Craft, Peter K. et al. “TCP Offload Device that Batches Session Layer Headers to Reduce Interrupts as Well as CPU Copies.” U.S. Appl. No. 12/581,342, filed Oct. 19, 2009.
Craft, Peter K. et al. “TCP Offload Send Optimization.” U.S. Appl. No. 12/504,021, filed Jul. 16, 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, filed May 22, 2009.
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, filed Mar. 24, 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, filed Dec. 1, 2008.
Boucher, Laurence B. et al. “Enabling an Enhanced Function of an Electronic Device.” U.S. Appl. No. 11/985,948, filed Nov. 19, 2007.
Starr, Daryl D. et al. “Network Interface Device With Gb/s Full-Duplex Transfer Rate.” U.S. Appl. No. 11/799,720, filed May 1, 2007.
Craft, Peter K. et al. “Peripheral Device that DMAS the Same Date to Different Locations in a Computer.” U.S. Appl. No. 11/788,719, filed Apr. 19, 2007.
Boucher, Laurence B. et al. “TCP/IP Offload Network Interface Device.” U.S. Appl. No. 11/701,705, filed Feb. 2, 2007.
Starr, Daryl D. et al. “TCP/IP Offload Device With Reduced Sequential Processing.” U.S. Appl. No. 11/348,810, filed Feb. 6, 2006.
Craft, Peter K. et al. “Transferring Control of TCP Connections Between Hierarchy of Processing Mechanisms.” U.S. Appl. No. 11/249,006, filed Oct. 11, 2005.
Boucher, Laurence B. et al. “Network Interface Device That Can Transfer Control of a TCP Connection to a Host CPU.” U.S. Appl. No. 11/029,863, filed Jan. 4, 2005.
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/016,642, filed Dec. 16, 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, 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, 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, filed Jun. 19, 2003.
Boucher, Laurence B. et al. “Method and Apparatus for Distributing Network Traffic Processing on a Muliprocessor Computer.” U.S. Appl. No. 10/438,719, filed May 14, 2003.
Boucher, Laurence B. et al. “Parsing a Packet Header.” U.S. Appl. No. 10/277,604, filed Oct. 18, 2002.
Starr, Daryl D.. et al. “Intelligient Network Storage Interface System.” U.S. Appl. No. 10/261,051, filed Sep. 30, 2002.
Boucher, Laurence B. et al. “Intelligent Network Interface System and Method for Accelerated Protocol Processing.” U.S. Appl. No. 09/692,561, filed Oct. 18, 2000.
Starr, David D. et al. “Intelligent Network Storage Interface Device.” U.S. Appl. No. 09/675,700, filed Sep. 29, 2000.
Merritt, Rick. “Ethernet Interconnect Outpacing Infiniband at Intel.” EE Times article. Sep. 11, 2002. 9 pages.
Internet pages entitled “Hardware Assisted Protocol Processing”, (which Eugene Feinber is working on), 1 page, printed Nov. 25, 1998.
Zilog product Brief entitled “Z85C30 CMOS SCC Serial Communication Controller”, Zilog Inc., 3 pages, 1997.
Internet pages of Xpoint Technologies, Inc. entitled “Smart LAN Work Requests”, 5 pages, printed Dec. 19, 1997.
Internet pages entitled: Asante and 100BASE-T Fast Ethernet. 7 pages, printed May 27, 1997.
Internet pages entitled: A Guide to the Paragon XP/S-A7 Supercomputer at Indiana University. 13 pages, printed Dec. 21, 1998.
Richard Stevens, “TCP/IP Illustrated, vol. 1, The Protocols”, pp. 325-326 (1994).
Internet pages entitled: Northridge/Southbridge vs. Intel Hub Architecture, 4 pages, printed Feb. 19, 2001.
Gigabit Ethernet Technical Brief, Achieving End-to-End Performance. Alteon Networks, Inc., First Edition, Sep. 1996, 15 pages.
Internet pages directed to Technical Brief on Alteon Ethernet Gigabit NIC technology, www.alteon.com, 14 pages, printed Mar. 15, 1997.
VIA Technologies, Inc. article entitled “VT8501 Apollo MVP4”, pp. i-iv, 1-11, cover and copyright page, revision 1.3, Feb. 1, 2000.
iReady News Archives article entitled “iReady Rounding Out Management Team with Two Key Executives”, http://www.ireadyco.com/archives/keyexec.html, 2 pages, printed Nov. 28, 1998.
“Toshiba Delivers First Chips to Make Consumer Devices Internet-Ready Based on iReady's Design,” Press Release Oct. 1998, 3 pages, printed Nov. 28, 1998.
Internet pages from iReady Products, web sitehttp://www.ireadyco.com/products,html, 2 pages, downloaded Nov. 25, 1998.
iReady News Archives, Toshiba, iReady shipping Internet chip, 1 page, printed Nov. 25, 1998.
Interprophet article entitled “Technology”, http://www.interprophet.com/technology.html, 17 pages, printed Mar. 1, 2000.
iReady Corporation, article entitled “The I-1000 Internet Tuner”, 2 pages, date unknown.
iReady article entitled “About Us Introduction”, Internet pages fromhttp://www.iReadyco.com/about.html, 3 pages, printed Nov. 25, 1998.
iReady News Archive article entitled “Revolutionary Approach to Consumer Electronics Internet Connectivity Funded”, San Jose, CA, Nov. 20,1997. 2 pages, printed Nov. 2, 1998.
iReady News Archive article entitled “Seiko Instruments Inc. (SII) Introduces World'S First Internet-Ready Intelligent LCD Modules Based on Iready Technology,” Santa Clara, CA and Chiba, Japan, Oct. 26, 1998. 2 pages, printed Nov. 2, 1998.
NEWSwatch article entitled “iReady internet Tuner to Web Enable Devices”, Tuesday, Nov. 5, 1996, printed Nov. 2, 1998, 2 pages.
EETimes article entitled “Tuner for Toshiba, Toshiba Taps iReady for Internet Tuner”, by David Lammers, 2 pages, printed Nov. 2, 1998.
“Comparison of Novell Netware and TCP/IP Protocol Architectures”, by J.S. Carbone, 19 pages, printed Apr. 10, 1998.
Adaptec article entitled “AEA-7110C-a DuraSAN product”, 11 pages, printed Oct. 1, 2001.
iSCSI HBA article entitled “iSCSI and 2Gigabit fibre Channel Host Bus Adapters from Emulex, QLogic, Adaptec, JNI”, 8 pages, printed Oct. 1, 2001.
iSCSI HBA article entitled “FCE-3210/6410 32 and 64-bit PCI-to-Fibre Channel HBA”, 6 pages, printed Oct. 1, 2001.
ISCSI.com article entitled “iSCSI Storage”, 2 pages, printed Oct. 1, 2001.
“Two-Way TCP Traffic Over Rate Controlled Channels: Effects and Analysis”, by Kalampoukas et al., IEEE Transactions on Networking, vol. 6, No. 6, Dec. 1998, 17 pages.
IReady News article entitled “Toshiba Delivers First Chips to Make Consumer Devices Internet-Ready Based on iReady Design”, Santa Clara, CA, and Tokyo, Japan, Oct. 14, 1998, printed Nov. 2, 1998, 3 pages.
Internet pages of InterProphet entitled “Frequently Asked Questions”, by Lynne Jolitz, printed Jun. 14, 1999, 4 pages.
“File System Design for an NFS File Server Appliance”, Article by D. Hitz, et al., 13 pages.
Adaptec Press Release article entitled “Adaptec Announces EtherStorage Technology”, 2 pages, May 4, 2000, printed Jun. 14, 2000.
Adaptec article entitled “EtherStorage Frequently Asked Questions”, 5 pages, printed Jul. 19, 2000.
Adaptec article entitled “EtherStorage White Paper”, 7 pages, printed Jul. 19, 2000.
CIBC World Markets article entitled “Computers; Storage”, by J. Berlino et al., 9 pages, dated Aug. 7, 2000.
Merrill Lynch article entitled “Storage Futures”, by S. Milunovich, 22 pages, dated May 10, 2000.
CBS Market Watch article entitled “Montreal Start-Up Battles Data Storage Botttleneck”, by S. Taylor, dated Mar. 5, 2000, 2 pages, printed Mar. 7, 2000.
Internet-draft article entitled “SCSI/TCP (SCSI over TCP)”, by J. Satran et al., 38 pages, dated Feb. 2000, printed May 19, 2000.
Internet pages entitled Technical White Paper-Xpoint's Disk to LAN Acceleration Solution for Windows NT Server, printed Jun. 5, 1997, 15 pages.
Jato Technologies article entitled Network Accelerator Chip Architecture, twelve-slide presentation, printed Aug. 19, 1998, 13 pages.
EETimes article entitled Enterprise System Uses Flexible Spec, dated Aug. 10, 1998, printed Nov. 25, 1998, 3 pages.
Internet pages entitled “Smart Ethernet Network Interface Cards”, which Berend Ozceri is developing, printed Nov. 25, 1998, 2 pages.
Internet pages of Xaqti corporation entitled “GigaPower Protocol Processor Product Review,” printed Nov. 25, 1999, 4 pages.
U.S. Appl. No. 60/283,896, Titled: CRC Calculations for Out of Order PUDs, filed Apr. 12, 2003, Inventor: Amit Oren, Assignee: Siliquent Technologies Ltd.
Internet pages entitled “DART: Fast Application Level Networking via Data-Copy Avoidance,” by Robert J. Walsh, printed Jun. 3, 1999, 25 pages.
Andrew S. Tanenbaum, Computer Networks, Third Edition, 1996, ISBN 0-13-349945-6.
Article from Rice University entitled “LRP: A New Network Subsystem Architecture for Server Systems”, by Peter Druschel and Gaurav Banga, 14 pages.
Internet RFC/STD/FYI/BCP Archives article with heading “RFC2140” entitled “TCP Control Block Interdependence”, web address http://www.faqs.org/rfcs/rfc2140.html, 9 pages, printed Sep. 20, 2002.
WindRiver article entitled “Tornado: For Intelligent Network Acceleration”, copyright Wind River Systems, 2001, 2 pages.
WindRiver White Paper entitled “Complete TCP/IP Offload for High-Speed Ethernet Networks”, Copyright Wind River Systems, 2002, 7 pages.
Intel article entitled “Solving Server Bottlenecks with Intel Server Adapters”, Copyright Intel Corporation, 1999, 8 pages.
Schwaderer et al., IEEE Computer Society Press publication entitled, “XTP in VLSI Protocol Decomposition for ASIC Implementation”, from 15th Conference on Local Computer Networks, 5 pages, Sep. 30-Oct. 3, 1990.
Beach, Bob, IEEE Computer Society Press publication entitled, “UltraNet: An Architecture for Gigabit Networking”, from 15th Conference on Local Computer Networks, 18 pages, Sep. 30-Oct. 3, 1990.
Chesson et al., IEEE Syposium Record entitled, “The Protocol Engine Chipset”, from Hot Chips III, 16 pages, Aug. 26-27, 1991.
Maclean et al., IEEE Global Telecommunications Conference, Globecom '91, presentation entitled, “An Outboard Processor for High Performance Implementation of Transport Layer Protocols”, 7 pages, Dec. 2-5, 1991.
Ross et al., IEEE article entitled “FX1000: A high performance single chip Gigabit Ethernet NIC”, from Compcon '97 Proceedings, 7 pages, Feb. 23-26, 1997.
Strayer et al., “Ch. 9: The Protocol Engine” from XTP: The Transfer Protocol, 12 pages, Jul. 1992.
Publication entitled “Protocol Engine Handbook”, 44 pages, Oct. 1990.
Koufopavlou et al., IEEE Global Telecommunications Conference, Globecom '92, presentation entitled, “Parallel TCP for High Performance Communication Subsystems”, 7 pages, Dec. 6-9, 1992.
Lilienkamp et al., Publication entitled “Proposed Host-Front End Protocol”, 56 pages, Dec. 1984.
Thia et al. Publication entitled “High-Speed OSI Protocol Bypass Algorithm with Window Flow Control,” Protocols for High Speed Networks, pp. 53-68, 1993.
U.S. Appl. No. 60/053,240, Titled: TCP/IP Network Accelerator and Method of Use, filed Jul. 17, 1997, Inventor: William Jolizt et al.
Thia et al. Publication entitled “A Reduced Operational Protocol Engine (ROPE) for a multiple-layer bypass architecture,” Protocols for High Speed Networks, pp. 224-239, 1995.
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).
Provisional Applications (1)
Number Date Country
61107439 Oct 2008 US