The above-referenced United States patent applications are hereby incorporated herein by reference in their entirety.
The transmission control protocol/internet protocol (TCP/IP) is a protocol that has become widely used for communications. However, receiving, buffering, processing and storing the data communicated in TCP segments can consume a substantial amount of host processing power and memory bandwidth at the receiver. In a typical system, reception includes processing in multiple communications layers before the data is finally copied to its final destination an Application buffer. A typical network interface card (NIC) processes the Layer 2 headers (e.g., ethernet headers) and then copies the remaining headers (e.g., Layer 3 and higher headers) and/or the Upper Layer Protocol (ULP) payload to a transport buffer (e.g., a TCP buffer) for networking and transport layer processing. The transport and networking processing (e.g., TCP/IP where TCP is the transport layer protocol) removes the Layer 3 and Layer 4 headers and copies the remaining headers and ULP payload to another buffer. This process repeats in the next level until the last header is removed and the ULP payload is copied to the buffer assigned by the application. Most of the bytes in the frames are payload (e.g., data), but it is copied again and again as the control portion of the frames (e.g., the headers) is processed in a layered fashion. The host CPU, which incurs high overhead of processing and copying including, for example, handling many interrupts and context switching, does this. Thus, very few cycles are available for application processing, which is the desired use of a server machine. For high-speed networking (e.g., 10 Gigabits per second), the additional copying strains the memory sub-system of the computer. For an average of three data copies, the memory subsystem of most commercially available server computers becomes a bottleneck, thereby preventing the system from supporting 10 Gigabit network traffic. Since TCP/IP is the dominant transport protocol used 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.
What is needed to reduce the overhead is to ensure data is copied once from the wire to the application buffer. A problem is that the NIC has no idea what portion of a received frame is, for example, ULP data and what portion is ULP control. What is needed is to have the sender build the frames in a way that makes it easy for the receiver NIC to make this distinction. However, each ULP protocol may have its own way of mixing data and control, thereby making it very difficult to build a NIC that supports them all.
Another problem is that TCP offers a byte stream service to the ULP. It is not always possible to tell the beginning of a ULP message (e.g., the protocol data unit (PDU)) inside that endless stream of bytes (e.g., the TCP data). Assuming that the frames arrive without resegmentation at the receiver (e.g., a server), the receiver may unpack the frame using TCP and might be able to locate the ULP header. The ULP header may include, for example, control information that may identify a location in the application buffer where the ULPDU may be directly placed. However, even if a sender could somehow be adapted to employ, in every TCP segment, a TCP layer adapted to place ULP control information starting in the first payload byte of the TCP segment, it might not be enough. This is because resegmentation is not uncommon in TCP/IP communications. There is no guarantee the TCP segments will arrive on the other end of the wire, the way the sender has built them because, for example, there may be network architectural structures between the sender and the receiver. For example, an intermediate box or middle box (e.g., a firewall) may terminate the TCP connection with the sender and, without the sender or the receiver being aware, may initiate another TCP connection with the receiver. The intermediate box may resegment the incoming frames (e.g., use a smaller TCP payload). Thus, a single frame may enter the intermediate box, but a plurality of smaller frames, each with its own TCP header may exit the intermediate box. This behavior by the middle box may disrupt the nicely placed control and data portions.
In the case of resegmentation, the receiver may face a number of challenges. For example, the receiver may not be aware that there are any intermediate boxes between the sender and the receiver. In addition, the initial segmenting scheme used by the sender may not be the segmenting scheme received by the receiver. Thus, although the receiver may be able to order the smaller frames, the receive may be unable to locate, for example, the ULP header and the ULPDU. Accordingly, the receiver may not be able to ascertain the control and boundary information that may be necessary to correctly place the ULPDU in the proper location of, for example, the application buffer of the receiver.
Another problem is that TCP/IP networks may deliver segments out of order. The ULP may have a PDU larger than one TCP segment, which may be limited to 1460 bytes when used on top of the ethernet, and the ULPDU may be split among a plurality of TCP segments. Therefore, some TCP segments may contain, for example, only data and no control information that may instruct the receiving NIC as to where to place the data. The receiver is faced with a choice of dropping the out-of-order segments and requesting a retransmission, which is costly in terms of delay and performance loss, or buffering the out-of-order segments until all the missing segments have been received. Some implementations may choose to accumulate all the out-of-order segments, to wait for the missing TCP segments to be received and then to place them in order. The receiving NIC may then process the whole set of TCP segments, as it uses the control portion to obtain data placement information. This process adds the cost for the temporary buffer and uses high power CPU and wider data path than otherwise. The receiving NIC processes all the accumulated TCP segments in parallel to process other TCP segments at wire speed since traffic on the link continues all the time. The out-of-order segments may create a “processing bubble” for the receiver.
A proposed solution for locating the ULP header is to use the TCP ULP framing (TUF) protocol. According to the TUF protocol, a sender places a special value (i.e., a key) within the TCP segment as the first byte following the TCP header as illustrated in
Another solution to locating a particular header is to use a fixed interval markers (FIM) protocol. The FIM protocol uses only forward-pointing markers and has been limited to internet small computer system interface (iSCSI) applications. In the FIM protocol, a forward-pointing marker is placed in a known location inside the TCP byte stream. This enables the receiver to possibly locate it in the endless TCP byte stream. The FIM marker points forward to the beginning of the iSCSI header as shown in
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.
Aspects of the present invention may be found in, for example, systems and methods that identify an Upper Layer Protocol (ULP) message boundaries. In one embodiment, the present invention may provide a method that identifies ULP message boundaries. The method may include one or more of the following steps: attaching a framing header of a frame to a data payload to form a packet, the framing header being placed immediately after the byte stream transport protocol header, the framing header comprising a length field comprising a length of a framing PDU; and inserting a marker in the packet, the marker pointing backwards to the framing header and being inserted at a preset interval.
In another embodiment, the present invention may provide a method that locates a marker header in a received TCP frame. The method may include one or more of the following steps: locating a backwards-pointing marker; and using information stored in the backwards-pointing marker to locate the framing header.
In another embodiment, the present invention may provide a method that detects resegmentation of a TCP segment. The method may include one or more of the following steps: locating a backwards-pointing marker in the TCP segment; determining a location of a framing header using information stored in the backwards-pointing marker; and determining that resegmentation of the TCP segment has occurred if the framing header is not at the front of the TCP segment after a TCP header of the TCP segment.
In another embodiment, the present invention may provide a method that detects resegmentation of a TCP segment. The method may include one or more of the following steps: locating a backwards-pointing marker in the TCP segment; determining a location of a framing header using information stored in the backwards-pointing marker; and determining that resegmentation of the TCP segment has occurred if the backwards-pointing marker points to a location outside of the TCP segment.
In another embodiment, the present invention may provide a method that detects resegmentation of a TCP segment. The method may include one or more of the following steps: locating a backwards-pointing marker in the TCP segment; determining a location of a framing header using information stored in the backwards-pointing marker; and determining that resegmentation of the TCP frame has occurred if a number of payload bytes in the TCP segment is not equal a number indicated by a framing header length field plus a pad and a CRC field.
In another embodiment, the present invention may provide a method that detects resegmentation of a TCP segment. The method may include one or more of the following steps: locating a backwards-pointing marker in the TCP segment; determining a location of a framing header using information stored in the backwards-pointing marker; and determining that resegmentation of the TCP frame has occurred if a number of payload bytes in the TCP segment is not equal to a sum of all values of a framing header length fields plus pads and CRC fields for multiple framing PDUs placed in a TCP segment.
In yet another embodiment, the present invention may provide a method that detects a potential error in a byte stream transport protocol segment by comparing a received error detection code with a computed error detection code over a framing PDU. The method may include one or more of the following steps: if the comparing occurs before byte stream transport protocol processing, then discarding received segment and relying on the byte stream transport recovery protocol without need for specific framing layer recovery; if the comparing occurs after the byte stream transport protocol processing, then tearing down connection; and allowing for additional protection beyond the byte stream transport checksum protocol.
In yet another embodiment, the present invention may provide a method in which no information is stored from one TCP segment to allow the processing of another TCP segment.
In yet another embodiment, the present invention may provide a method that provides additional protection of a marker by attaching, to the marker, 16 bits of error detecting code such as a cyclical redundancy checking (CRC), for example, CRC16.
In yet another embodiment, the present invention may provide a method that allows additional information to be carried in the reserved bits (e.g., 16 reserved bits) of the Marker. For example, this can be another marker for a ULP specific purpose or any other useful data that can be carried in a sequence of these 16 bit entities. For example, the reserved field can be used for signaling between 2 ULPs.
In some embodiments, the present invention may define a framing protocol that enables the receiver to identify the beginning of ULP control and data portions embedded in the TCP/IP byte stream. Every TCP segment may be self-describing to allow data placement when received in order or out of order. Layered on top of the framing protocol may be, for example, a direct data placement/remote direct memory access (DDP/RDMA) protocol header. The DDP/RDMA header may carry the information as to the buffer to be used and offset into that buffer. Once the receiver finds the DDP/RDMA field, it may tell the control and data portions apart and place the ULP data without processing the protocol specific control information. The upper layer (UL) may form a ULP packet by placing ULP control information or a ULP data unit (ULPDU) as a payload for the Lower Layer Protocol (e.g., RDMA/DDP). The RDMA/DDP PDU may be placed into a framing PDU. The TCP layer may form a TCP segment by attaching a TCP header to the ULP/RDMA/DDP/framing packet. The packets may pass through other layers of the protocol stack (e.g., the ethernet layer) before being placed on a data link (e.g., a wire) as frames by the sender (e.g., a client).
These and other features and advantages of the present invention may be appreciated from a review of the following detailed description of the present invention, along with the accompanying figures in which like reference numerals refer to like parts throughout.
The framing header 70 (e.g., a marker header) may be disposed after the TCP header 60. In one embodiment, the framing header 70 generally must follow immediately after the last byte of TCP header 60, which may include any potential TCP options, in the TCP frame 50. The sender 10 may guarantee that all TCP segments (including retransmissions) have the framing header 70 as the first byte immediately following the TCP header (plus options if used). The framing header 70 may include information such as, for example, data information or control information (e.g., ULP control information). The framing header 70 may also provide information relating to boundaries of the payload 100 corresponding to the framing header 70. In addition, the ULP header 110 may include specific information as to which memory (e.g., an application buffer) and, specifically, where in the memory of the receiver 10 the payload 100 should be placed (e.g., stored). The ULP header 110 may include, for example, a DDP/RDMA header/trailer or other types of ULP headers/trailers.
There may be multiple framing PDUs inside one TCP segment. Each of them may be processed independently by the receiver 30.
The marker 80 is generally a backward pointing marker. The marker 80 may point backwards to the beginning of the framing header 70, thereby identifying the framing header 70. If more than one marker 80 is present in the TCP frame 50, then one or more markers may point backwards to the same framing header 70 as shown in
The marker 80 may be placed in the TCP stream at a preset interval by the transmitter 10. For example, the marker 80 may be placed every 512 bytes in the TCP stream. If the preset interval is small enough (e.g., smaller than smallest transport segment), then a marker may be present in almost every TCP segment 50 or in every TCP segment 50. If the TCP segment is shorter than the preset interval, then there is no guarantee a marker will be present in the TCP segment. If a marker 80 is still present in the short TCP frame 50 (e.g., a TCP segment shorter than the preset interval), then the framing header 70 may be located and the TCP segment 50 may be processed as described above (e.g., the payload 100 may be directly placed in the proper location within the application buffer). If, on the other hand, a marker 80, is not present the receiver 30 may still place the payload 100 inside the TCP segment according to information that may be in the ULP header 110, if the TCP segment has been received in order (e.g., all previous TCP segments with lower TCP sequence number that can be legally received, for example, are within the TCP window, have been received). In this case, even if an intermediate box is present and it has resegmented the TCP byte stream, this segment can still be processed. This is due to the fact that the previous segments were processed and, if there was no error, then it is known that next byte placed by the sender in the TCP byte stream is the first byte of the framing header 70. Another case occurs when the TCP segment is received out of order with no marker. In this case, the receiver places the TCP segment it has received in a temporary buffer (or drops the TCP segment and processes only in order), thereby eliminating any need for a buffer with a slight performance degradation. The buffer size may be small and may be calculated approximately as, for example, the preset interval multiplied by the number of TCP holes the receiver wants to support per every TCP connection. In contrast, the FIM protocol requires a buffer size of the FIM interval plus a maximum transmission unit (MTU) multiplied by the number of TCP holes and the data contained in the marker for every marker, multiplied by the number of TCP connections. The receiver may statistically set aside fewer resources since not all connections may experience out of order TCP segments at the same time. If the receiver runs out of buffer for out-of-order TCP segments, the receiver may drop all subsequent TCP segments received out of order, until some of the buffer has been freed due to, for example, the plugging of holes in the TCP stream.
The TCP frames 50 may be self-descriptive. In addition, unlike the FIM protocol, the receiver 30 does not necessarily have to carry state information from one frame to another frame. Since most every TCP frame 50 may include a marker 80, then most every TCP frame 50 may be processed independently. Independent processing of the TCP frames 50 may substantially reduce buffering needs, especially in a TCP environment in which TCP frames 50 may be out of order upon reaching the receiver 30.
Placing the marker 80 at a preset interval may also provide the receiver 30 with known locations in the TCP stream in which to find the marker 80. Thus, the relative location of the marker 80 with respect to the TCP header 60 may vary from TCP frame 50 to TCP frame 50. The receiver 30 may determine location information within the TCP sequence number space from the TCP headers 60. In one example in which the marker 80 is placed every 512 bytes in the TCP stream, the receiver 30 may perform a modulo 512 operation to locate the marker 80. As the TCP sequence space may start from a non-zero value, which may vary from one TCP connection to another TCP connection, the preset interval may be calculated by subtracting the initial non-zero value from the TCP sequence number carried inside the TCP header and performing a modulo 512 on the result. Unlike the FIM protocol, the ability to start using the framing protocol without negotiation eliminates any additional latencies in getting the two machines to communicate with the benefits of a framing protocol. It may also save on the additional code that may need to be written and stored on the NIC to perform the negotiation.
The present invention also contemplates that, instead of the preset interval, the transmitter 10 and the receiver 30 may negotiate an interval. Furthermore, out-of-band communications may be used to adjust the marker interval. The value of the marker interval may be adjusted by the ULP at some time after initialization. This may allow a balance between wire protocol overhead and receiver side resegmentation buffer size per connection.
In operation, the transmitter 10 may employ a protocol stack that includes upper layers (ULs) as well as, for example, TCP/IP layers in forming the TCP frames 50.
The sender 10 may be aware of the path maximum transmission unit (PMTU) and how it may change. The TCP layer variable maximum segment size may be affected by the PMTU. When retransmitting, per the TCP requirements, the sender 10 may segment the byte stream in the same way the original framing PDU has been segmented (e.g., first byte of the framing header to follow the TCP header, the length of the TCP segment may include one complete framing PDU or several complete framing PDUs). The PMTU may change between the first transmission and the retransmission. The sender 10 may still create the TCP segment the it did the first time. If the PMTU has shrunk, then the original segment size may exceed the allowed PMTU. A lower layer mechanism such as, for example, IP fragmentation, may be employed.
In a network in which the PMTU is too small to allow proper operation, the sender 10 may follow an “emergency mode” as outlined in the TUF protocol. The TUF protocol is described, for example, in “TCP ULP Framing Protocol (TUF): draft-ietf-tsvwg-tcp-ulp-frame-01” by Bailey et al. The above-referenced document is hereby incorporated herein by reference in its entirety.
The transmitter 10 may then send the TCP frame 50.
If the TCP frames 50 are shorter than the preset marker interval of, for example, 512 bytes, then it is possible that the TCP frame 50 may not contain the marker 80. In query 260, the receiver may determine whether the marker is present in the TCP segment. If a marker is not present, then, in query 330, the receiver 30 may determine whether that TCP segment 50 is received in order. If the TCP segments are received in order, then there is no need for buffering and it may be processed right away. In step 340, the receiver 30 may assume, for example, that the framing header begins in the first byte immediately following the TCP header. The process may then loop back to step 280. In query 330, if the TCP segments are received out of order, then, in step 350, the receiver may use limited buffering of approximately 512 bytes since, for example, there may be no more than 512 bytes worth of TCP segments that carry no marker for every hole in the TCP sequence. Once the TCP “hole” is plugged and all previous TCP segments have been processed and found to be error free, the receiver may continue in step 340. If the TCP frames 50 are not received in order and if the receiver 30 may desire to support more than one “hole” in the TCP sequence number space, then additional buffering may be employed (e.g., 512 bytes for every “hole”).
The marker 80 may also be used to detect resegmentation of the TCP frames 50.
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 include all embodiments falling within the scope of the appended claims.
This application is a continuation of U.S. patent application Ser. No. 12/758,484, filed Apr. 12, 2010, which is a continuation of U.S. patent application Ser. No. 11/868,655 (now U.S. Pat. No. 8,135,016), filed Oct. 8, 2007, which is a continuation of U.S. patent application Ser. No. 10/230,643 (now U.S. Pat. No. 7,295,555), filed Aug. 29, 2002, which makes reference to, claims priority to and claims benefit from U.S. Provisional Patent Application Ser. No. 60/363,381, entitled “Method of Identifying ULP Header in TCP Stream,” filed on Mar. 8, 2002; U.S. Provisional Patent Application Ser. No. 60/363,356, entitled “Method of Identifying ULP Header in TCP Stream,” filed on Mar. 11, 2002; U.S. Provisional Patent Application Ser. No. 60/372,852, entitled “Method for Marker Based Re-Segmentation Detection,” filed on Apr. 16, 2002; and U.S. Provisional Patent Application Ser. No. 60/372,851, entitled “Method for Marker Based Re-Segmentation Detection,” filed on Apr. 16, 2002.
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 |
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 | Moskowitz | 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 |
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 |
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 |
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 |
5583859 | Feldmeier | Dec 1996 | A |
5584048 | Wieczorek | Dec 1996 | A |
5600267 | Wong | Feb 1997 | A |
5603051 | Ezzet | Feb 1997 | A |
5606268 | Van Brunt | Feb 1997 | A |
5619497 | Gallagher | 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 | Fiedler | Oct 1997 | A |
5680633 | Koenck | Oct 1997 | A |
5689644 | Chou | Nov 1997 | A |
5724361 | Fiedler | Mar 1998 | A |
5726588 | Fiedler | 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 |
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 |
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 | Baxter | 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 |
5974508 | Maheshwari | 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 |
6081162 | Johnson | Jun 2000 | A |
6094074 | Chi | Jul 2000 | A |
6098064 | Pirolli | 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 |
6151662 | Christie | Nov 2000 | A |
6157623 | Kerstein | 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 |
6223270 | Chesson | Apr 2001 | B1 |
6226680 | Boucher | May 2001 | B1 |
6232844 | Talaga | May 2001 | B1 |
6243386 | Chan | 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 |
6310501 | Yamashita | Oct 2001 | B1 |
6324181 | Wung | Nov 2001 | B1 |
6332179 | Okpisz | Dec 2001 | 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 |
6396832 | Kranzler | May 2002 | B1 |
6396840 | Rose | May 2002 | B1 |
6424194 | Hairapetian | Jul 2002 | B1 |
6424624 | Galand | Jul 2002 | B1 |
6427169 | Elzur | Jul 2002 | B1 |
6427171 | Craft | 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 |
6496479 | Shionozaki | Dec 2002 | B1 |
6535518 | Hu | 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 |
6636947 | Neal | Oct 2003 | B1 |
6649343 | Hirota | Nov 2003 | B1 |
6658599 | Linam | Dec 2003 | B1 |
6665759 | Dawkins | Dec 2003 | B2 |
6675200 | Cheriton et al. | Jan 2004 | B1 |
6681283 | Thekkath et al. | Jan 2004 | B1 |
6744782 | Itakura | Jun 2004 | B1 |
6757291 | Hu | Jun 2004 | B1 |
6757746 | Boucher | Jun 2004 | B2 |
6766389 | Hayter | Jul 2004 | B2 |
6788686 | Khotimsky | Sep 2004 | B1 |
6788704 | Lindsay | Sep 2004 | B1 |
6816932 | Cho | 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 |
6975629 | Welin | Dec 2005 | B2 |
6976205 | Ziai | Dec 2005 | B1 |
6982583 | Yin | Jan 2006 | B2 |
7007103 | Pinkerton | Feb 2006 | B2 |
7009985 | Black | Mar 2006 | B2 |
7159030 | Elzur | Jan 2007 | B1 |
7181531 | Pinkerton | Feb 2007 | B2 |
7212534 | Kadambi | May 2007 | B2 |
7295555 | Elzur | Nov 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 | Mies | Jul 2008 | B2 |
7397800 | Elzur | Jul 2008 | B2 |
7400639 | Madukkarumukumana | Jul 2008 | B2 |
7411959 | Elzur | Aug 2008 | B2 |
7430171 | Black | Sep 2008 | B2 |
7515612 | Thompson | Apr 2009 | B1 |
7586850 | Warren | Sep 2009 | B2 |
8135016 | Elzur | Mar 2012 | B2 |
8345689 | Elzur | Jan 2013 | B2 |
8451863 | Elzur | May 2013 | B2 |
20010026553 | Gallant | Oct 2001 | A1 |
20010037397 | Boucher | Nov 2001 | A1 |
20020078265 | Frazier | Jun 2002 | A1 |
20020085562 | Hufferd | Jul 2002 | A1 |
20020089927 | Fischer | Jul 2002 | A1 |
20020095519 | Philbrick | Jul 2002 | A1 |
20020103988 | Dornier | Aug 2002 | A1 |
20020130692 | Hairapetian | Sep 2002 | A1 |
20020174253 | Hayter | Nov 2002 | A1 |
20020190770 | Yin | Dec 2002 | A1 |
20020194400 | Porterfield | Dec 2002 | A1 |
20030001646 | Hairapetian | Jan 2003 | A1 |
20030016628 | Kadambi | Jan 2003 | A1 |
20030021229 | Kadambi | Jan 2003 | A1 |
20030038809 | Peng | Feb 2003 | A1 |
20030046330 | Hayes | Mar 2003 | A1 |
20030046418 | Raval | Mar 2003 | A1 |
20030061505 | Sperry | 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 |
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 |
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 | Elzu | 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 |
20100220729 | Elzur | Sep 2010 | A1 |
20100223540 | Elzur | Sep 2010 | A1 |
Number | Date | Country |
---|---|---|
0465090 | Apr 1996 | EP |
0692892 | Apr 2003 | EP |
1345382 | Sep 2003 | EP |
1357721 | Oct 2003 | EP |
1460804 | Sep 2004 | EP |
1460805 | Sep 2004 | EP |
1460806 | Sep 2004 | EP |
1206075 | Nov 2007 | EP |
1537695 | Feb 2009 | EP |
2725573 | Nov 1994 | FR |
19940012105 | Apr 1996 | FR |
1188301 | Jul 1989 | JP |
11243420 | Sep 1999 | JP |
2001045092 | Feb 2001 | JP |
20011313717 | Nov 2001 | JP |
WO9900948 | Jan 1999 | WO |
WO0056013 | Sep 2000 | WO |
WO0235784 | May 2002 | WO |
WO03079612 | Sep 2003 | WO |
Entry |
---|
Ang, “An Evaluation of an Attempt at Offloading TCP/IP Protocol Processing Onto an i90RN-Based iNIC”, Hewlett Packard, 2001, pp. 1-33. |
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. |
Emulex Corporation's Answer, Affirmative Defenses, and Counterclaims, Demand for Jury Trial, Broadcom Corporation vs. Emulex Corporation, Case No. SACV 09-1058-JVS (ANx), Nov. 4, 2009. |
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. |
Exhibit A: Disputed Terms, Proposed Constructions, and Intrinsic and Extrinsic Evidence, Broadcom Corporation v. Emulex Corporation, Case No. 8:09-cv-01058-JVS-AN. |
Defendant Emulex Corporation's First Amended Disclosure of Preliminary Invalidity Contentions, with Exhibit B, Broadcom Corporation vs. Emulex Corporation, Case No. SACV 09-1058-JVS (ANx), Jun. 28, 2010. |
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. |
Fiedler, “A 1.0625Gbps Transceiver with 2x-Oversampling and Transmit Signal Pre-Emphasis”, 1997 IEEE International Solid-State Circuits Conference, Digest of Technical Papers, ISSCC97, 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. |
Fiedler, “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. |
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”, In proceeding of: Proceedings of the 1997 International Symposium on Low Power Electronics and Design, 1997, Monterey, California, USA, Aug. 18-20, 1997, 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 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 Techniques 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, Denver, CO, pp. 1-8. |
Nayfeh, “Exploring the Design Space for a Shared-Cache Multiprocessor”, 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, “Introduction to TCP/IP Offload Engine (TOA)”, 10 Gigabit Ethernet Alliance, Version 1.0, Apr. 2002, pp. 1-6. |
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. |
Hairapetian, “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 Serives, 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 Accelerators Can Help or Hinder”, Network Systems Design Line, Feb. 26, 2007, http://www.networksystemsdesignline.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 Jury Trial, Broadcom Corporationvs. Emulex Corporation,Case No. SACV 09-1058-JVS (ANx), Nov. 4, 2009. |
European Search Report corresponding to European Patent Application No. 03791992.5-1244, dated Sep. 7, 2010. |
Plaintiff Broadcom Corporation's Opening Markman Brief, United States Districk Court, Central District of California, Southern Division, Broadcom Corporationv. 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 Corporationv. 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. |
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 Corporationv. Emulex Corporation, Case No. 8:09-cv-01058-JVS-AN. |
Pinkerton, et al., Internet Draft, “WARP Architectural Requirements Summary”, Jan. 2001, pp. 1-10. |
Satran, et al., IPS Internet Draft, “iSCSI”, Jan. 20, 2002, pp. 1-20. |
Satran, J., Design Team Memo, “iSCSI—fragments, packets, synchronization and RDMA”, Jul. 10, 2000, pp. 1-10. |
Haagens, R., “TCP ULP Message Framing iSCSI Framing”, May 10, 2001, pp. 1-26. |
Haagens, R. and Romanow, A., “TCE ULP Message Framing iSCSI Framing”, Jul. 5, 2000, pp. 1-31. |
Bailey, et al., Transport Area Working Group, Internet-Draft, “ULP Framing for TCP”, Jul. 6, 2001, pp. 1-20. |
Bailey, et al., Transport Area Working Group, Internet-Draft, “TCP ULP Framing Protocol (TUP)”, Nov. 2001, pp. 1-10. |
Elz, R., IETF Network Working Group, Request for Comments: 1982, “Serial Number Arithmetic”, Aug. 1996, pp. 1-10. |
Defendant Emulex Corporation's Disclosure of Preliminary Invalidity Contentions, with Exhibit B, Broadcom Corporation vs. 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 B, Broadcom Corporationvs. Emulex Corporation,Case No. SACV 09-1058-JVS (ANx), Jun. 28, 2010. |
Number | Date | Country | |
---|---|---|---|
20130262607 A1 | Oct 2013 | US |
Number | Date | Country | |
---|---|---|---|
60372851 | Apr 2002 | US | |
60372852 | Apr 2002 | US | |
60363356 | Mar 2002 | US | |
60363381 | Mar 2002 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12758484 | Apr 2010 | US |
Child | 13903454 | US | |
Parent | 11868655 | Oct 2007 | US |
Child | 12758484 | US | |
Parent | 10230643 | Aug 2002 | US |
Child | 11868655 | US |