US 7,640,364 B2Grant
Port aggregation for network connections that are offloaded to network interface devices
Issue Date:2009-12-29
•20 Claims
•2 Drawing Sheets
Abstract
At least one intelligent network interface card (INIC) is coupled to a host computer to offload protocol processing for multiple network connections, reducing the protocol processing of the host. Plural network connections can maintain, via plural INIC ports and a port aggregation switch, an aggregate connection with a network node, increasing bandwidth and reliability for that aggregate connection. Mechanisms are provided for managing this aggregate connection, including determining which port to employ for each individual network connection, and migrating control of an individual network connection from a first INIC to a second INIC.
Metadata
Assignee
- Alacritech, Inc.
Inventors
- Peter K. Craft
- Clive M. Philbrick
- Laurence B. Boucher
- Daryl D. Starr
- Stephen E. J. Blightman
- David A. Higgen
Application Information
Application Number:US 11/215,464
Filing Date:2005-08-30
Priority Date:2001-03-07
Art Unit:2451
Classifications
IPC:
G06F15/16G06F12/00
Patent Drawings (2 sheets)
Description
Cross-Reference to Related Applications
[0001] This application claims the benefit under 35 U.S.C. §120 of (is a continuation of) U.S. patent application Ser. No. 10/229,564, filed Aug. 27, 2002 now U.S. Pat. No. 6,938,092, which claims the benefit under 35 U.S.C. §120 of (is a continuation-in-part of) Ser. No. 09/801,488 now U.S. Pat. No. 6,687,758, filed Mar. 7, 2001. The entire disclosures of the above-referenced patent and application are incorporated by reference into the present application.
Copyright Notice
[0002] A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the reproduction of the patent document or the patent disclosure in exactly the form it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
Background
[0003] The present invention relates to network communications, in particular to network systems for which a network node maintains more than one connection with another network node.
[0004] Port aggregation (also called link aggregation, teaming or trunking) is a method by which two or more network connections are grouped together at a multiport network host to create a single logical connection. One purpose of this grouping is to be able to increase bandwidth for that single logical connection without having to increase the bandwidth of any of the physical network channels. For example, full-duplex Ethernet or Fast-Ethernet connections can be grouped in this fashion to avoid or delay upgrading a network infrastructure to Gigabit Ethernet or asynchronous transfer mode (ATM).
[0005] Typically associated with port aggregation is a port fail-over method that ensures that the logical connection is maintained in the event that an individual network link or network interface card (NIC) fails. Such a port fail-over method can also provide increased reliability for that single logical network connection, in comparison with the reliability of a single physical network connection.
[0006] To provide an increased number of connections for a network host, the host may be connected to plural networks with plural NICs. A port aggregated logical connection may in this case involve plural ports of the plural NICs. The use of plural NICs may, however, strain a host central processing unit (CPU) due to the additional network protocol processing required for the additional NICs.
[0007] Even without additional NICs, protocol processing may absorb a large fraction of host CPU cycles. This is because conventionally, data such as a file that is transferred over a network is divided into multiple packets, with each packet having layers of protocol headers that are processed one layer at a time by the CPU of the receiving host computer. Although the speed of CPUs has greatly increased over many years, host protocol processing of network messages such as file transfers can consume most of the available processing power of the fastest commercially available CPU.
Summary
[0008] In accordance with the present invention, at least one intelligent network interface card (INIC) is coupled to a host computer to offload protocol processing for multiple network connections, reducing the protocol processing of the host. Plural network connections can maintain, via plural INIC ports and a port aggregation switch, an aggregate connection with a network node, increasing bandwidth and reliability for that aggregate connection. Mechanisms are provided for managing this aggregate connection, including determining which port to employ for each individual network connection, and migrating control of an individual network connection from a first INIC to a second INIC.
Brief Description of the Drawing
[0009] FIG. 1 is a block diagram of a host computer having plural INICs connected to a network by a port aggregation switch, the host including a port aggregation program that manages the logical connections of the INICs.
Detailed Description of the Preferred Embodiments
[0010] FIG. 1 is a block diagram of a host computer 20 having a CPU 24, a memory 21, storage 23, a first INIC 22 and a second INIC 25. Note that, although storage 23 is shown separately from memory 21, both may simply be separate categories of the same memory. First INIC 22 is coupled to network channels 32 and 33 by network ports 52 and 53, and second INIC 25 is coupled to network channels 34 and 35 by network ports 54 and 55. Network ports 52-55 each include an encoding/decoding mechanism and a physical interface that is coupled to a respective network channel 32-35. Although FIG. 1 illustrates an embodiment with two INICs each having two ports, more or less INICs each having more or less ports are possible. Network channels 32-35, which may each comprise conductive wires, optical fibers, or wireless transmission media, are coupled to a port aggregation switch 37.
[0011] The port aggregation switch 37 may be coupled to a number of other network channels 40-43, which may also comprise conductive wires, optical fibers, or wireless transmission media. Although only a few network channels 40-43 are shown in this illustration, switch 37 may include tens or hundreds of physical connections. Clients 44-47 are coupled to switch 37 via network channels 40-43, respectively. Although represented as a few network channels 40-43 directly connected to clients 44-47 to facilitate illustration, the network channels 40-43 may each include multiple packet-switched interconnections between switch 37 and clients 44-47. Likewise, clients 44-47 may represent any network nodes including peer level hosts that may have multiple physical network interfaces. Similarly, the host computer 20 may represent any computing or communication device that has a CPU and a memory and is able to be coupled to a network as a node.
[0012] Network connections, such as Transmission Control Protocol (TCP) connections, may be initiated between the host 20 and any of clients 44-47. The network connections typically define the network addresses and the relevant network ports of both the host 20 and client 44, 45, 46 or 47, but do not necessarily define the network path connecting the host and client for those ports, and so may be thought of as logical connections. The port aggregation switch 37 can combine plural network connections, each of which is set up to communicate over a different one of the network ports 52-55 and channels 32-35, into a single aggregate interface that communicates with client 44, 45, 46 or 47 via respective network channel 40, 41, 42 or 43.
[0013] The INICs 22 and 25 are connected to the host 20 by a conventional bus 58, which may be a host bus or an input/output (I/O) bus such as a peripheral component interconnect (PCI) bus. Alternatively, INICs 22 and 25 may be connected to the host 20 by plural I/O buses. For the situation in which bus 58 is an I/O bus, internal INIC memory buses 56 and 57 and host memory bus 59 may be coupled to I/O bus 58 with conventional interface mechanisms. The INICs 22 and 25 have protocol processing mechanisms 26-29 that process data link, network and transport layer headers of each packet received by that INIC. INICs 22 and 25 also have respective memories 70 and 72 and respective microprocessors 75 and 77.
[0014] The host memory 21 contains a conventional protocol processing stack 60 that can be run by CPU 24 to process various communication protocols (e.g., IP, TCP, UDP, IPX, SPX, HTTP, etc.), an ATCP protocol processing stack 62 and an INIC device driver 64. The ATCP protocol stack 62 is used to offload selected network connections to the INICs 22 and 25 for fast-path processing of messages corresponding to those selected connections, while the conventional stack 60 is available for slow-path processing of other messages. The INIC device driver 64 diverts fast-path packets received from the INICs 22 and 25 to the ATCP stack 62 for processing, such as connection setup. The ATCP stack 62 also intercepts outgoing fast-path messages from being processed by the conventional TCP/IP stack 60. Source code for an embodiment of the ATCP stack 62 that works with Windows NT is contained in the CD-R Disc provided with this specification, in a folder entitled “nt-parallel-stack.”
[0015] Alternatively, ATCP functions such as creating and handing out fast-path connections to INICs 22 and 25 may be included in an integrated protocol stack that also includes instructions for conventional protocol processing, as described in U.S. patent application Ser. No. 09/514,425, filed Feb. 28, 2000 and incorporated by reference herein. Source code for an integrated Free BSD stack is contained in the CD-R Disk Disc provided with this specification, in a folder entitled “freebsd-integrated-stack.” In another embodiment, fast-path connection setup and tear down may be handled by INICs 22 and 25, as described in U.S. Patent Application Ser. No. 09/675,484 and U.S. Patent Application Ser. No., both filed Sep. 29, 2000, and incorporated by reference herein.
[0016] INIC 22 chooses whether to send a packet received from a network channel 32-35 to the host memory 21 for slow-path processing of the headers by the CPU 24 running protocol stack 60 or 62, or to send the packet data directly to a destination in storage 23. The fast-path may be selected for the vast majority of data traffic having plural packets per message that are sequential and error-free. The fast-path avoids the time consuming protocol processing of each packet by the CPU 24, such as repeated copying of the data and repeated trips across the host memory bus 59. Slow-path processing allows any packets that are not conveniently transferred by the fast-path of the INIC 22 to be processed conventionally by the host 20.
[0017] In order to provide fast-path capability at the host 20, a logical connection is first set up with a remote node such as client 44. This connection initialization may include handshake, authentication and/or other procedures. A communication control block (CCB) is created by the ATCP stack 62 during connection initialization procedures for connection-based messages, such as typified by TCP/IP or SPX/IPX protocols. The CCB includes connection information, such as source and destination addresses and ports. For TCP connections a CCB comprises source and destination media access control (MAC) addresses, source and destination Internet Protocol (IP) addresses, source and destination TCP ports and TCP variables such as timers and receive and transmit windows for sliding window protocols. After a connection has been set up, the CCB is passed by INIC device driver 64 from the host 20 to the INIC memory 70 by writing to a command register in that memory 70, where it may be stored along with other CCBs in a CCB cache. The INIC 22 also creates a hash table corresponding to the cached CCBs for accelerated matching of the CCBs with packet summaries.
[0018] When a message, such as a file write, that corresponds to the CCB is received by the INIC 22, a header portion of an initial packet of the message is sent to the host 20 to be processed by the CPU 30 and protocol stack 38. This header portion sent to the host contains a session layer header for the message, which is known to begin at a certain offset of the packet, and optionally contains some data from the packet. The processing of the session layer header by ATCP stack 62 identifies the data as belonging to the file and indicates the size of the message, which are used by a host 20 file system to reserve a destination for the data in storage 23. If any data was included in the header portion that was sent to the host, it is then stored in the destination.
[0019] A list of buffer addresses for the destination in storage 23 is sent to the INIC 22 and stored in or along with the CCB. The CCB also maintains state information regarding the message, such as the length of the message and the number and order of packets that have been processed, providing protocol and status information regarding each of the protocol layers, including which user is involved and storage space for per-transfer information.
[0020] Once the CCB indicates the destination, fast-path processing of received packets corresponding to the CCB is available. A packet received subsequently at port 52 is first processed by mechanism 26 to generate the packet summary, a hash of the packet summary is compared with the hash table, and if necessary with the CCBs cached in memory 70, to determine whether the packet belongs to a message for which a fast-path connection has been set up. Upon matching the packet summary with the CCB, assuming no exception conditions exist, the data of the packet, without network or transport layer headers, is sent by direct memory access (DMA) units to the destination in storage 23 denoted by the CCB, which may for example be a file cache for an application.
[0021] Likewise, fast-path messages to be transmitted from the host 20 to the client 44 are diverted from an application interface to the ATCP protocol processing stack 62, which sends the message data to the INIC 22 or 25 that is holding the CCB for that message. That INIC references the CCB to prepend TCP and IP headers to data packets and sends the packets on the corresponding network channel. The ATCP stack 62 remains available for slow-path processing of any fast-path type packet or message that has exception conditions. A more detailed discussion of the above-described accelerated communication mechanism, which speeds protocol processing and reduces work for the host CPU 24, can be found in U.S. patent application Ser. No. 60/061,809, U.S. patent application Ser. No. 09/067,544, U.S. patent application Ser. No. 60/098,296, U.S. patent application Ser. No. 09/141,713, U.S. patent application Ser. No. 09/384,792, U.S. patent application Ser. No. 09/439,603, U.S. patent application Ser. No. 09/464,283, U.S. patent application Ser. No. 09/692,561, U.S. patent application Ser. No. 09/748,936 and the U.S. patent application filed Feb. 20, 2001, by Express Mail No. EF055069864US, inventors Laurence B. Boucher et al., entitled “Obtaining a Destination Address so that a Network Interface Device can Write Network Data Without Headers Directly into Host Memory,” all of which are incorporated by reference herein.
[0022] In accordance with a port aggregation protocol, the port aggregation switch 37 controls which network ports 52-55 are associated with a network such as channel 40. That is, port aggregation switch 37 may move a connection from one to another of ports 52-55. Since the fast-path conditions described above involve offloading control and processing of a connection to INIC 22 or 25 in association with ports 52 and 53 or 54 and 55, respectively, the fast-path and port aggregation protocol need to be synchronized.
[0023] A port aggregation and fail-over scheme that may be used by switch 37 is referenced in IEEE standard 802.3ad, which is incorporated by reference herein. A similar type of port aggregation and fail-over scheme is called “Fast Etherchannel,” promoted by Cisco Systems®. Fast Etherchannel combines plural network ports into a single logical interface. In the Fast Etherchannel implementation, each of the ports in the logical group shares the same MAC address. Because of this, each of the ports is connected to a single Fast Etherchannel switch (such as the Cisco Catalyst™ series switch). If a link such as one of channels 32-35, ports 52-55 or INICs 22,25 fails in a fast Etherchannel group, host 20 and switch 37 each independently identify the link failure and switch to another link. Alternatively, port aggregation switch 37 may attempt to balance the traffic on the network ports 52-55 that are associated with network channels 40-43.
[0024] A port aggregation driver 66 is disposed between the INIC device driver 64 and the protocol processing stacks 60 and 62 to handle the port aggregation requirements imposed by the switch 37. For example, if the switch 37 migrates a fast-path connection from port 52 on INIC 22 to port 54 on INIC 25, the port aggregation driver 66 can recognize the migration and transfer the corresponding CCB from first INIC 22 to second INIC 25. Source code for the port aggregation driver 66 is contained in the CD-R Disk provided with this specification, in a folder entitled “pag” located in the folder entitled “nt-parallel-stack.”
[0025] The port aggregation driver 66 is transparent to upper protocol layers such as TCP/IP stack 60, ATCP stack 62, or integrated Free BSD stack. That is, the upper protocol layers are not aware that they are communicating across a logical group of network interfaces. This is illustrated in FIG. 1 with the single arrow leading between TCP/IP stack 60 and port aggregation driver 66, compared with four arrows leading between port aggregation driver 66 and INIC device driver 64. Likewise, a single arrow leading between ATCP stack 62 and port aggregation driver 66 illustrates the communication between plural ports 52-55 of plural INICs 22, 25 and the single ATCP stack 62. The INIC device driver 64 can control INICs 22 and 25 with signals flowing from port aggregation driver 66. For the situation in which port aggregation is not being used, the port aggregation driver 66 is not active.
[0026] As mentioned above, port aggregation and fail-over switching mechanisms are provided across multiple INICs notwithstanding individual INIC control and processing of each fast-path connection. Thus a fast-path message transfer can be interrupted by port aggregation switch 37 deciding to move a fast-path connection to another INIC. Communicating a message using a fast-path connection may involve a large block of data, such as a Server Message Block (SMB) write or read, that is divided into multiple 64 kilobyte (KB) messages, which are further divided into multiple 1.4KB packets for network transfer according to IP. For example, host 20 may wish to issue a write to client 44, for a connection corresponding to a CCB held on INIC 22. INIC 22 will split the data into TCP packets and transmit the packets according to the TCP sliding window protocol. In order to do this, INIC 22 also processes the acknowledgments returned by the client. Since the CCB for the connection resides on INIC 22, it is helpful for all acknowledgments for that CCB to be sent to INIC 22.
[0027] As noted above, however, the port aggregation switch 37 may be configured to decide which of the network channels 32-35 and ports 52-55 is to receive a particular packet. It is difficult in this port aggregation environment for host 20 or INICs 22 and 25 to predict a priori on which port a packet for a given logical connection will arrive. Instead, the port aggregation driver 66 monitors the network traffic received by INICs 22 and 25 to keep track of which logical connections, identified by the MAC address of client 44, are associated with which of the ports 52-55.
[0028] With information regarding the port 52, 53, 54 or 55 that is associated with a logical connection for client 44, the port aggregation driver 66 can mimic the port aggregation switch 37 by handing out a CCB to the port 52, 53, 54 or 55 associated with the destination MAC address. This information may be gleaned, for example, from a connection initialization handshake or from initial replies to a write or read request. Until the port aggregation driver 66 has identified which port is associated with a logical connection, fast-path processing of a message corresponding to that connection is averted. Averting fast-path processing may be accomplished simply by the port aggregation driver 66 identifying CCB handout attempts of the ATCP stack 62 and failing them until the driver 66 has identified which of the ports 52, 53, 54 or 55 is associated with the connection. The ATCP driver 62 may be configured to delay subsequent handout attempts to avoid thrashing. Once a port 52, 53, 54 or 55 is associated with a connection then the CCB handout is allowed to succeed, providing fast-path processing of messages, such as the SMB write, by INIC 22 or 25.
[0029] After this fast-path processing has begun, however, port aggregation switch 37 may change the port selection for load balancing purposes, so long as the switch can guarantee that packets are not sent out of order. This is one mechanism by which INIC 22, for example, can receive a packet for a fast-path connection that is being handled by the other INIC 25.
[0030] In this case the INIC 22 that receives the packet cannot process the packet according to the fast-path connection, and instead sends the packet to the INIC device driver 64, which is configured to divert fast-path type message packets to the ATCP stack 62 for processing. The ATCP stack 62 maintains a list of the CCBs that have been offloaded to INICs 22 and 25, and recognizes that this slow-path packet corresponds to a CCB that is in a fast-path state. Upon receiving this exception condition, the ATCP stack 62 will command the INIC 25 to flush the fast-path CCB back to the ATCP stack 62. After the packet has been processed by the ATCP stack 62 and the state of the CCB updated to reflect that processing, the CCB can then be handed out to the INIC 22, which is known by port aggregation driver 66 to be associated with the connection.
[0031] When the port aggregation driver 66 receives a slow-path send request, it extracts the destination MAC address from the packet to determine which INIC and corresponding port 52, 53, 54 or 55 should be used to send the packet. For send requests corresponding to a CCB held by an INIC 22 or 25, the port aggregation driver 66 may not receive this information. Instead, a connection handle is created to identify a particular fast-path connection. The connection handle is in one embodiment a 4-byte value made up the following four 1-byte values:
[0032] 1. Connection identifier—This identifies the CCB on the INIC 22 or 25. In one embodiment, up to 256 CCBs can be held per INIC.
[0033] 2. INIC number—This identifies the INIC (e.g., 22 or 25) associated with the fast-path connection.
[0034] 3. Port number—This identifies the port (e.g., 52, 53, 54 or 55) associated with the connection by its number on a given INIC.
[0035] 4. Generation number—A number used for indicating INIC failure, discussed below.
[0036] The connection handle is set by the INIC device driver 64 during CCB handout and passed back up to the ATCP stack 62 as an opaque handle. The ATCP stack 62 uses this handle for all subsequent fast-path requests for that logical connection.
[0037] During connection handout, the ATCP stack 62 provides the destination MAC address as part of the handout. The port aggregation driver 66 intercepts the destination MAC address as the request is being passed down from the ATCP stack 62 to the INIC device driver 64. Similarly, the port aggregation driver 66 intercepts the connection handle as the completion is passed back up from the INIC device driver 64 to the ATCP stack 62. The port aggregation driver 66 uses information from the MAC address and connection handle to identify which fast-path requests belong to which port and INIC.
[0038] Other issues that are solved in accordance with the present invention include the handling of a link failure for a fast-path connection. There are two ways in which a link failure can occur. One way is for the host 20 to receive a link status signal indicating that the link has failed. Another way is for the INIC handling the link (or links) to crash. Both of these fail-over scenarios are discussed separately below.
[0039] For connections that are operating in slow-path mode, handling a link failure is simple. Link failure is identified by the INIC 22 or 25, which notifies the INIC device driver 64 via an interrupt status register. The INIC device driver 64 in response issues a media disconnect status indication to the protocol drivers above it, including the port aggregation driver 66. Upon receiving the media disconnection indication, the port aggregation driver 66 notes the affected port 52, 53, 54 or 55 and refrains from sending subsequent slow-path packets out that port. Until a new port is associated with a particular connection (as described above) the port aggregation driver selects an outgoing port based on the lower bits of the destination MAC address.
[0040] Ownership of connections by INIC 22 or 25 complicates handling a link failure for fast-path mode connections. If a link failure results in the connection being associated with a link on the other INIC 22 or 25, the CCB is flushed back to the host 20 and then handed out to the other INIC. The port aggregation driver 66 may include instructions to flush the fast-path CCB back to the host 20 when a link fails.
[0041] Alternatively, instructions on the port aggregation switch 37 and ATCP stack 62 may manage the link failure without intervention by the port aggregation driver 66. In this case, link failure may be handled by different mechanisms. First, the port aggregation switch 37 may discover the link failure and switch the connection to a new port 52, 53, 54 or 55. If the new port is on a different INIC 22 or 25, then the ATCP stack 62 will receive slow-path packets for a fast-path connection, in which case it will flush the CCB from the INIC associated with the link failure. Second, a TCP retransmission timer on the INIC may be triggered, also causing the CCB to be flushed to the host from the INIC associated with the link failure.
[0042] Certain operating system controls, however, may interfere with the above mechanisms. For example, Windows NT or 2000 network driver interface specification (NDIS), upon receiving an indication from INIC device driver 64 that a link has failed, may prohibit protocol stacks such as ATCP 62 from sending commands such as a flush command to the INIC device driver. For this situation, the INIC device driver 64 instead may be configured to issue a flush command to the appropriate INIC 22 or 25 when alerted of a link failure by that INIC.
[0043] Failure of one of the INICs 22 or 25 is more difficult to manage. The difficulty is in recovering the CCBs that have been offloaded to the failed INIC. If the INIC 22 or 25 is no longer functional, then the INIC cannot flush the CCBs back to the host. It may be possible to read the CCBs out of SRAM on the INIC, but if the state of the INIC is suspect, then the state of the CCBs is also suspect. Instead, a safer procedure is to close all CCBs on the failed INIC.
[0044] Some upper layer protocols, such as Netbios, reopen connections automatically. As such, a host 20 with SMB mapped file systems should not experience a loss of connectivity. Other sessions, such as File Transfer Protocol (FTP), may have to be reestablished by the host 20. One challenge is for the ATCP stack 62 to determine which connections need to be terminated and which do not. Although it may be possible to explicitly tell the ATCP stack 62 which connections need to be flushed, this may involve the INIC device driver 64 issuing some sort of custom status indication to the ATCP stack 62, which may be undesirable.
[0045] Instead, the INIC device driver 64 maintains a generation number, as mentioned above, for each INIC 22 and 25. This generation number gets incremented every time the INIC gets reset. The generation number gets passed up to the ATCP driver as part the previously mentioned connection handle during CCB handout. On every subsequent fast-path request, the ATCP stack 62 passes this opaque handle back down to the INIC device driver 64. If the INIC device driver 64 gets a request with a stale generation number, as the result of an INIC reset, the INIC device driver 64 will fail the fast path request. When the ATCP stack 62 discovers that the fast-path request failed it will know that it must abort the TCP connection.
[0046] Note that it is possible that the ATCP stack 62 already has an outstanding command on INIC 22 or 25 at the time that INIC fails. Without further information, the ATCP stack 62 could end up waiting indefinitely for the command to complete. For this reason, the ATCP stack 62 implements a fast-path command timeout. When the timeout expires, the ATCP stack 62 will attempt to flush the connection. If the flush fails (due to the generation number) or times out, then it will abort the connection.
[0047] Although we have described in detail various embodiments of the present invention, other embodiments and modifications will be apparent to those of skill in the art in light of this text and accompanying drawings. Therefore, the present invention is to be limited only by the following claims, which include all such embodiments, modifications and equivalents.
Claims
The invention claimed is:
1. A method for communicating over a network by a local host having a plurality of ports that couple the host to at least one network, the method comprising:
establishing a transport layer connection between the local host and a remote host;
offloading the connection to a first of the ports, including transmitting all network packets that correspond to the connection via the first port while the connection is associated with the first port;
receiving a network packet that corresponds to the connection via a second of the ports; and
transferring the connection to the second port, including transmitting all network packets that correspond to the connection via the second port while the connection is associated with the second port.
2. The method of claim 1, wherein transferring the connection to the second port includes:
transferring the connection from the first port to the host; and
transferring the connection from the host to the second port.
3. The method of claim 1, wherein transferring the connection to the second port is based upon receiving the network packet that corresponds to the connection via the second port.
4. The method of claim 1, further comprising:
recognizing, by a set of instructions running on a processor, that the network packet was received via a port that is not associated with the connection.
5. The method of claim 1, further comprising:
creating, by the local host, a handle that identifies the connection and the port that is associated with the connection.
6. The method of claim 1, wherein the local host has first and second network interface cards, and transferring the connection to the second port includes transferring the connection from the first network interface card to the second network interface card.
7. The method of claim 1, further comprising:
receiving, by a switch that is coupled to the at least one network, the network packets transmitted from the first and second ports, and
sending, to the second port from the switch, the network packet that corresponds to the connection.
8. A method for communication by a local host having a plurality of ports that couple the host to a plurality of network channels that are coupled to a switch that distributes network packets to the ports, the method comprising:
establishing, by the local host, a transport level connection between the local host and a remote host;
receiving, from the switch via a first of the ports, a network packet that corresponds to the connection; and
associating the connection with the first port, based upon receiving the network packet via the first port, including transmitting all network packets that correspond to the connection via the first port while the connection is associated with the first port.
9. The method of claim 8, further comprising:
transferring the connection from the first port to the second port, including transmitting all network packets that correspond to the connection via the second port while the connection is associated with the second port.
10. The method of claim 9, wherein transferring the connection from the first port to the second port includes:
transferring the connection from the first port to the host; and
transferring the connection from the host to the second port.
11. The method of claim 9, further comprising:
receiving, via a second of the ports, a second network packet that is associated with the connection, prior to transferring the connection from the first port to the second port.
12. The method of claim 9, wherein the local host has first and second network interface cards, and transferring the connection from the first port to the second port includes transferring the connection from the first network interface card to the second network interface card.
13. The method of claim 9, further comprising:
creating a handle that identifies the connection and the port that is associated with the connection.
14. A local host having a plurality of ports that couple the local host to at least one network, the local host comprising:
a combination of information representing a transport layer connection between the local host and a remote host;
hardware to receive a network packet corresponding to the connection via a first of the ports; and
a processing mechanism to associate the connection with the first port based upon receiving the network packet via the first port, wherein all network packets transmitted by the local host that correspond to the connection are transmitted via the first port while the connection is associated with the first port.
15. The local host of claim 14, further comprising:
a set of instructions running on a processor to establish the connection.
16. The local host of claim 14, wherein the processing mechanism further comprises:
a set of instructions running on a processor to transfer the connection to a second of the ports, wherein all network packets transmitted by the local host that correspond to the connection are transmitted via the second port while the connection is associated with the second port.
17. The method of claim 16, wherein the first port is part of a first network interface card, and the second port is part of a second network interface card.
18. A local host having a plurality of ports that couple the local host to at least one network, each of the local ports including hardware to send and receive network packets, the local host comprising:
a combination of information representing a transport layer connection between the local host and a remote host, the information being computer-readable and stored on a medium; and
a first mechanism that monitors network traffic to determine which of the ports receives a network packet corresponding to the connection; and
a second mechanism that associates the connection with the port that received the network packet, wherein all network packets transmitted by the local host that correspond to the connection are transmitted via the first port while the connection is associated with the first port.
19. A local host having a plurality of ports that couple the local host to at least one network, each of the local ports including hardware to send and receive network packets, the local host comprising:
a first set of instructions running on a processor to create a combination of information representing a transport layer connection between the local host and a remote host; and
a second set of instructions running on the processor to monitor network traffic, identify which one of the ports receives a network packet corresponding to the connection and determine that the connection is associated with the one port.
20. The local host of claim 19, further comprising a mechanism to offload the connection to the one port.
Patent Citations (222)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4366538(A) | 1982-12-01 | Johnson et al. | Applicant |
| US4485455(A) | 1984-11-01 | Boone et al. | Applicant |
| US4485460(A) | 1984-11-01 | Stambaugh | Applicant |
| US4589063(A) | 1986-05-01 | Shah et al. | Applicant |
| US4700185(A) | 1987-10-01 | Balph et al. | Applicant |
| US4991133(A) | 1991-02-01 | Davis et al. | Applicant |
| US5056058(A) | 1991-10-01 | Hirata et al. | Applicant |
| US5058110(A) | 1991-10-01 | Beach et al. | Applicant |
| US5097442(A) | 1992-03-01 | Ward et al. | Applicant |
| US5163131(A) | 1992-11-01 | Row et al. | Applicant |
| US5212778(A) | 1993-05-01 | Dally et al. | Applicant |
| US5280477(A) | 1994-01-01 | Trapp | Applicant |
| US5289580(A) | 1994-02-01 | Latif et al. | Applicant |
| US5303344(A) | 1994-04-01 | Yokoyama et al. | Applicant |
| US5412782(A) | 1995-05-01 | Hausman et al. | Applicant |
| US5418912(A) | 1995-05-01 | Christenson | Applicant |
| US5448566(A) | 1995-09-01 | Richter et al. | Applicant |
| US5485579(A) | 1996-01-01 | Hitz et al. | Applicant |
| US5506966(A) | 1996-04-01 | Ban | Applicant |
| US5511169(A) | 1996-04-01 | Suda | Applicant |
| US5517668(A) | 1996-05-01 | Szwerinski et al. | Applicant |
| US5524250(A) | 1996-06-01 | Chesson et al. | Applicant |
| US5535375(A) | 1996-07-01 | Eshel et al. | Applicant |
| US5548730(A) | 1996-08-01 | Young et al. | Applicant |
| US5566170(A) | 1996-10-01 | Bakke et al. | Applicant |
| US5574919(A) | 1996-11-01 | Netravali et al. | Applicant |
| US5588121(A) | 1996-12-01 | Reddin et al. | Applicant |
| US5590328(A) | 1996-12-01 | Seno et al. | Applicant |
| US5592622(A) | 1997-01-01 | Isfeld et al. | Applicant |
| US5598410(A) | 1997-01-01 | Stone | Applicant |
| US5619650(A) | 1997-04-01 | Bach et al. | Applicant |
| US5629933(A) | 1997-05-01 | Delp et al. | Applicant |
| US5633780(A) | 1997-05-01 | Cronin et al. | Applicant |
| US5634099(A) | 1997-05-01 | Andrews et al. | Applicant |
| US5634127(A) | 1997-05-01 | Cloud et al. | Applicant |
| US5642482(A) | 1997-06-01 | Pardillos | Applicant |
| US5664114(A) | 1997-09-01 | Krech, Jr. et al. | Applicant |
| US5671355(A) | 1997-09-01 | Collins | Applicant |
| US5678060(A) | 1997-10-01 | Yokoyama et al. | Applicant |
| US5682534(A) | 1997-10-01 | Kapoor et al. | Applicant |
| US5692130(A) | 1997-11-01 | Shobu et al. | Applicant |
| US5699317(A) | 1997-12-01 | Sartore et al. | Applicant |
| US5699350(A) | 1997-12-01 | Kraslavsky | Applicant |
| US5701434(A) | 1997-12-01 | Nakagawa | Applicant |
| US5701516(A) | 1997-12-01 | Cheng et al. | Applicant |
| US5727142(A) | 1998-03-01 | Chen | Applicant |
| US5742765(A) | 1998-04-01 | Wong et al. | Applicant |
| US5749095(A) | 1998-05-01 | Hagersten | Applicant |
| US5751715(A) | 1998-05-01 | Chan et al. | Applicant |
| US5752078(A) | 1998-05-01 | Delp et al. | Applicant |
| US5758084(A) | 1998-05-01 | Silverstein et al. | Applicant |
| US5758089(A) | 1998-05-01 | Gentry et al. | Applicant |
| US5758186(A) | 1998-05-01 | Hamilton et al. | Applicant |
| US5758194(A) | 1998-05-01 | Kuzma | Applicant |
| US5768618(A) | 1998-06-01 | Erickson et al. | Applicant |
| US5771349(A) | 1998-06-01 | Picazo, Jr. et al. | Applicant |
| US5774660(A) | 1998-06-01 | Brendel et al. | Applicant |
| US5778013(A) | 1998-07-01 | Jedwab | Applicant |
| US5778419(A) | 1998-07-01 | Hansen et al. | Applicant |
| US5790804(A) | 1998-08-01 | Osborne | Applicant |
| US5794061(A) | 1998-08-01 | Hansen et al. | Applicant |
| US5802258(A) | 1998-09-01 | Chen | Applicant |
| US5802580(A) | 1998-09-01 | McAlpice | Applicant |
| US5809328(A) | 1998-09-01 | Nogales et al. | Applicant |
| US5809527(A) | 1998-09-01 | Cooper et al. | Applicant |
| US5812775(A) | 1998-09-01 | Van Seeters et al. | Applicant |
| US5815646(A) | 1998-09-01 | Purcell et al. | Applicant |
| US5828835(A) | 1998-10-01 | Isfeld et al. | Applicant |
| US5848293(A) | 1998-12-01 | Gentry et al. | Applicant |
| US5872919(A) | 1999-02-01 | Wakeland et al. | Applicant |
| US5878225(A) | 1999-03-01 | Bilansky et al. | Applicant |
| US5892903(A) | 1999-04-01 | Klaus | Applicant |
| US5898713(A) | 1999-04-01 | Melzer et al. | Applicant |
| US5913028(A) | 1999-06-01 | Wang et al. | Applicant |
| US5920566(A) | 1999-07-01 | Hendel et al. | Applicant |
| US5930830(A) | 1999-07-01 | Mendelson et al. | Applicant |
| US5931918(A) | 1999-08-01 | Row et al. | Applicant |
| US5935205(A) | 1999-08-01 | Murayama et al. | Applicant |
| US5937169(A) | 1999-08-01 | Connery et al. | Applicant |
| US5941969(A) | 1999-08-01 | Ram et al. | Applicant |
| US5941972(A) | 1999-08-01 | Hoese et al. | Applicant |
| US5950203(A) | 1999-09-01 | Stakuis et al. | Applicant |
| US5987022(A) | 1999-11-01 | Geiger et al. | Applicant |
| US5991299(A) | 1999-11-01 | Radogna et al. | Applicant |
| US5996013(A) | 1999-11-01 | Delp et al. | Applicant |
| US5996024(A) | 1999-11-01 | Blumenau | Applicant |
| US6005849(A) | 1999-12-01 | Roach et al. | Applicant |
| US6009478(A) | 1999-12-01 | Panner et al. | Applicant |
| US6016513(A) | 2000-01-01 | Lowe | Applicant |
| US6021446(A) | 2000-02-01 | Gentry et al. | Applicant |
| US6026452(A) | 2000-02-01 | Pitts | Applicant |
| US6034963(A) | 2000-03-01 | Minami et al. | Applicant |
| US6038562(A) | 2000-03-01 | Anjur et al. | Applicant |
| US6041058(A) | 2000-03-01 | Flanders et al. | Applicant |
| US6041381(A) | 2000-03-01 | Hoese | Applicant |
| US6044438(A) | 2000-03-01 | Olnowich | Applicant |
| US6047356(A) | 2000-04-01 | Anderson et al. | Applicant |
| US6049528(A) | 2000-04-01 | Hendel et al. | Applicant |
| US6057863(A) | 2000-05-01 | Olarig | Applicant |
| US6061368(A) | 2000-05-01 | Hitzelberger | Applicant |
| US6065096(A) | 2000-05-01 | Day et al. | Applicant |
| US6067569(A) | 2000-05-01 | Khaki et al. | Applicant |
| US6070200(A) | 2000-05-01 | Gates et al. | Applicant |
| US6078733(A) | 2000-06-01 | Osborne | Applicant |
| US6097734(A) | 2000-08-01 | Gotesman et al. | Applicant |
| US6101555(A) | 2000-08-01 | Goshey et al. | Applicant |
| US6111673(A) | 2000-08-01 | Chang et al. | Applicant |
| US6115615(A) | 2000-09-01 | Ota et al. | Applicant |
| US6122670(A) | 2000-09-01 | Bennett et al. | Applicant |
| US6141701(A) | 2000-10-01 | Whitney | Applicant |
| US6141705(A) | 2000-10-01 | Anand et al. | Applicant |
| US6145017(A) | 2000-11-01 | Ghaffari | Applicant |
| US6157944(A) | 2000-12-01 | Pedersen | Applicant |
| US6157955(A) | 2000-12-01 | Narad et al. | Applicant |
| US6172980(B1) | 2001-01-01 | Flanders et al. | Applicant |
| US6173333(B1) | 2001-01-01 | Jolitz et al. | Applicant |
| US6181705(B1) | 2001-01-01 | Kim | Applicant |
| US6202105(B1) | 2001-03-01 | Gates et al. | Applicant |
| US6223242(B1) | 2001-04-01 | Sheafor et al. | Applicant |
| US6226680(B1) | 2001-05-01 | Boucher et al. | Applicant |
| US6246683(B1) | 2001-06-01 | Connery et al. | Applicant |
| US6247060(B1) | 2001-06-01 | Boucher et al. | Applicant |
| US6279051(B1) | 2001-08-01 | Gates et al. | Applicant |
| US6289023(B1) | 2001-09-01 | Dowling et al. | Applicant |
| US6298403(B1) | 2001-10-01 | Suri et al. | Applicant |
| US6324649(B1) | 2001-11-01 | Eyres et al. | Applicant |
| US6334153(B2) | 2001-12-01 | Boucher et al. | Applicant |
| US6343360(B1) | 2002-01-01 | Feinleib | Applicant |
| US6345301(B1) | 2002-02-01 | Burns et al. | Applicant |
| US6345302(B1) | 2002-02-01 | Bennett et al. | Applicant |
| US6356951(B1) | 2002-03-01 | Gentry et al. | Applicant |
| US6370599(B1) | 2002-04-01 | Anand et al. | Applicant |
| US6385647(B1) | 2002-05-01 | Willis et al. | Applicant |
| US6389468(B1) | 2002-05-01 | Muller et al. | Applicant |
| US6389479(B1) | 2002-05-01 | Boucher | Applicant |
| US6393487(B2) | 2002-05-01 | Boucher et al. | Applicant |
| US6421742(B1) | 2002-07-01 | Tillier | Applicant |
| US6421753(B1) | 2002-07-01 | Hoese et al. | Applicant |
| US6427169(B1) | 2002-07-01 | Elzur | Applicant |
| US6427171(B1) | 2002-07-01 | Craft et al. | Applicant |
| US6427173(B1) | 2002-07-01 | Boucher et al. | Applicant |
| US6434620(B1) | 2002-08-01 | Boucher et al. | Applicant |
| US6434651(B1) | 2002-08-01 | Gentry, Jr. | Applicant |
| US6449656(B1) | 2002-09-01 | Elzur et al. | Applicant |
| US6453360(B1) | 2002-09-01 | Muller et al. | Applicant |
| US6470415(B1) | 2002-10-01 | Starr et al. | Applicant |
| US6473425(B1) | 2002-10-01 | Bellaton et al. | Applicant |
| US6480489(B1) | 2002-11-01 | Muller et al. | Applicant |
| US6487202(B1) | 2002-11-01 | Klausmeier et al. | Applicant |
| US6487654(B2) | 2002-11-01 | Dowling | Applicant |
| US6490631(B1) | 2002-12-01 | Teich et al. | Applicant |
| US6502144(B1) | 2002-12-01 | Accarie | Applicant |
| US6523119(B2) | 2003-02-01 | Pavlin et al. | Applicant |
| US6526446(B1) | 2003-02-01 | Yang et al. | Applicant |
| US6570884(B1) | 2003-05-01 | Connery et al. | Applicant |
| US6591302(B2) | 2003-07-01 | Boucher et al. | Applicant |
| US6591310(B1) | 2003-07-01 | Johnson | Applicant |
| US6648611(B2) | 2003-11-01 | Morse et al. | Applicant |
| US6650640(B1) | 2003-11-01 | Muller et al. | Applicant |
| US6657757(B1) | 2003-12-01 | Chang et al. | Applicant |
| US6658480(B2) | 2003-12-01 | Boucher et al. | Applicant |
| US6678283(B1) | 2004-01-01 | Teplitsky | Applicant |
| US6681364(B1) | 2004-01-01 | Calvignac et al. | Applicant |
| US6687758(B2) | 2004-02-01 | Craft et al. | Examiner |
| US6697868(B2) | 2004-02-01 | Craft et al. | Applicant |
| US6751665(B2) | 2004-06-01 | Philbrick et al. | Applicant |
| US6757746(B2) | 2004-06-01 | Boucher et al. | Applicant |
| US6765901(B1) | 2004-07-01 | Johnson et al. | Applicant |
| US6807581(B1) | 2004-10-01 | Starr et al. | Applicant |
| US6842896(B1) | 2005-01-01 | Redding et al. | Applicant |
| US6912522(B2) | 2005-06-01 | Edgar | Applicant |
| US6938092(B2) | 2005-08-01 | Burns | Examiner |
| US6941386(B2) | 2005-09-01 | Craft et al. | Applicant |
| US6965941(B2) | 2005-11-01 | Boucher et al. | Applicant |
| US6996070(B2) | 2006-02-01 | Starr et al. | Applicant |
| US7042898(B2) | 2006-05-01 | Blightman et al. | Applicant |
| US7076568(B2) | 2006-07-01 | Philbrick et al. | Applicant |
| US7089326(B2) | 2006-08-01 | Boucher et al. | Applicant |
| US7093099(B2) | 2006-08-01 | Bodas et al. | Applicant |
| US7124205(B2) | 2006-10-01 | Craft et al. | Applicant |
| US7133940(B2) | 2006-11-01 | Blightman et al. | Applicant |
| US7167926(B1) | 2007-01-01 | Boucher et al. | Applicant |
| US7167927(B2) | 2007-01-01 | Philbrick et al. | Applicant |
| US7174393(B2) | 2007-02-01 | Boucher et al. | Applicant |
| US7185266(B2) | 2007-02-01 | Blightman et al. | Applicant |
| US7191241(B2) | 2007-03-01 | Boucher et al. | Applicant |
| US7191318(B2) | 2007-03-01 | Tripathy et al. | Applicant |
| US7237036(B2) | 2007-06-01 | Boucher et al. | Applicant |
| US7254696(B2) | 2007-08-01 | Mittal et al. | Applicant |
| US7284070(B2) | 2007-10-01 | Boucher et al. | Applicant |
| US7287092(B2) | 2007-10-01 | Sharp | Examiner |
| US2001/0004354(A1) | 2001-06-01 | Jolitz | Applicant |
| US2001/0013059(A1) | 2001-08-01 | Dawson et al. | Applicant |
| US2001/0014892(A1) | 2001-08-01 | Gaither et al. | Applicant |
| US2001/0014954(A1) | 2001-08-01 | Purcell et al. | Applicant |
| US2001/0025315(A1) | 2001-09-01 | Jolitz | Applicant |
| US2001/0048681(A1) | 2001-12-01 | Bilic et al. | Applicant |
| US2001/0053148(A1) | 2001-12-01 | Bilic et al. | Applicant |
| US2002/0073223(A1) | 2002-06-01 | Darnell et al. | Applicant |
| US2002/0112175(A1) | 2002-08-01 | Makofka et al. | Applicant |
| US2003/0066011(A1) | 2003-04-01 | Oren | Applicant |
| US2003/0110344(A1) | 2003-06-01 | Szezepanek et al. | Applicant |
| US2003/0140124(A1) | 2003-07-01 | Burns | Examiner |
| US2003/0165160(A1) | 2003-09-01 | Minami et al. | Applicant |
| US2004/0054814(A1) | 2004-03-01 | McDaniel | Applicant |
| US2004/0059926(A1) | 2004-03-01 | Angelo et al. | Applicant |
| US2004/0062245(A1) | 2004-04-01 | Sharp et al. | Examiner |
| US2004/0153578(A1) | 2004-08-01 | Elzur | Applicant |
| US2004/0213290(A1) | 2004-10-01 | Johnson et al. | Applicant |
| US2004/0246974(A1) | 2004-12-01 | Gyugyi et al. | Applicant |
| WO98/19412 | 1998-05-01 | Applicant | |
| WO98/50852 | 1998-11-01 | Applicant | |
| WO99/04343 | 1999-01-01 | Applicant | |
| WO99/65219 | 1999-12-01 | Applicant | |
| WO/13091 | 2000-03-01 | Applicant | |
| WO1/04770 | 2001-01-01 | Applicant | |
| WO1/05107 | 2001-01-01 | Applicant | |
| WO1/05116 | 2001-01-01 | Applicant | |
| WO1/05123 | 2001-01-01 | Applicant | |
| WO1/40960 | 2001-06-01 | Applicant | |
| WO1/59966 | 2001-08-01 | Applicant | |
| WO1/86430 | 2001-11-01 | Applicant |
Non-Patent Literature (66)
- Andrew S. Tanenbaum, Computer Networks, Third Edition, 1996, ISBN 0-13-349945-6.Applicant
- Article from Rice University entitled “LRP: A New Network Subsystem Architecture for Server Systems”, by Peter Druschel and Gaurav Banga, 14 pages.Applicant
- 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.Applicant
- WindRiver article entitled “Tornado: For Intelligent Network Acceleration”, copyright Wind River Systems, 2001, 2 pages.Applicant
- WindRiver White Paper entitled “Complete TCP/IP Offload for High-Speed Ethernet Networks”, Copyright Wind River Systems, 2002, 7 pages.Applicant
- Intel article entitled “Solving Server Bottlenecks with Intel Server Adapters”, Copyright Intel Corporation, 1999, 8 pages.Applicant
- U.S. Provisional Patent Application No. 60/053,240, Titled: TCP/IP Network Accelerator and Method of Use, Filed Jul. 17, 1997, Inventor: William Jolizt et al.Applicant
- 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.Applicant
- Form 10-K for Exelan, Inc., for the fiscal year ending Dec. 31, 1987 (10 pages).Applicant
- Form 10-K for Exelan, Inc., for the fiscal year ending Dec. 31, 1988 (10 pages).Applicant
- Internet pages entitled “Hardware Assisted Protocol Processing”, (which Eugene Feinber is working on), 1 page, printed Nov. 25, 1998.Applicant
- Zilog product Brief entitled “Z85C30 CMOS SCC Serial Communication Controller”, Zilog Inc., 3 pages, 1997.Applicant
- Internet pages of Xpoint Technologies, Inc. entitled “Smart LAN Work Requests”, 5 pages, printed Dec. 19, 1997.Applicant
- Internet pages entitled: Asante and 100BASE-T Fast Ethernet. 7 pages, printed May 27, 1997.Applicant
- Internet pages entitled: A Guide to the Paragon XP/S-A7 Supercomputer at Indiana University. 13 pages, printed Dec. 21, 1998.Applicant
- Richard Stevens, “TCP/IP Illustrated, vol. 1, The Protocols”, pp. 325-326 (1994).Applicant
- Internet pages entitled: Northridge/Southbridge vs. Intel Hub Architecture, 4 pages, printed Feb. 19, 2001.Applicant
- Gigabit Ethernet Technical Brief, Achieving End-to-End Performance. Alteon Networks, Inc., First Edition, Sep. 1996, 15 pages.Applicant
- Internet pages directed to Technical Brief on Alteon Ethernet Gigabit NIC technology, www.alteon.com; 14 pages, printed Mar. 15, 1997.Applicant
- VIA Technologies, Inc. article entitled “VT8501 Apollo MVP4”, pages i-iv, 1-11, cover and copyright page, revision 1.3, Feb. 1, 2000.Applicant
- 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.Applicant
- “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.Applicant
- Internet pages from iReady Products, web sitehttp://www.ireadyco.com/products,html, 2 pages, downloaded Nov. 25, 1998.Applicant
- iReady News Archives, Toshiba, iReady shipping Internet chip, 1 page, printed Nov. 25, 1998.Applicant
- Interprophet article entitled “Technology”, http://www.interprophet.com/technology.html, 17 pages, printed Mar. 1, 2000.Applicant
- iReady Corporation, article entitled “The I-1000 Internet Tuner”, 2 pages, date unknown.Applicant
- iReady article entitled “About Us Introduction”, Internet pages fromhttp://www.iReadyco.com/about.html, 3 pages, printed Nov. 25, 1998.Applicant
- 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.Applicant
- 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.Applicant
- NewSwatch article entitled “iReady internet Tuner to Web Enable Devices”, Tuesday, Nov. 5, 1996, printed Nov. 2, 1998, 2 pages.Applicant
- EETimes article entitled “Tuner for Toshiba, Toshiba Taps iReady for Internet Tuner”, by David Lammers, 2 pages, printed Nov. 2, 1998.Applicant
- “Comparison of Novell Netware and TCP/IP Protocol Architectures”, by J.S. Carbone, 19 pages, printed Apr. 10, 1998.Applicant
- Adaptec article entitled “AEA-7110C-a DuraSAN product”, 11 pages, printed Oct. 1, 2001.Applicant
- iSCSI HBA article entitled “iSCSI and 2Gigabit fibre Channel Host Bus Adapters from Emulex, QLogic, Adaptec, JNI”, 8 pages, printed Oct. 1, 2001.Applicant
- iSCSI HBA article entitled “FCE-3210/6410 32 and 64-bit PCI-to-Fibre Channel HBA”, 6 pages, printed Oct. 1, 2001.Applicant
- ISCSI.com article entitled “iSCSI Storage”, 2 pages, printed Oct. 1, 2001.Applicant
- “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.Applicant
- 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.Applicant
- Internet pages of InterProphet entitled “Frequently Asked Questions”, by Lynne Jolitz, printed Jun. 14, 2000, 4 pages.Applicant
- “File System Design For An NFS File Server Appliance”, Article by D. Hitz, et al., 13 pages.Applicant
- Adaptec Press Release article entitled “Adaptec Announces EtherStorage Technology”, 2 pages, May 4, 2000, printed Jun. 14, 2000.Applicant
- Adaptec article entitled “EtherStorage Frequently Asked Questions”, 5 pages, printed Jul. 19, 2000.Applicant
- Adaptec article entitled “EtherStorage White Paper”, 7 pages, printed Jul. 19, 2000.Applicant
- CIBC World Markets article entitled “Computers; Storage”, by J. Berlino et al., 9 pages, dated Aug. 7, 2000.Applicant
- Merrill Lynch article entitled “Storage Futures”, by S. Milunovich, 22 pages, dated May 10, 2000.Applicant
- 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.Applicant
- Internet-draft article entitled “SCSI/TCP (SCSI over TCP)”, by J. Satran et al., 38 pages, dated Feb. 2000, printed May 19, 2000.Applicant
- Internet pages entitled Technical White Paper-Xpoint's Disk to LAN Acceleration Solution for Windows NT Server, printed Jun. 5, 1997, 15 pages.Applicant
- Jato Technologies article entitled Network Accelerator Chip Architecture, twelve-slide presentation, printed Aug. 19, 1998, 13 pages.Applicant
- EETimes article entitled Enterprise System Uses Flexible Spec, dated Aug. 10,1998, printed Nov. 25, 1998, 3 pages.Applicant
- Internet pages entitled “Smart Ethernet Network Interface Cards”, which Berend Ozceri is developing, printed Nov. 25, 1998, 2 pages.Applicant
- Internet pages of Xaqti corporation entitled “GigaPower Protocol Processor Product Review,” printed Nov. 25, 1999, 4 pages.Applicant
- U.S. Provisional Patent Application No. 60/283,896, Titled: CRC Calculations for Out of Order PUDs, Filed Apr. 12, 2003, Inventor: Amit Oren, Assignee: Siliquent Technologies Ltd.Applicant
- Internet pages entitled “Dart: Fast Application Level Networking via Data-Copy Avoidance,” by Robert J. Walsh, printed Jun. 3, 1999, 25 pages.Applicant
- Rice University article entitled “LRP: A Network Subsystem Architecture for Server Systems”, by P. Druschel and G. Banga, 14 pages.Applicant
- Internet RFC/STD/FYI/BCP Archives article with heading “RFC2140” entitled “TCP Control Block Interdependence”, web address http://www.faqs.org/ftp/rfc/pdf/rfc2140.txt.pdf, 11 pages, Apr. 1997.Applicant
- 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.Applicant
- 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.Applicant
- Chesson et al., IEEE Syposium Record entitled, “The Protocol Engine Chipset”, from Hot Chips III, 16 pages, Aug. 26-27, 1991.Applicant
- 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.Applicant
- 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.Applicant
- Strayer et al., “Ch. 9: The Protocol Engine” from XTP: The Transfer Protocol, 12 pages, Jul. 1992.Applicant
- Publication entitled “Protocol Engine Handbook”, 44 pages, Oct. 1990.Applicant
- Koufopavlou et al., IEEE Global Telecommunications Conference, Globecom '92, presentation entitled, “Parallel TCP for High Performance Communication Subsystems”, 7 pages, Dec. 6-9, 1992.Applicant
- Lilienkamp et al., Publication entitled “Proposed Host-Front End Protocol”, 56 pages, Dec. 1984.Applicant
- Thla, Y.H. Publication entitled A Reduced Operational Protocol Engine (ROPE) for a multiple-layer bypass architecture, 16 pages.Applicant