Certain embodiments of the present invention relate to processing of TCP data and related TCP information. More specifically, certain embodiments relate to a method and system for TCP/IP offload.
The transmission control protocol/internet protocol (TCP/IP) is a protocol that has been widely utilized for communications. Conventional network interface cards (NICs) typically contain specialized processors or accelerators that may be adapted to handle the processing of packetized information received from a transmission medium. In a typical network interface card, the reception of data may include processing of packetized data in a plurality of communications layers before the data is copied to its final destination, for example, an application buffer. However, receiving, buffering, processing and storing the packetized data communicated in TCP segments can consume a substantial amount of host processing power and memory bandwidth at the receiver. With today's high speed communication systems of the order of Gigabits, these conventional network interface cards are inefficient and unable to manage such high speeds.
TCP segmentation is a technology that may permit a very small portion of TCP processing to be offloaded to a network interface card (NIC). In this regard, a NIC that supports TCP segmentation does not truly incorporate a full transmission control processing offload engine. Rather, a NIC that supports TCP segmentation only has the capability to segment outbound TCP blocks into packets having a size equivalent to that which the physical medium supports. Each of the outbound TCP blocks is smaller than a permissible TCP window size. For example, an Ethernet network interface card that supports TCP Segmentation, may segment a 4 KB block of TCP data into 3 Ethernet packets. The maximum size of an Ethernet packet is 1518 bytes inclusive of header and a trailing CRC.
A device that supports TCP segmentation does track certain TOP state information such as the TCP sequence number that is related to the data that the offload NIC is segmenting. However, the device that supports TCP segmentation does not track any state information that is related to inbound traffic, or any state information that is required to support TCP acknowledgements or flow control. A NIC that supports full TCP offload in the established state is responsible for handling TCP flow control, and responsible for handling incoming TCP acknowledgements, and generating outbound TCP acknowledgements for incoming data.
TCP segmentation may be viewed as a subset of TCP offload. TCP segmentation allows the protocol stack or operating system to pass information in the form of blocks of TCP data that has not been segmented into individual TCP packets to a device driver. The block of data may be 4 Kbytes or 16 Kbytes. A network adapter associated with the device driver may acquire the blocks of TCP data, packetize the acquired blocks of TCP data into 1518-byte Ethernet packets and update certain fields in each incrementally created packet. For example, the network adapter may update a corresponding TCP sequence number for each of the TCP packets by incrementing the TCP sequence number for each of the packets. In another example, an IP identification (IP ID) field and flag field would also have to be updated for each packet. One limitation with TCP segmentation is that TCP segmentation may only be done on a block of data that is less than a TCP window size. This is due to the fact that a device implementing TCP segmentation has no influence over TCP flow control. Accordingly, the device implementing TCP flow control only segments outbound TCP packets.
A TCP segmentation device does not examine incoming packets and as such, has no influence over flow control. Any received acknowledgement packet is passed up to the host for processing. In this regard, acknowledgement packets that are utilized for flow control are not processed by the TCP segmentation device. Moreover, a TCP segmentation device does not perform congestion control or flow startup and does not calculate or modify any variables that are passed back to the operating system and/or host system processor.
Another limitation with TCP segmentation is that information tracked by TCP segmentation is only information that is pertinent for the lifetime of the TCP data. In this regard, for example, the TCP segmentation device may track TCP segmentation numbers but not TCP acknowledgement (ACK) numbers. Accordingly, the TCP segmentation device tracks only a minimal subset of information related to corresponding TCP data. This limits the capability and/or functionality of the TCP segmentation device. A further limitation with TCP segmentation is that a TCP segmentation device does not pass TCP processed information back to an operating system and/or host processor. This lack of feedback limits the TCP processing that otherwise may be achieved by an operating system and/or host system processor.
Other limitations associated with TCP segmentation are set forth in U.S. patent application Ser. No. 10/652,183, filed Aug. 29, 2003, which is incorporated herein by reference in its entirety.
Since the processing of TCP segments may consume a substantial amount of host processing power and memory bandwidth, in order to alleviate consumption of host resources, some of the TCP processing may be offloaded from the host as shown in
In operation, incoming frames from the Ethernet 60 are received by the NIC 50. The TOE 70 processes the frames and stores them in the reception frame buffer 90. When buffers are available in the host memory 30 and when sufficient frames have been stored, the TOE 70 receives the frames stored in the reception buffer 90 and sends the frames to host memory 30 via the host interface 40 and the memory controller 20. Outgoing frames from the host are sent to the TOE 70 which stores them in the transmission frame buffer 80. When transmitting, the TOE 70 retrieves the frames stored in the transmission frame buffer 80 and transmits them via the Ethernet 60. For high-speed networking such as 10 Gigabits per second Ethernet (GbE), additional copying of data may add unnecessary strain on a computer's or host's memory sub-system. The memory subsystem of most commercially available servers or host computers becomes a bottleneck, thereby preventing the system from supporting high data rates such as 10 Gigabit network traffic. Since TCP/IP is the dominant transport protocol utilized by most applications today, it would therefore be useful to ease the burden of this processing to achieve, for example, scalable low CPU utilization when communicating with a peer machine.
TCP/IP utilizes a datagram service at the IP layer. Under normal operational conditions with router or switch congestion, IP datagrams may be dropped, leading to a “hole” in the stream of datagrams that are on their way to the receiver. The receiver may therefore receive datagrams out of order. Packet drop may also be the result of, for example, other less frequent transmission errors. The common way to deal with this is to buffer the datagrams that were successfully received, while waiting to get the missing datagram or datagrams by retransmission from the source. Retransmission may be triggered by the sender or the receiver. The TCP protocol allows a complete TCP Window of datagrams per connection to be on-flight from the sender to the receiver assuming a high performance configuration. The datagrams may contain 64 KBytes of data, for example. Many applications employ a large number of TCP connections, for example, 1000 to 100,000 TCP connections, to be supported by the receiver. At higher network speeds such as 1 Gigabit per second and higher, it would be inefficient to discard or drain the pipe or a portion of a received data stream every time there is a dropped datagram. TCP bandwidth probing methodologies such as slow start and/or congestion avoidance, which may be triggered at connection startup or when congestion is detected, may result in the loss of precious time and is inefficient since the congestion window is decreased and has to be gradually increased until it is equivalent to a receiver's advertised window size. Therefore, typical TCP implementations set aside a large buffer such as 64 MB to 6.4 GB to handle these situations. This large buffer is used to reassemble TCP/IP data, or IP fragments. The depth of the buffer may be dependent upon the product of connection bandwidth and network delay on the TCP connection. This architecture is therefore sensitive to LAN or WAN configuration and in this regard, more buffers may be utilized for a medium bandwidth, high-delay WAN configuration than for a low delay, high-speed LAN configuration.
The TCP offload architecture illustrated in
Similar considerations are applicable for the transmit side. A TCP sender maintains a transmit frame buffer 80 with all the data it has transmitted as part of the TCP “window”. Once the remote side acknowledges reception of the data, the sender frees the transmit frame buffer 80 and the edge of the TCP window moves to the right. The size of the transmission frame buffer 80 is similar to that of the reception frame, buffer 90, since outstanding data that has not been acknowledged are buffered there, thereby allowing the sender to retransmit in case the receiver on the remote side has not received one or more of the datagrams. Similar to the receive side, this is also a store & forward architecture.
Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of ordinary skill in the art through comparison of such systems with some aspects of the present invention as set forth in the remainder of the present application with reference to the drawings.
Certain embodiments of the present invention may found in a system and method for TCP offloading. The system may comprise a host comprising a host memory and a network interface card (NIC) coupled to the host. The NIC may comprise at least one TCP enabled Ethernet controller (TEEC). The TEEC may comprise at least one internal elastic buffer. In this regard, the TEEC may comprise a receive internal elastic buffer and/or a transmit internal elastic buffer. The TEEC may be configured to process an incoming TCP packet once without any assembly. In this regard, the TEEC may process an incoming TCP packet once without assembling the TCP packet data with the TCP data from adjacent packets for the same flow, and temporarily buffer at least a portion of the incoming TCP packet in the internal elastic buffer. At least a portion of the incoming TCP packet may be temporarily buffered in the receive internal elastic register. In a somewhat similar manner, at least a portion of a TCP packet that is to be transmitted may be temporarily buffered in the transmit internal elastic buffer.
The TEEC may be adapted to place at least a portion of the incoming TCP packet data into at least a portion of the host memory. The TEEC may place at least a data portion of an incoming TCP packet into a highest hierarchy of buffer available in the host memory by performing a single copy operation. The TEEC may DMA transfer at least a portion of the processed incoming TCP packet to at least a portion of the host memory. The TEEC may also place at least a portion of the processed incoming TCP packet into host buffers in the host memory for reassembly. The TEEC may be a single chip, which may have at least one internal elastic buffer integrated therein. In this regard, the receive internal elastic buffer and the transmitted internal elastic buffers are integrated with the TEEC.
The method for offloading TCP processing may comprise receiving an incoming TCP packet at a TEEC and processing at least a portion of the incoming packet once by the TEEC without having to do any reassembly or retransmission by the TEEC. At least a portion of the incoming TCP packet may be buffered in at least one internal elastic buffer of the TEEC. The internal elastic buffer may comprise a receive internal elastic buffer and/or a transmit internal elastic buffer. At least a portion of the incoming TCP packet may be buffered in the receive internal elastic buffer. At least a portion of the processed incoming TCP packet may be placed in a portion of a host memory. In this regard, at least a portion of the processed incoming TCP packet may be placed in a highest hierarchy of buffer available in a host memory by performing a single copy Operation. At least a portion of the processed incoming TCP packet may be DMA transferred to a portion of the host memory.
In accordance with an aspect of the invention, TCP packets that are temporarily buffered in the internal elastic buffer do not comprise packets for reassembly and packets for retransmission. A portion of the processed incoming TCP packet may be placed in host buffers located in a host memory for processing by a host processor or CPU. The TEEC may be a single chip having at least one internal elastic buffer. Notwithstanding, the receive internal elastic buffer and the receive internal elastic buffer may be integrated with the chip.
Another embodiment of the invention may also provide a machine-readable storage, having stored thereon, a computer program having at least one code section for providing TCP offload. The at least one code section may be executable by a machine for causing the machine to perform steps as described above for TCP offload.
These and other advantages, aspects and novel features of the present invention, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings.
Certain embodiment of the invention may be found in a system and method for TCP offload. The method may comprise receiving an incoming TCP packet at a TEEC and processing at least a portion of the incoming TCP packet once by the TEEC without having to do any reassembly or retransmission by the TEEC. At least a portion of the incoming TCP packet may be buffered in at least one internal elastic buffer of the TEEC. The internal elastic buffer may comprise a receive internal elastic buffer and/or a transmit internal elastic buffer. Accordingly, at least a portion of the incoming TCP packet may be buffered in the receive internal elastic buffer. At least a portion of the processed incoming packet may be placed in a portion of a host memory. In this regard, at least a portion of the processed incoming TCP packet may be placed in a highest hierarchy of buffer available in a host memory by performing a single copy operation. Furthermore, at least a portion of the processed incoming TCP packet may be DMA transferred to a portion of the host memory.
In accordance with an embodiment of the invention, out-of-order TCP packets may be stored in a small internal elastic buffer The elastic buffer may be a, for example, 64 KB on-chip packet buffer that is utilized to provide elasticity as opposed to a large, for example, multi-megabyte memory that is utilized for packet re-ordering, re-assembly and/or retransmission. The elastic buffer in accordance with the various embodiments of the invention may be typically by a NIC to temporarily buffer at least a portion of an incoming TCP packet. Additionally, a NIC in accordance with an embodiment of the invention will not comprise a dedicated memory which is to be utilized for reordering or, reassembling out-of-sequence TCP packets or IP fragments. Furthermore, in accordance with an embodiment of the invention, the NIC will not include a large TOE dedicated memory that is utilized for packet retransmission and/or packet reassembly. Accordingly, no packet reassembly and/or packet retransmission buffering need be done by a TCP enabled Ethernet controller (TEEC).
Transmission control protocol/internet protocol (TCP/IP) is the leading protocol for network and Internet-based data transfers. The use of TCP/IP is expanding beyond application-to-application communications and file-based storage such as network file system (NFS) and common Internet file system (CIFS) to block-based networked storage such as Internet small computer system interface (iSCSI). TCP/IP may also be used for the transport layer for clustering/Inter-Process-Communication (IPC) using a Remote-DMA (RDMA) protocol.
Processing TCP/IP at wire speed may fully consume, for example, a 1 GHz processor. Using a TCP-enabled Ethernet controller (TEEC) may provide, for example, one or more of the following advantages: reduced host CPU utilization, for example, from approximately 100% when running TCP/IP application to less than approximately 10%; fewer data copies; and fewer interrupts and context switches, which free the host CPU and the system for application processing. Such benefits become even more evident at higher speeds. From a system perspective, using a TEEC NIC may provide a better return-on-investment (ROI), even if some average selling price (ASP) premium over a regular GbE NIC is present, than employing a dedicated processor or substantial portions thereof and its associated system for TCP processing.
Certain aspects of the invention may provide for handling of TCP/IP datagrams in a flow-through manner by dedicating a minimal amount of memory to the transmit path and to the receive path of the TEEC. The respective buffering, processing, reassembling or reordering, processing and placement methodology employed by existing offload systems, for example
In accordance with an aspect of the invention, the TEEC 270 does not require a dedicated memory that is utilized for assembling and/or re-ordering IP packets fragmented at the IP layer. In this regard, out-of-order TCP packets are not stored, re-ordered and/or assembled in a TEEC buffer. Accordingly, the NIC may comprise a single chip, having integrated therein, at least one internal elastic buffer and no internal buffers or interfaces to external buffers that would be utilized for packet retransmission, packet re-assembly and packet re-ordering.
Although illustrated as a controller to the Ethernet 260, the TEEC 270 may be a controller to any type of data link layer or physical media. In one embodiment of the invention, the TEEC 270 may provide at least some functionality of a TOE. The host interface 240 may be, for example, a peripheral component interconnect (PCI), PCI-X, ISA, SCSI or another type of bus. The memory controller 230 may be coupled to the CPU 220, to the memory 230 and to the host interface 240. The host interface 240 may be coupled to the NIC 250 via the TEEC 270. Finally, the TEEC 270 may be coupled to the Ethernet 260.
In operation, on the receive side, a packet or frame may be received by the NIC 250 from the Ethernet 260. In general, the TEEC 270, for example, may parse and process the headers and may temporarily buffer the received packet into a particular location of the receive elastic buffer 290. In this regard, the TEEC may process each incoming packet “on the fly.” Based on, for example, control information, header information and/or payload information associated with the received packet, placement information may be determined and/or ascertained. Upon determining the placement information for the received packet, the TEEC 270 may transfer the received packet to the host where the received packet may be stored in the host memory 230 for processing.
In one aspect of the invention, at least a portion of the received packets may have been processed by the TEEC 270 and may be queued in the receive elastic buffer 290. The queued portion of the received packet may be DMA transferred from the receive elastic buffer 290 into the host memory 230. In this regard, the TEEC 270 may comprise suitable DMA hardware and/or code that may be adapted to directly transfer the portions of the received packet from the receive elastic buffer 290 to the host memory 230 via the host interface 240. Therefore, packets may be transported from the wire of the Ethernet 260, processed “on the fly” and temporarily buffered in the receive elastic buffer 290. Due to the “on-the-fly” processing and temporary buffering in the NIC 250, no reassembling or reordering of packets is done on the NIC 250.
In another aspect of the invention, the system may also handle out-of-order frames as may occur during, for example, frame delay or frame loss. For example, the TEEC 270 may manage the hole or holes until the correct data is received. On the transmit path, transmission may be accomplished from the transmit elastic buffers 280 of the NIC 250. In this regard, TCP data that is to be sent to the Ethernet interface may be transferred from the host memory 230 and temporarily buffered in the transmit elastic buffer 280. The TEEC 270 may perform an “on-the-fly” transmission. The TEEC 270 may fetch the transmit TCP data from the host, temporarily buffer the fetched data in the transmit elastic buffer and process the data for transmission. This comprises constructing this data into one or more Ethernet packets, by formatting and appending higher layer protocol headers and error recovery codes. After transmission, the data may be maintained on the host under the ownership of, for example, the TEEC 270. In an aspect of the invention, no copy of the packets or outstanding TCP transmit data is stored locally on the TEEC 270 to facilitate retransmission. In this regard, the TEEC 270 may be adapted to facilitate retransmission by fetching data again from the host memory 230 and temporarily buffering the fetched data in the transmit elastic buffer 280. Once data has been acknowledged by a remote peer, the host buffers of the sender may be freed to their original owner such as an application or a ULP.
In accordance with the invention, on the receive side, unlike the TOE 70 of
In certain aspects of the invention, the host memory 230 may be utilized, for example, to re-assemble receive traffic or for transmit activity and retransmit activity. This eliminates the need for the TEEC 270 to have dedicated external memory. This may reduce, for example, one or more of the following: cost, complexity, footprint and power consumption. In addition, this may eliminate or reduce bandwidth-delay-product dependency. The host memory 30 may be typically larger and more scalable than any memory that can be economically and feasibly attached to a TEEC. It may also represent the limit for the ability of a machine to buffer data since it may be the source and destination for the data, when applications and TCP are launched. It may also represent the limit of monolithic software stacks.
Certain embodiment of the invention may also provide a virtually bufferless or reduced buffer architecture when compared to conventional offload engines. In this regard, although not a truly bufferless design, when compared to the conventional TOE 70 of
The virtually bufferless architecture or reduced buffer architecture for the TEEC may be extended to as high a level of processing as may be supported by a particular TEEC during its “one-touch” processing. Data may be placed directly in an L5 or higher buffer if that buffer information and protocol parsing information can be supplied to the TEEC system. The virtually bufferless or reduced buffer architecture may support concurrent operation, for example, of TCP Layer 2 (L2), Layer 4 (L4) and Layer 5 (L5) with a flexible switch between them.
In an aspect of the invention, the TEEC 75 may act as a pure Ethernet controller and provide a complete set of L2 services, unlike many conventional TOE devices. The TEEC 75 may also act as a pure TEEC or may have some of the traffic, for example, at L2 such as non-TCP Ethernet traffic, and some at L4. For the L2 traffic, L2 services may be provided such as, for example, Ethernet address comparison and CRC computation. For the L4 traffic, additional services may be provided including, for example, TCP/IP processing on the device. The TEEC 75 may also act as a pure L5 or higher enabled controller. Any level of processing may also be used in any combination for different connections passing through the TEEC 75. There may be no limit on the traffic mix and no need for external software intervention to help the hardware manage it. Some embodiments according to the invention may target only L4 services. This novel approach to TCP/IP processing may not be, necessarily dependent on the Ethernet and may be applied to any other L1/L2 interfaces.
The processing element 310 may further process the received control information from the processing element 300. In one embodiment, the processing element 310 may be adapted to perform L4/L5 or higher processing. Context information tracked, for example, in local storage 340 may be accessed by the processing element 310. The processing element 310 may take context information tracked in local storage 340 and the control information received from the previous processing element 300 and process and combine the information before sending the combined information to the DMA engine 320. The DMA engine 320 may combine the control information from the control path and the data stored in the storage element 330 of the data path before directly storing the data or the combined information in one or more host buffers.
The receive system architecture may comprise, for example, a control path processing and data movement engine. The system components above the control path as illustrated in upper portion of
The receiving system may perform, for example, one or more of the following: parsing the TCP/IP headers; associating the frame with an end-to-end TCP/IP connection; fetching the TCP connection context; processing the TCP/IP headers; determining header/data boundaries; mapping the data to a host buffer(s); and transferring the data via a DMA engine into these buffer(s). The headers may be consumed on chip or transferred to the host via the DMA engine.
The packet buffer is a block in the receive system architecture. It may be utilized for the same purpose as, for example, a first-in-first-out (FIFO) data structure is used in a conventional L2 NIC or for storing higher layer traffic for additional processing.
The packet buffer in the receive system may not be limited to a single instance. As control path processing is performed, the data path may store the data between data processing stages one or more times depending, for example, on protocol requirements.
The rest of the IP processing may subsequently take place later in a manner similar to the processing in a conventional off-the-shelf software stack. Implementation may vary from the use of firmware on an embedded processor to a dedicated, finite state machine, which may be potentially faster, or a hybrid of a processor and a state machine. The implementation may vary with, for example, multiple stages of processing by one or more processors, state machines, or hybrids. The IP processing may comprise, for example, extracting information relating to, for example, length, validity, fragmentation, etc. The located TCP header may also be parsed and processed.
The TCP processing may be divided into a plurality of additional processing stages. In step 120, the frame may be associated with an end-to-end TCP/IP connection. After L2 processing, in one embodiment, the present invention may provides that the TCP checksum be verified. The end-to-end connection may be uniquely defined by, for example, the following 5 tuple: IP Source address (IP SRC addr); IP destination address (IP DST addr); L4 protocol above the IP protocol (e.g., TCP, UDP or other upper layer protocol); TCP source port number (TCP SRC); and TCP destination port number (TCP DST). The process may be applicable for IPv4 or IPv6 with the choice of the relevant IP address.
As a result of the frame parsing in step 110, the 5 tuple may be completely extracted and may be available inside the PID_C. Association hardware may compare the received 5 tuple with a list of 5 tuples stored in the TEEC. The TEEC may maintain a list of tuples representing, for example, previously handled off-loaded connections or off-loaded connections being managed by the TEEC. The memory resources used for storing the association information may be costly for on-chip and off-chip options. Therefore, it is possible that not all of the association information may be housed on chip. A cache may be used to store the most active connections on chip. If a match is found, then the TEEC may be managing the particular TCP/IP connection with the matching 5 tuple.
The TCP processing implementation may vary from the use of firmware on an embedded processor to a dedicated, finite state machine, which may be potentially faster, or a hybrid of a processor and a state machine. The implementation may vary with multiple stages of processing by one or more processors, state machines or hybrids. The TCP processing may comprise, for example, extracting information relating to, for example, length, validity, fragmentation, etc. The located TCP header may also be parsed and processed.
Any higher levels of processing such as L5 and above, may take place later in a manner similar to the processing in a conventional off-the-shelf software stack. Implementation may vary from the use of firmware on an embedded processor to a dedicated, finite state machine, which may be potentially faster, or a hybrid of a processor and a state machine. The implementation may vary with multiple stages of processing by one or more processors, state machines or hybrids. The higher level processing may comprise, for example, extracting security, placement and buffer management information relating to, for example, the frame. The higher level processing is not limited to these operations.
Referring to
Also referring to
In step 130, TCP connection context may be fetched from, for example, a context memory. The context information may comprise, for example, TCP variables utilized to process the frame and the buffer information in the host where the data is to be stored.
In step 140, the TCP/IP headers may be processed. Some IP and TCP frame validity checks, for example, IPv4 header checksum, and TCP checksum, may be performed along with data movement from the frame parser to the frame buffer. Results may be registered inside the PID_C. The TCP/IP headers, the context fetched from the context memory and the information generated thus far in the PID_C may be provided to the receiver processing block, which may comprise one or more processors and/or finite state machines. The receiver processing block may utilize, for example, the context information to complete additional TCP/IP processing for the frame including, for example, updating TCP state variables or resetting timers as set forth in RFC 793. The receiver processing block may also use the partial results provided by the frame parser and the association block that may have previously been stored in the PID_C. If processing is completed with no errors, then the data may be mapped into the host buffer for storage. The receiver processing block may signal the transmitter side for future transmission of TCP acknowledgements for the connection after the data has been successfully stored in the host memory buffer.
In step 150, the header/data boundaries may be determined. The results of the processing in the control path may determine the boundaries between the packet portions that are treated as headers and the packet portions that are treated as data or payload. Although the data may be moved to a host buffer, the headers may be consumed by the TEEC or may be moved to a separate host buffer for statistics, debug or further processing.
In step 160, the data inside the received packet belonging to a particular 5 tuple connection may be mapped to the host resident buffer(s) allocated for that particular connection. The allocated buffers may have been pre-allocated by an application or a protocol processing layer (e.g., a TCP layer). In one example, the allocated buffers are temporary buffers.
The host may describe the buffers by using a list structure that describes each buffer with, for example, a physical address in host memory and a length in bytes. The host may also describe the buffers in other manners such as, for example, via a page table structure. The TEEC may read the buffer information and may construct a mapping between TCP sequence numbers of the incoming packets and the host buffers. A particular TCP sequence number may be mapped, for example, to the start of a specific buffer or into some offset into a specific buffer. The mapping may be initialized when a buffer is assigned to an offloaded connection. As packets are received, they are compared to the buffer mapping information based upon, for example, length and the TCP sequence number. Based upon the comparison, one packet may be mapped into one or more buffers. In turn, one or more instructions may be generated to the DMA engine to move the packet data into the host buffer or buffers.
The TEEC may map the TCP sequence number, which may be carried in the TCP header of the packet, of the first payload byte to an offset inside the host resident buffers provided to the TEEC. In step 170, the TEEC may deposit the TCP segment data directly into the host buffers, for example, TCP buffers, pre-posted application buffers. TCP data may be, for example, reassembled in the host memory without keeping a local copy on the TEEC. It may also save on copying the data on the host, saving precious CPU cycles and preserving bandwidth in the memory subsystem. In this regard, zero-copy operation may be supported.
When the TCP connection is offloaded to the TEEC, it may comprise, for example, an anchor such as a mapping of RCV_NXT, the TCP sequence number of the next expected byte, to a specific host address expressed as a base and offset within a buffer. The variable RCV_NXT is adjusted each time more bytes are accepted by TCP for reception. The buffer address corresponding to RCV_NXT is Buffer[I].NXT_addr and it is adjusted to point to the first byte available in the first buffer. When a buffer is added to the tail of an existing list, the maximum size of the available buffer is adjusted. When a buffer is completely consumed, the buffer is returned to the host for consumption by the buffer owner. When a buffer is returned to the host because a PUSH bit has been set in an incoming TCP segment, the mapping of RCV_NXT is adjusted to point to the first byte of the next buffer. This activity may be repeated each time the list is exhausted and a new buffer is allocated to the offloaded TCP connection.
A connection may be first offloaded and a buffer may be allocated later. The process of mapping any TCP segment into the host buffer may begin with computing a delta (e.g., a difference) between its TCP sequence number and RCV_NXT number. The delta may then be added to the base and offset into the first buffer (i.e., Buffer[I].NXT_addr). If the delta extends beyond the length of the first buffer, then the length of the second buffer is added. This may continue until the buffer into which the TCP Sequence number maps are found. The computation may take into account, for example, variable sizes of the pre-posted buffers. The TEEC may then determine whether the identified buffer has enough memory for the whole TCP segment or whether the TCP segment may spill over into the next buffer. In light of the determinations and computations, a series of DMA commands are generated with offset into the TCP segment received, host address and length. When the data in the frame should be stored inside a buffer that may be beyond the end of the current list owned by the TEEC, the TEEC may either drop the frame and not acknowledge it to the peer TCP or store it temporarily until it can get another buffer from the host.
For TCP segment received, one or more of the process steps may be executed as set forth below. In one embodiment, the operations on the TCP sequence space may be mod 32 as the TCP Sequence space wraps around every 232-1 bytes. However, other moduli arithmetic may be implemented.
The below-listed pseudo code describes an embodiment of a process that moves data from the TCP segment to the buffer list according to the present invention. For simplicity, the code handling the PUSH bit or the no room in current buffer list has been omitted.
The base sequence number and the host buffer information list may be updated as buffers are consumed along with the movement of the TCP Window to the right.
On the transmission path, the support for L4 and higher levels may comprise additional complexity and functionality. Transmission may comprise performing, for example, one or more of the following: scheduling transmission flow; transferring data via DMA; fetching context; transmit processing; adding L5 or higher and TCP/IP headers, and properly filling in all of the fields of those headers; arming the timers; and L2 transmitting.
The scheduler 260 may decide which flow to serve next. The scheduler 260 may also handle multiplexing L2 and L4 and higher levels of traffic. With respect to L4 and higher levels of traffic, the decision to schedule a particular TCP/IP flow for transmission may depend upon, for example, one or more of the following factors; data availability for transmission on the host side; remote end buffering state such as when a remote TCP connection has not closed the TCP window; preventing starvation among the potentially large number of TCP connections competing for time on the Ethernet media; availability of TCP acknowledges from the receive side; a need to retransmit information on behalf of a TCP connection; and flow priority or quality of server (QoS) information passed to the TEEC from the host.
Utilizing some or all of the above-identified information or other information, the scheduler 260 may pick the next flow to be transmitted. The scheduler 260 may fetch the pointer to the next host resident buffer from the context information. The scheduler 260 may also program the DMA engine 270 to get the data and store the data, for example, in an elastic buffer 281. Although an elastic buffer 281 is shown, the invention is not so limited and an on-chip FIFO buffer or other suitable memory or buffering device may be utilized for storing the data in accordance with various embodiments of the invention.
The DMA engine 270 may transfer the data from the host buffer or buffers into, for example, an on-chip, transmit-side FIFO buffer. IP Checksum (IPv4) and TCP Checksum may be computed on the data being transferred. The computations may be performed concurrently with data movement. Higher levels of data processing may be done at this stage.
Flow context may be fetched, for example, by the context prefetch 210 from a central context resource. Accessing the central context resource may increase the usefulness of a locking mechanism among all of its consumers to ensure data integrity and coherency. The locking mechanism may be very efficient in minimizing undesired performance impact. The context for the selected flow may be provided to the transmit processor 230 such as a CPU and/or finite state machine (FSM).
The transmit processor 230 may be adapted, for example, to execute TCP/IP and higher levels of code, to update the context and to generate the TCP/IP and higher level header variables to be placed in the headers. The updated context may be stored. The processing for this stage may be performed by one or more stages including one or more processors, state machines or hybrid processors.
The header builder 200 may use the header variables generated by transmit processor 230 and may generate the TCP/IP and higher level headers and may attach the TCP/IP and higher level headers in front of the data to be transmitted. Using the partial checksum results obtained from the DMA engine 270, the header builder 200 may finalize the checksum fields and may place them in the respective headers. Transmit processing is not limited to a specific number of stages and processing and may be executed at different stages of processing as may be optimal.
The timer 220 may be armed by the transmit processor 230 and may update its future timer event, list. When the L4 and higher levels of processing are complete, the L2 processing and transmission may follow the conventional steps performed by a conventional Ethernet controller.
A retransmission event is similar to a normal transmission except, for example, the data to be retransmitted may be fetched from the host buffers as before or from any other temporary holding buffers. The address for this data may be computed. The computation of the host buffer address may be more complex. The same mapping function described in the receive path section may be used for the retransmission TCP sequence number range. Once the buffer address is determined, the rest of the transmit process may occur as described above.
One or more of the embodiments of the present invention may have one or more of the advantages as set forth below.
The reduction in foot print may enable a single-chip implementation that may not require external memory. Foot print reduction may provide a size that is similar to that of a conventional non-offload Ethernet controller and therefore may allow its integration on the motherboards of servers and clients that are restricted in the real estate allocated for the LAN component. In other words, the solution may be utilized for LAN-On-Motherboard (LOM) applications. This is an advantage in the ever-shrinking form factors of clients and servers.
Since there may be no need to interface with the external memory, the cost of the solution may decrease. Not only may the cost of external memory be saved, but also the TEEC may become cheaper. There may be no need or the need may be reduced for machines that interface the memory and for I/O buffers to drive the machines. In turn, this may allow for a smaller package with fewer pins and higher performance
Power and thermal concerns may be substantial growth inhibitors for the Data Center. By eliminating or reducing the external memory, the TEEC may reduce its power consumption. Thus, more condensed servers may be provided as there may be less heat to dissipate.
Latencies associated with the temporary buffering of the data may be saved. Some applications such as, for example, distributed database, clustering, high-performance-computing (HPC), Quality-of-Service (QoS) applications and other may appreciate the substantial savings in latencies.
There may be no speed coupling of the memory and the TEEC. As an architectural aspect of having an external memory attached to the TEEC, the speed and width of that memory may impact the internal architecture. The impact is even greater for the higher wire speeds. With the possibility of no external connection, the internal architecture is substantially simplified.
This may reduce the memory used by a TEEC on a NIC to merely the traditional FIFO buffer used for matching wire, internal processing latencies and host bus speeds. The memory requirements of this architecture may not scale with the number of connections and may be less sensitive to LAN or WAN configurations. Cost and size may be less affected by the bandwidth-distance product that is aggravated by large (world-wide) fast networks.
Accordingly, the present invention may be realized in hardware, software, or a combination of hardware and software. The present invention may be realized in a centralized fashion in one computer system or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general-purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.
Portions of the present invention also may be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following; a) conversion to another language, code or notation; b) reproduction in a different material form.
While the present invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the present invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present invention without departing from its scope. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed, but that the present invention will comprise all embodiments falling within the scope of the appended claims
This application is a continuation of Ser. No. 12/914,633 filed Oct. 28, 2010, which is a continuation of application Ser. No. 12/032,953 filed Feb. 18, 2008, now U.S. Pat. No. 7,849,208, which is a continuation of application Ser. No. 10/652,267 filed Aug. 29, 2003, now U.S. Pat. No. 7,346,701 which in turn makes reference to, and/or claims priority to and/or claims the benefit of: U.S. Provisional Patent Application Ser. No. 60/408,617, filed on Sep. 6, 2002; U.S. Provisional Patent Application Ser. No. 60/407,165, filed on Aug. 30, 2002; U.S. Provisional Patent Application Ser. No. 60/456,260, filed on Mar. 20, 2003; and U.S. Provisional Patent Application Ser. No. 60/456,265, filed on Mar. 20, 2003. This application also makes reference to U.S. Provisional Application Ser. No. 60/551,361, filed on Mar. 10, 2004, which is hereby incorporated by herein by reference in its entirety. The above-referenced patent applications are all hereby incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
4333020 | Maeder | Jun 1982 | A |
4395774 | Rapp | Jul 1983 | A |
4433378 | Leger | Feb 1984 | A |
4445051 | Elmasry | Apr 1984 | A |
4449248 | Leslie | May 1984 | A |
4453247 | Suzuki et al. | Jun 1984 | A |
4463424 | Mattson | Jul 1984 | A |
4519068 | Krebs | May 1985 | A |
4545023 | Mizzi | Oct 1985 | A |
4590550 | Eilert | May 1986 | A |
4599526 | Paski | Jul 1986 | A |
4649293 | Ducourant | Mar 1987 | A |
4680787 | Marry | Jul 1987 | A |
4717838 | Brehmer | Jan 1988 | A |
4721866 | Chi | Jan 1988 | A |
4727309 | Vajdic | Feb 1988 | A |
4737975 | Shafer | Apr 1988 | A |
4760571 | Schwarz | Jul 1988 | A |
4761822 | Maile | Aug 1988 | A |
4777657 | Gillaspie | Oct 1988 | A |
4791324 | Hodapp | Dec 1988 | A |
4794649 | Fujiwara | Dec 1988 | A |
4804954 | Macnak | Feb 1989 | A |
4806796 | Bushey | Feb 1989 | A |
4807282 | Kazan | Feb 1989 | A |
4817054 | Banerjee | Mar 1989 | A |
4817115 | Campo | Mar 1989 | A |
4821034 | Anderson | Apr 1989 | A |
4850009 | Zook | Jul 1989 | A |
4890832 | Komaki | Jan 1990 | A |
4894792 | Mitchell | Jan 1990 | A |
4916441 | Gombrich | Apr 1990 | A |
4964121 | Moore | Oct 1990 | A |
4969206 | Desrochers | Nov 1990 | A |
4970406 | Fitzpatrick | Nov 1990 | A |
4977611 | Maru | Dec 1990 | A |
4995099 | Davis | Feb 1991 | A |
5008879 | Fischer | Apr 1991 | A |
5025486 | Klughart | Jun 1991 | A |
5029183 | Tymes | Jul 1991 | A |
5031231 | Miyazaki | Jul 1991 | A |
5033109 | Kawano | Jul 1991 | A |
5041740 | Smith | Aug 1991 | A |
5055659 | Hendrick | Oct 1991 | A |
5055660 | Bertagna | Oct 1991 | A |
5079452 | Lain | Jan 1992 | A |
5081402 | Koleda | Jan 1992 | A |
5087099 | Stolarczyk | Feb 1992 | A |
5115151 | Hull | May 1992 | A |
5117501 | Childress | May 1992 | A |
5119502 | Kallin | Jun 1992 | A |
5121408 | Cai | Jun 1992 | A |
5122689 | Barre | Jun 1992 | A |
5123029 | Bantz | Jun 1992 | A |
5128938 | Borras | Jul 1992 | A |
5134347 | Koleda | Jul 1992 | A |
5142573 | Umezawa | Aug 1992 | A |
5149992 | Allstot | Sep 1992 | A |
5150361 | Wieczorek | Sep 1992 | A |
5152006 | Klaus | Sep 1992 | A |
5153878 | Krebs | Oct 1992 | A |
5162674 | Allstot | Nov 1992 | A |
5175870 | Mabey | Dec 1992 | A |
5177378 | Nagasawa | Jan 1993 | A |
5179721 | Comroe | Jan 1993 | A |
5181200 | Harrison | Jan 1993 | A |
5196805 | Beckwith | Mar 1993 | A |
5216295 | Hoang | Jun 1993 | A |
5230084 | Nguyen | Jul 1993 | A |
5239662 | Danielson | Aug 1993 | A |
5241542 | Natarajan | Aug 1993 | A |
5241691 | Owen | Aug 1993 | A |
5247656 | Kabuo | Sep 1993 | A |
5249220 | Moakowitz | Sep 1993 | A |
5249302 | Metroka | Sep 1993 | A |
5265238 | Canova | Nov 1993 | A |
5265270 | Stengel | Nov 1993 | A |
5274666 | Dowdell | Dec 1993 | A |
5276680 | Messenger | Jan 1994 | A |
5278831 | Mabey | Jan 1994 | A |
5289055 | Razavi | Feb 1994 | A |
5289469 | Tanaka | Feb 1994 | A |
5291516 | Dixon | Mar 1994 | A |
5293639 | Wilson | Mar 1994 | A |
5296849 | Ide | Mar 1994 | A |
5297144 | Gilbert | Mar 1994 | A |
5301196 | Ewen | Apr 1994 | A |
5304869 | Greason | Apr 1994 | A |
5315591 | Brent | May 1994 | A |
5323392 | Ishii | Jun 1994 | A |
5329192 | Wu | Jul 1994 | A |
5331509 | Kikinis | Jul 1994 | A |
5345449 | Buckingham | Sep 1994 | A |
5349649 | Iijima | Sep 1994 | A |
5355453 | Row | Oct 1994 | A |
5361397 | Wright | Nov 1994 | A |
5363121 | Freund | Nov 1994 | A |
5373149 | Rasmussen | Dec 1994 | A |
5373506 | Tayloe | Dec 1994 | A |
5390206 | Rein | Feb 1995 | A |
5392023 | D'Avello | Feb 1995 | A |
5406615 | Miller | Apr 1995 | A |
5406643 | Burke | Apr 1995 | A |
5418837 | Johansson | May 1995 | A |
5420529 | Guay | May 1995 | A |
5423002 | Hart | Jun 1995 | A |
5426637 | Derby | Jun 1995 | A |
5428636 | Meier | Jun 1995 | A |
5430845 | Rimmer | Jul 1995 | A |
5432932 | Chen | Jul 1995 | A |
5434518 | Sinh | Jul 1995 | A |
5437329 | Brooks | Aug 1995 | A |
5440560 | Rypinski | Aug 1995 | A |
5455527 | Murphy | Oct 1995 | A |
5457412 | Tamba | Oct 1995 | A |
5459412 | Mentzer | Oct 1995 | A |
5465081 | Todd | Nov 1995 | A |
5473607 | Hausman | Dec 1995 | A |
5481265 | Russell | Jan 1996 | A |
5481562 | Pearson | Jan 1996 | A |
5488319 | Lo | Jan 1996 | A |
5502719 | Grant | Mar 1996 | A |
5510734 | Sone | Apr 1996 | A |
5510748 | Erhart | Apr 1996 | A |
5519695 | Purohit | May 1996 | A |
5521530 | Yao | May 1996 | A |
5533029 | Gardner | Jul 1996 | A |
5535373 | Olnowich | Jul 1996 | A |
5541994 | Tomko et al. | Jul 1996 | A |
5544222 | Robinson | Aug 1996 | A |
5548230 | Gerson | Aug 1996 | A |
5548238 | Zhang | Aug 1996 | A |
5550491 | Furuta | Aug 1996 | A |
5576644 | Pelella | Nov 1996 | A |
5579487 | Meyerson | Nov 1996 | A |
5583456 | Kimura | Dec 1996 | A |
5584048 | Wieczorek | Dec 1996 | A |
5588000 | Rickard | Dec 1996 | A |
5600267 | Wong | Feb 1997 | A |
5603051 | Ezzet | Feb 1997 | A |
5606268 | Van Brunt | Feb 1997 | A |
5619497 | Gallagher | Apr 1997 | A |
5619650 | Bach | Apr 1997 | A |
5625308 | Matsumoto | Apr 1997 | A |
5628055 | Stein | May 1997 | A |
5630061 | Richter | May 1997 | A |
5640356 | Gibbs | Jun 1997 | A |
5640399 | Rostoker | Jun 1997 | A |
5668809 | Rostoker | Sep 1997 | A |
5675584 | Jeong | Oct 1997 | A |
5675585 | Bonnot | Oct 1997 | A |
5680038 | Fielder | Oct 1997 | A |
5680633 | Koenck | Oct 1997 | A |
5689644 | Chou | Nov 1997 | A |
5724361 | Fielder | Mar 1998 | A |
5726588 | Fielder | Mar 1998 | A |
5732346 | Lazaridia | Mar 1998 | A |
5740366 | Mahany | Apr 1998 | A |
5742604 | Edsall | Apr 1998 | A |
5744366 | Kricka | Apr 1998 | A |
5744999 | Kim | Apr 1998 | A |
5748631 | Bergantino | May 1998 | A |
5754549 | DeFoster | May 1998 | A |
5767699 | Bosnyak | Jun 1998 | A |
5778414 | Winter | Jul 1998 | A |
5790804 | Osborne | Aug 1998 | A |
5796727 | Harrison | Aug 1998 | A |
5798658 | Werking | Aug 1998 | A |
5802258 | Chen | Sep 1998 | A |
5802287 | Rostoker | Sep 1998 | A |
5802465 | Hamalainen | Sep 1998 | A |
5802576 | Tzeng | Sep 1998 | A |
5805927 | Bowes | Sep 1998 | A |
5821809 | Boerstler | Oct 1998 | A |
5826027 | Pedersen | Oct 1998 | A |
5828653 | Goss | Oct 1998 | A |
5829025 | Mittal | Oct 1998 | A |
5831662 | Payton | Nov 1998 | A |
5831985 | Sandorfi | Nov 1998 | A |
5839051 | Grimmett | Nov 1998 | A |
5844437 | Asazawa | Dec 1998 | A |
5848251 | Lomelino | Dec 1998 | A |
5859669 | Prentice | Jan 1999 | A |
5861881 | Freeman | Jan 1999 | A |
5875465 | Kilpatrick | Feb 1999 | A |
5877642 | Takahashi | Mar 1999 | A |
5887146 | Baxer | Mar 1999 | A |
5887167 | Sutton | Mar 1999 | A |
5887187 | Rostoker | Mar 1999 | A |
5892382 | Ueda | Apr 1999 | A |
5892922 | Lorenz | Apr 1999 | A |
5893150 | Hagersten | Apr 1999 | A |
5893153 | Tzeng | Apr 1999 | A |
5903176 | Westgate | May 1999 | A |
5905386 | Gerson | May 1999 | A |
5908468 | Hartmann | Jun 1999 | A |
5909127 | Pearson | Jun 1999 | A |
5909686 | Muller | Jun 1999 | A |
5914955 | Rostoker | Jun 1999 | A |
5937169 | Connery | Aug 1999 | A |
5940771 | Gollnick | Aug 1999 | A |
5945847 | Ransijn | Aug 1999 | A |
5945858 | Sato | Aug 1999 | A |
5945863 | Coy | Aug 1999 | A |
5961631 | Devereux | Oct 1999 | A |
5969556 | Hayakawa | Oct 1999 | A |
5974049 | Ratcliff et al. | Oct 1999 | A |
5974508 | Maheshwari | Oct 1999 | A |
5974518 | Nogradi | Oct 1999 | A |
5977800 | Iravani | Nov 1999 | A |
5978379 | Chan | Nov 1999 | A |
5978849 | Khanna | Nov 1999 | A |
5987507 | Creedon | Nov 1999 | A |
6002279 | Evans | Dec 1999 | A |
6008670 | Pace | Dec 1999 | A |
6014041 | Somasekhar | Jan 2000 | A |
6014705 | Koenck | Jan 2000 | A |
6025746 | So | Feb 2000 | A |
6026075 | Linville | Feb 2000 | A |
6028454 | Elmasry | Feb 2000 | A |
6037841 | Tanji | Mar 2000 | A |
6037842 | Bryan | Mar 2000 | A |
6038254 | Ferraiolo | Mar 2000 | A |
6061351 | Erimli | May 2000 | A |
6061747 | Ducaroir | May 2000 | A |
6064626 | Stevens | May 2000 | A |
6067408 | Runaldue et al. | May 2000 | A |
6081162 | Johnson | Jun 2000 | A |
6094074 | Chi | Jul 2000 | A |
6098064 | Piroll | Aug 2000 | A |
6104214 | Ueda | Aug 2000 | A |
6111425 | Bertin | Aug 2000 | A |
6111859 | Godfrey | Aug 2000 | A |
6114843 | Olah | Sep 2000 | A |
6118776 | Berman | Sep 2000 | A |
6122667 | Chung | Sep 2000 | A |
6141705 | Anand | Oct 2000 | A |
6151662 | Christie | Nov 2000 | A |
6157623 | Kerstein | Dec 2000 | A |
6157955 | Narad et al. | Dec 2000 | A |
6178159 | He | Jan 2001 | B1 |
6185185 | Bass | Feb 2001 | B1 |
6188339 | Hasegawa | Feb 2001 | B1 |
6194950 | Kibar | Feb 2001 | B1 |
6202125 | Patterson | Mar 2001 | B1 |
6202129 | Palanca | Mar 2001 | B1 |
6209020 | Angie | Mar 2001 | B1 |
6215497 | Leung | Apr 2001 | B1 |
6218878 | Ueno | Apr 2001 | B1 |
6222380 | Gerowitz | Apr 2001 | B1 |
6223239 | Olarig | Apr 2001 | B1 |
6226680 | Boucher | May 2001 | B1 |
6232844 | Talaga | May 2001 | B1 |
6243386 | Chan | Jun 2001 | B1 |
6247060 | Boucher | Jun 2001 | B1 |
6259312 | Murtojarvi | Jul 2001 | B1 |
6265898 | Bellaouar | Jul 2001 | B1 |
6266797 | Godfrey | Jul 2001 | B1 |
6269427 | Kuttanna | Jul 2001 | B1 |
6279035 | Brown | Aug 2001 | B1 |
6301668 | Gleichauf et al. | Oct 2001 | B1 |
6310501 | Yamashita | Oct 2001 | B1 |
6324181 | Wung | Nov 2001 | B1 |
6332179 | Okpisz | Dec 2001 | B1 |
6334153 | Boucher | Dec 2001 | B2 |
6345301 | Burns et al. | Feb 2002 | B1 |
6347337 | Shah et al. | Feb 2002 | B1 |
6349098 | Purruck | Feb 2002 | B1 |
6349365 | McBride | Feb 2002 | B1 |
6356944 | McCarty | Mar 2002 | B1 |
6363011 | Hirose | Mar 2002 | B1 |
6366583 | Rowett | Apr 2002 | B2 |
6373846 | Daniel | Apr 2002 | B1 |
6374311 | Mahany | Apr 2002 | B1 |
6385201 | Iwata | May 2002 | B1 |
6389479 | Boucher | May 2002 | B1 |
6396832 | Kranzler | May 2002 | B1 |
6396840 | Rose | May 2002 | B1 |
6411621 | Norton et al. | Jun 2002 | B1 |
6424194 | Hairapetian | Jul 2002 | B1 |
6424624 | Galand | Jul 2002 | B1 |
6427169 | Elzur | Jul 2002 | B1 |
6427171 | Craft | Jul 2002 | B1 |
6427173 | Boucher | Jul 2002 | B1 |
6434620 | Boucher | Aug 2002 | B1 |
6438651 | Slane | Aug 2002 | B1 |
6449656 | Elzur | Sep 2002 | B1 |
6459681 | Oliva | Oct 2002 | B1 |
6463092 | Kim | Oct 2002 | B1 |
6470029 | Shimizu | Oct 2002 | B1 |
6484224 | Robins | Nov 2002 | B1 |
6490248 | Shimojo | Dec 2002 | B1 |
6496479 | Shionazaki | Dec 2002 | B1 |
6496481 | Wu et al. | Dec 2002 | B1 |
6535518 | Hu et al. | Mar 2003 | B1 |
6538486 | Chen | Mar 2003 | B1 |
6564267 | Lindsay | May 2003 | B1 |
6597689 | Chiu | Jul 2003 | B1 |
6606321 | Natanson | Aug 2003 | B1 |
6614791 | Luciani | Sep 2003 | B1 |
6614796 | Black | Sep 2003 | B1 |
6631351 | Ramachandran | Oct 2003 | B1 |
6633936 | Keller | Oct 2003 | B1 |
6636859 | Banerjee | Oct 2003 | B2 |
6636947 | Neal | Oct 2003 | B1 |
6650636 | Bradshaw et al. | Nov 2003 | B1 |
6658599 | Linam | Dec 2003 | B1 |
6665759 | Dawkins | Dec 2003 | B2 |
6681283 | Thekkath et al. | Jan 2004 | B1 |
6687758 | Craft et al. | Feb 2004 | B2 |
6697868 | Craft | Feb 2004 | B2 |
6714985 | Malagrino et al. | Mar 2004 | B1 |
6721280 | Mauro et al. | Apr 2004 | B1 |
6757291 | Hu | Jun 2004 | B1 |
6757746 | Boucher | Jun 2004 | B2 |
6765901 | Johnson | Jul 2004 | B1 |
6766389 | Hayter | Jul 2004 | B2 |
6775693 | Adams | Aug 2004 | B1 |
6785239 | Tasker | Aug 2004 | B1 |
6785262 | Yao et al. | Aug 2004 | B1 |
6788686 | Khotimsky | Sep 2004 | B1 |
6788704 | Lindsay | Sep 2004 | B1 |
6816932 | Cho | Nov 2004 | B2 |
6826615 | Barrall et al. | Nov 2004 | B2 |
6845403 | Chadalapaka | Jan 2005 | B2 |
6850521 | Kadambi | Feb 2005 | B1 |
6859435 | Lee | Feb 2005 | B1 |
6862296 | Desai | Mar 2005 | B1 |
6865158 | Iwamoto | Mar 2005 | B2 |
6874054 | Clayton | Mar 2005 | B2 |
6897697 | Yin | May 2005 | B2 |
6904519 | Anand | Jun 2005 | B2 |
6911855 | Yin | Jun 2005 | B2 |
6912603 | Kanazashi | Jun 2005 | B2 |
6927606 | Kocaman | Aug 2005 | B2 |
6937080 | Hairapetian | Aug 2005 | B2 |
6938092 | Burns | Aug 2005 | B2 |
6971006 | Krishna | Nov 2005 | B2 |
6976205 | Ziai | Dec 2005 | B1 |
6982583 | Yin | Jan 2006 | B2 |
7007103 | Pinkerton | Feb 2006 | B2 |
7009985 | Black | Mar 2006 | B2 |
7149819 | Petty | Dec 2006 | B2 |
7159030 | Elzur | Jan 2007 | B1 |
7181531 | Pinkerton | Feb 2007 | B2 |
7185266 | Blightman | Feb 2007 | B2 |
7212534 | Kadambi | May 2007 | B2 |
7346701 | Elzur | Mar 2008 | B2 |
7362769 | Black | Apr 2008 | B2 |
7366190 | Black | Apr 2008 | B2 |
7376755 | Pandya | May 2008 | B2 |
7382790 | Warren | Jun 2008 | B2 |
7385972 | Black | Jun 2008 | B2 |
7397788 | Miles | Jul 2008 | B2 |
7397800 | Elzur | Jul 2008 | B2 |
7400639 | Madukkarumukumana | Jul 2008 | B2 |
7403542 | Thompson | Jul 2008 | B1 |
7411959 | Elzur | Aug 2008 | B2 |
7430171 | Black | Sep 2008 | B2 |
7472156 | Philbrick | Dec 2008 | B2 |
7515612 | Thompson | Apr 2009 | B1 |
7586850 | Warren | Sep 2009 | B2 |
7644188 | Vlodavsky | Jan 2010 | B2 |
20010026553 | Gallant | Oct 2001 | A1 |
20010037397 | Boucher | Nov 2001 | A1 |
20010037406 | Philbrick et al. | Nov 2001 | A1 |
20020034182 | Mallory | Mar 2002 | A1 |
20020062333 | Anand | May 2002 | A1 |
20020078265 | Frazier | Jun 2002 | A1 |
20020085562 | Hufferd | Jul 2002 | A1 |
20020089927 | Fischer | Jul 2002 | A1 |
20020095519 | Philbrick | Jul 2002 | A1 |
20020103988 | Domier | Aug 2002 | A1 |
20020118692 | Oberman et al. | Aug 2002 | A1 |
20020130692 | Hairapetian | Sep 2002 | A1 |
20020174253 | Hayter | Nov 2002 | A1 |
20020190770 | Yin | Dec 2002 | A1 |
20020191604 | Mitchell et al. | Dec 2002 | A1 |
20020194400 | Porterfield | Dec 2002 | A1 |
20020194445 | Zsohar | Dec 2002 | A1 |
20030001646 | Hairapatian | Jan 2003 | A1 |
20030016628 | Kadambi | Jan 2003 | A1 |
20030021229 | Kadambi | Jan 2003 | A1 |
20030026277 | Pate et al. | Feb 2003 | A1 |
20030038809 | Peng | Feb 2003 | A1 |
20030046330 | Hayes | Mar 2003 | A1 |
20030046418 | Raval | Mar 2003 | A1 |
20030051128 | Rodriguez | Mar 2003 | A1 |
20030061505 | Sperry et al. | Mar 2003 | A1 |
20030067337 | Yin | Apr 2003 | A1 |
20030079033 | Craft | Apr 2003 | A1 |
20030084185 | Pinkerton | May 2003 | A1 |
20030105977 | Brabson | Jun 2003 | A1 |
20030107996 | Black | Jun 2003 | A1 |
20030108045 | Jayam et al. | Jun 2003 | A1 |
20030108050 | Black | Jun 2003 | A1 |
20030108058 | Black | Jun 2003 | A1 |
20030108060 | Black | Jun 2003 | A1 |
20030108061 | Black | Jun 2003 | A1 |
20030118040 | Black | Jun 2003 | A1 |
20030123447 | Smith | Jul 2003 | A1 |
20030128704 | Mizrachi et al. | Jul 2003 | A1 |
20030140124 | Burns | Jul 2003 | A1 |
20030169753 | Black | Sep 2003 | A1 |
20030172342 | Elzur | Sep 2003 | A1 |
20030174720 | Black | Sep 2003 | A1 |
20030174721 | Black | Sep 2003 | A1 |
20030174722 | Black | Sep 2003 | A1 |
20030198251 | Black | Oct 2003 | A1 |
20030204631 | Pinkerton | Oct 2003 | A1 |
20030204634 | Pinkerton | Oct 2003 | A1 |
20040019652 | Freimuth | Jan 2004 | A1 |
20040042458 | Elzur | Mar 2004 | A1 |
20040042464 | Elzur | Mar 2004 | A1 |
20040042483 | Elzur | Mar 2004 | A1 |
20040042487 | Ossman | Mar 2004 | A1 |
20040044798 | Elzur | Mar 2004 | A1 |
20040062245 | Sharp | Apr 2004 | A1 |
20040062275 | Siddabathuni | Apr 2004 | A1 |
20040081186 | Warren | Apr 2004 | A1 |
20040085972 | Warren | May 2004 | A1 |
20040085994 | Warren | May 2004 | A1 |
20040093411 | Elzur | May 2004 | A1 |
20040133713 | Elzur | Jul 2004 | A1 |
20040227544 | Yin | Nov 2004 | A1 |
20050027911 | Hayter | Feb 2005 | A1 |
20050160139 | Boucher | Jul 2005 | A1 |
20050165980 | Clayton | Jul 2005 | A1 |
20050184765 | Hairapetian | Aug 2005 | A1 |
20050185654 | Zadikian | Aug 2005 | A1 |
20050216597 | Shah | Sep 2005 | A1 |
20050278459 | Boucher | Dec 2005 | A1 |
20060165115 | Warren | Jul 2006 | A1 |
20060176094 | Hairapetian | Aug 2006 | A1 |
20070170966 | Hairapetian | Jul 2007 | A1 |
20070171914 | Kadambi | Jul 2007 | A1 |
20070237163 | Kadambi | Oct 2007 | A1 |
20080025315 | Elzur | Jan 2008 | A1 |
20080095182 | Elzur | Apr 2008 | A1 |
20080151922 | Elzur | Jun 2008 | A1 |
20080205421 | Black | Aug 2008 | A1 |
20080276018 | Hayter | Nov 2008 | A1 |
20080298369 | Elzur | Dec 2008 | A1 |
20090074408 | Black | Mar 2009 | A1 |
20090128380 | Hairapetian | May 2009 | A1 |
Number | Date | Country |
---|---|---|
0465090 | Apr 1996 | EP |
1180869 | Feb 2002 | EP |
0692892 | Apr 2003 | EP |
134538 | Sep 2003 | EP |
1357721 | Oct 2003 | EP |
146080 | Sep 2004 | EP |
1460805 | Sep 2004 | EP |
1460806 | Sep 2004 | EP |
120675 | Nov 2007 | EP |
153769 | Feb 2009 | EP |
2 598 531 | Nov 1987 | FR |
2725573 | Nov 1994 | FR |
19940012105 | Apr 1996 | FR |
2 320 592 | Jun 1998 | GB |
1188301 | Jul 1989 | JP |
6232872 | Aug 1994 | JP |
906691 | Jan 1997 | JP |
WO 9900948 | Jan 1999 | WO |
WO 0056013 | Sep 2000 | WO |
WO 0192997 | Dec 2001 | WO |
WO 0219604 | Mar 2002 | WO |
WO 0235784 | May 2002 | WO |
WO 03079612 | Sep 2003 | WO |
Entry |
---|
Dunkels, Adam, Minimal TCP/IP Implementation with Proxy Support, SICS Technical Report, ISSN 1100-3154, ISRN: SICS-T-2001/20-SE, Feb. 2001. |
Sakar, Prasenjit and Voruganti, Kaladhar, IP Storage: The Challenge Ahead, IBM Almaden Research Center, San Jose, CA, undated. |
Chase, Jeffrey S., Gallatin, Andrew J., and Yocum, Kenneth G., End-System Optimizations for High-Speed TCP, Duke University, Durham, NC, undated. |
Wright & Stevens, TCP/IP Illustrated, vol. 2: The Implementation, Corporate Professional Publishing Group, reading MA 01867, ISBN 0-201-63354-X, 1995, pp. 803-805. |
Wright & Stevens, TCP/IP Illustrated, vol. 2: The Implementation, Corporate Professional Publishing Group, reading MA 01867, ISBN 0-201-63354-X, 1995, pp. 790-840. |
Wright & Stevens, TCP/IP Illustrated, vol. 2: The Implementation, Corporate Professional Publishing Group, reading MA 01867, ISBN 0-201-63354-X, 1995, pp. 817-818. |
ANG, An Evaluation of an Attempt at Offloading TCP/IP Protocol Processing Onto an i960RN-based iNIC, Hewlett Packard, Jan. 9, 2001. |
Defendant Emulex Corporation's Disclosure of Preliminary Invalidity Contentions, with Exhibit F, Broadcom Corporation v. Emulex Corporation, Case No. SACV 09-1058-JVS (ANx), Jun. 28, 2010. |
Defendant Emulex Corporation's First Amended Disclosure of Preliminary Invalidity Contentions, with Exhibit E, Corporation v. Emulex Corporation, Case No. SACV 09-1058-JVS (ANx), Aug. 30, 2010. |
User's Guide Alacritech 100x4 Quad-Port Server Adapter and Alacritech 100x2 Dual-Port Server Adapter, (Bates Nos. ELX-PAT-00045223-ELX-PAT-00045268). |
Plaintiff Broadcom Corporation's Opening Markman Brief, United States Districk Court, Central District of California, Southern Division, Broadcom Corporation v. Elulex Corporation, Case No. SACV09-01058 JVS (ANx), SACV10-03963-JVS (ANx), dated Oct. 18, 2010. |
Defendant and Counterclaim Plaintiff Emulex Corporation's Opening Claim Construction Brief, United States District Court, Central District of California, Broadcom Corporation v. Emulex Corporation, Case No. SACV09-1058-JVS (ANx) consilidated with CV 10-3963 JVS (ANx), dated Oct. 18, 2010. |
Plaintiff Broadcom Corporation's Reply Markman Brief, United States District Court, Central District of California, Southern Division, Broadcom Corporation v. Emulex Corporation, Case No. SACV09-01058 JVS (ANx), SACV 1003963-JVS (ANx), dated Nov. 8, 2010. |
Defendant and Counterclaim Plaintiff Emulex Corporation's Reply Claim Construction Brief, United States District Court, Central District of California, Broadcom Corporation v. Emulex Corporation, Case No. SACV 09-1058-JVS (ANx) consolidated with CV 10-3963 JVS (ANx), dated Nov. 8, 2010. |
Order Regarding Markman/Claim Construction Hearing, United States District Court, Central District of California, Broadcom Corporation v. Emulex Corporation, Case No. SACV 09-01058-JVS (ANx) consolidated SACV 10-03963-JVS (Anx), dated Dec. 17, 2010. |
Deposition of Frankie Fan—vol. one, United States District Court, Central District of California, Southern Division, Broadcom Corporation v. Emulex Corporation, Case No. 09-1058 JVS (ANx), dated Sep. 22, 2010. |
Deposition of Frankie Fan—vol. two, United States District Court, Central District of California, Southern Division, Broadcom Corporation v. Emulex Corporation, Case No. 09-1058 JVS (ANx), dated Sep. 22, 2010. |
Joint Claim Construction and Prehearing Statement Pursuant to N.D. Cal. Patent L.R. 4-3, United States District Court, Central District, Southern Division, Broadcom Corporation v. Emulex Corporation, Case No. SACV09-1058 JVS (ANx), SACV 10-03963-JVS (ANx). |
Exhibit A: Disputed Terms, Proposed Constructions, and Intrinsic and Extrinsic Evidence, Broadcom Corporation v. Emulex Corporation, Case No. 8:09-cv-01058-JVS-AN. |
Ewen, “Single-Chip 1062 Mbaud CMOS Transceiver for Serial Data Communication”, 1995 IEEE International Solid-State Circuits Conference, Digest of Technical Papers, First Edition, Feb. 1995, pp. 1-2, 6-13, 32-33, 336, IEEE Catalog No. 95CH35753, Publisher: John H. Wuorinen, Castine, ME 04421. |
Fielder, “A 1.0625Gbps Transceiver with 2x Oversampling and Transmit Signal Pre-Emphasis”, 1997 IEEE International Solid-State Circuits Conference, Digest of Technical Papers, ISSC97, Session 15, Serial Data Communications, Paper FP 15.1, pp. 238-239, 464. |
Fujimori, “A 90-dB SNR 2.5-MHz Output-Rate ADC Using Cascaded Multibit Delta-Sigma Modulation at 8x Oversampling Ratio”, IEEE Journal of Solid-State Circuits, vol. 35, No. 12, Dec. 2000, pp. 1820-1828. |
Corner, “A CMOS Phase Detector for Mixed Signal ASIC Application”, IEEE, 1993, pp. 232-234. |
Fielder, “A CMOS Pulse Density Modulator for High-Resolution A/D Converters”, IEEE Journal of Solid-State Circuits, vol. sc-19, No. 6, Dec. 1984, pp. 995-996. |
Stevens, W., “TCP Slow Start, Congestion Avoidance, Fast Retransmit and Fast Recovery Algorithms”, RFC 2001 (RFC2001) www.faqs.org/rfcs/rfc/2001.html, Jan. 1997. |
Communication pursuant to Article 94(3) EPC for European Patent Application No. 08 002 749.3-1245, dated Feb. 22, 2010. |
Momtaz, “A Fully Integrated SONET OC-48 Transceiver in Standard CMOS”, IEEE Journal of Solid-State Circuits, vol. 36, No. 12, Dec. 2001, pp. 1964-1973. |
Schmitt, “A Low Voltage CMOS Current Source”, pp. 110-113. |
Hairapetian, “An 81-MHz IF Receiver in CMOS”, IEEE Journal of Solid-State Circuits, vol. 31. No. 12, Dec. 1996, pp. 1981-1986. |
Ang, “An Evaluation of an Attempt of an Attempt at Offloading TCP/IP Protocol Processing Onto an i960RN-Based iNIC”, Hewlett Packard, 2001, pp. 1-33. |
Fischer, “CiNIC—Calpoly Intelligent NIC”, A Thesis Presented to the Faculty of California Polytechnic State University, San Luis Obispo, Jun. 2001, pp. i-xi, 1-137. |
Tanenbaum, Excerpt from Computer Networks, Third Edition, 1996, Publisher: Prentice Hall PTF, Upper Saddle River, New Jersey 07458, pp. 556-558. |
Allstot, “Current-Mode Logic Technologies for CMOS Mixed-Mode ASIC's”, IEEE Custom Integrated Circuits Conference, 1991, pp. 25.2.1-25.2.4. |
Shivam, “EMP: Zero-copy OS-bypass NIC-Driven Gigabit Ethernet Message Passing”, SC1001 Nov. 2001, Dnver, CO. |
Nayfeh, “Exploring the Design Space for a Shared-Cache Mulitprocessor”, Computer Systems Laboratory, Stanford University, IEEE, 1994, pp. 166-175. |
Fibre Channel Arbitration Loop (FC-AL), X3.262-199x, X3T11/Project 960D/Rev 4.5, working draft proposal, American National Standard for Information Technology, Jun. 1, 1995, pp. i-x, 1-92. |
Fibre Channel Physical and Signaling Interface (FC-PH), X3.230-199x, X3T11 Project 755D/Rev. 4.3, working draft proposal, American National Standard for Information Systems, Jun. 1, 1994, pp. i-xxxiv, 1-338, Index. |
Yeh, “Intoduction to TCP/IP Offload Engine (TOA)”, 10 Gigabit Ethernet Alliance, Version 1.0, Apr. 2002. |
Sanchez, “Iterations in TCP/IP—Ethernet Network Optimization”, a Master's thesis presented to the Faculty of California, Polytechnic State University, San Luis Obispo, Jun. 1999, pp. i-xiii, 1-156. |
Allam, “Low Power CMOS Logic Families”, IEEE, 1999, pp. 419-422. |
Hairapetain, “Low-Temperature Mobility Measurements on CMOS Devices”, IEEE Transactions on Electron Devices, vol. 36, No. 8, Aug. 1989, pp. 1448-1455. |
Cao, “OC-192 Transmitter and Receiver in Standard 0.18-um CMOS”, IEEE Journal of Solid-State Circuits, vol. 37, No. 12, Dec. 2002, pp. 1768-1780. |
Series H: Audiovisual and Multimedia Systems, Infrastructure of Audiovisual Services—Systems and Terminal Equipment for Audiovisual Services; Visual Telephone Systems and Equipment for Local Area Networks Which Provide a Non-Guaranteed Quality of Services, ITU-T Recommendation H.323, Superseded by a more recent version, Nov. 1996, pp. i-v, 1-71,1. |
Pinkerton, “The Case for RDMA”, May 29, 2002, pp. 1-27. |
Pope, “Tip of the Week: Net-Interface Accelerations Can Help or Hinder”, Network Systems Design Line, Feb. 26, 2007, http://www.networksystemdesignline.com, pp. 1-2. |
Dally, “Virtual-Channel Flow Control”,, IEEE Transactions on Parallel and Distributed Systems, vol. 3, No. 2, Mar. 1992, pp. 194-205. |
Emulex Corporation's Answer, Affirmative Defenses and Counterclaims, Demand for a Jury Trial, Broadcom Corporation vs. Emulex Corporation, Case No. SACV09-1058-JVS (ANx), Nov. 4, 2009. |
RFC 793, Transmission Control Protocol, DRPA Internet Program, Protocol Specification, Sep. 1981. |
Koufopavou, Odysseas G., and Zitterbart, Martina, Parallel TCP for High Performance Communication System, Globecom '92, IEEE Global Telecommunications Conference, Orlando, FL, Dec. 6-9, 1992, pp. 1395-1399. |
MacLean, R. Andrew, and Barvick, Scott E., An Outboard Processor for High Performance Implementation of Transport Layer Protocolls, IEEE Global Telecommunications Conference, Phoenix, AZ, Dec. 2-5, 1991, pp. 1728-1732. |
User's Guide: Alacritech 1000×4 Quad-Port Server Adapter, Alacritech 100×2 Dual-Port Server Adapter, Alacritech 100×1 Single-Port Server Adapter (4th ed.) (900006r7f), Nov. 2000. |
Alacritech 100×4 Quad-Port Server Adapter (Model #2000-10000)[on sale and public use by 2000]. |
Hardware Installation Guide: Alacritech 100×4 Quad-Port Server Adapter. |
Alacritech: Company Milestones. |
Alacritech Press Release: Alacritech Ships Industry's First Gigabit Ethernet Accelerator, Oct. 22, 2001. |
Raut, Abhay, Verification of a Transport Offload Engine, Dec. 2002. |
Gallatin, Andrew, Chase, Jeff, and Yocum, Ken, Trapeze/IP: TCP/IP at Near-Gigabit Speeds, Proceedings of the FREENIX Track: 1999 USENIX Annuall Technical Conference, Monterey, C, Jun. 6-11, 1999. |
Buonadonna, Phil and Culler, David, Queue-Pair IP: A Hybrid Architecture for System Area Networks, Copyright 2002 Intel Corporation, IRB-TR-02-002, Mar. 2002. |
Kaiserswerth, Matthias, The Parallel Protocol Engine, IBM Research Division, Zurich Research Laboratory Switzerland, undated. |
Xiao, Xipeng and Lionel, M.Ni, Parallel Routing Table Computation for Scalable IP Routers, undated. |
Number | Date | Country | |
---|---|---|---|
20110246662 A1 | Oct 2011 | US |
Number | Date | Country | |
---|---|---|---|
60408617 | Sep 2002 | US | |
60407165 | Aug 2002 | US | |
60456260 | Mar 2003 | US | |
60456265 | Mar 2003 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12914633 | Oct 2010 | US |
Child | 13115274 | US | |
Parent | 12032953 | Feb 2008 | US |
Child | 12914633 | US | |
Parent | 10652267 | Aug 2003 | US |
Child | 12032953 | US |