|Publication number||US8031729 B2|
|Application number||US 12/241,917|
|Publication date||Oct 4, 2011|
|Filing date||Sep 30, 2008|
|Priority date||Oct 18, 2002|
|Also published as||DE60331847D1, EP1559022A2, EP1559022A4, EP1559222A2, EP1559222A4, EP1559222B1, US7430211, US7508837, US20040085984, US20040095949, US20090034551, WO2004036381A2, WO2004036381A3, WO2004036387A2, WO2004036387A3|
|Publication number||12241917, 241917, US 8031729 B2, US 8031729B2, US-B2-8031729, US8031729 B2, US8031729B2|
|Original Assignee||Broadcom Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (33), Non-Patent Citations (3), Referenced by (2), Classifications (18), Legal Events (2)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present application is a CONTINUATION of U.S. application Ser. No. 10/688,373, filed Oct. 17, 2003.
Said U.S. application Ser. No. 10/688,373 also claims benefit from and priority to the following U.S. provisional applications: U.S. Application No. 60/419,354, filed Oct. 18, 2002; U.S. Application No. 60/420,901, filed Oct. 24, 2002; U.S. Application No. 60/439,951, filed Jan. 14, 2003; and U.S. Application No. 60/442,360, filed Jan. 24, 2003.
This application also makes reference to U.S. application Ser. No. 10/688,392 entitled “System and Method for Receive Queue Provisioning” and filed on Oct. 17, 2003.
The above-identified applications are hereby incorporated herein by reference in their entirety.
The above-identified United States patent applications are hereby incorporated herein by reference in their entirety.
Conventional systems tend to waste precious resources when communicating via a queue pair (QP) connection. A conventional QP includes a dedicated send queue (SQ) and a dedicated receive queue (RQ) as well as a dedicated or shared completion queue (CQ). Thus, two-way communications can be achieved between peer systems via respective QPs. For example, a message can be sent from an SQ of a first peer system to an RQ of a second peer system. Similarly, a message can be sent from an SQ of the second peer system to an RQ of the first peer system.
When the number of connections between the peer systems increases, the number of QPs increases. Some conventional peer systems allocate the same amount of resources of a preset size to support each QP including the respective dedicated SQ and the respective dedicated RQ. However, such over-provisioning may be wasteful, in particular, with respect to the dedicated RQs. For example, if a particular connection is inactive or relatively inactive, a substantial portion of the resources allocated to the RQ of the inactive or relatively inactive QP remains unused and is not re-allocated for other purposes.
RQ resources are provisioned in anticipation of a burst of messages at wire speed. The user of a transport layer (e.g., a transmission control protocol (TCP) layer) provides a wide-open receive Window to improve performance beyond, for example, 64 KB per connection, thereby forcing the upper layer protocol (ULP) layer to manage the burst situation. Many applications such as Internet Small Computer System Interface (iSCSI) applications do not have a good upper bound as to the number of unsolicited messages that can be sent by one peer and received by another. This may cause connections to be torn down. Managing RQ resources on a per QP basis implies that each QP has to have enough buffers allocated to its RQ to handle a potential burst. When a particular machine serves a high number of QPs, a lot of buffers are allocated to QPs that may utilize them at a very low rate.
Some conventional systems do not control which connections consume buffers and which connections are dropped. In layered protocol processing, when resources are scarce, data is buffered by a central entity such as a TCP layer until a ULP application procures additional buffering. In rototilled protocol processing, when resources are scarce, data or the connection is dropped requiring either resending of the data or re-establishing the connection. When the ULP application procures additional buffers, then the ULP application may again receive data. In either processing scheme, buffers are consumed on a first-come-first-serve basis. Thus, typically inactive or relatively inactive connections can consume a substantial portion of the available resources, thereby limiting the available resources for typically active connections. Such typically active connections, which tend to be the more important consumers, suffer from reduced traffic bandwidth, are be torn down or have higher costs associated with them for the same level of functionality, for example, as larger memories are provided. In fact, one or more malicious connections (e.g., a rogue desktop) or malfunctioning connections can drain all of the available resources to the detriment of all other connections.
Some conventional systems suffer from substantial delays in adjusting the amount of allocated resources for a particular connection. For example, in a credit-based system at least one round-trip delay between peer systems may be required before a particular resource allocation can be modified. Thus, if a connection suddenly becomes active thereby needing additional resources, then one peer system informs the other peer system which, in turn, acknowledges the change in resource allocation to the original peer system before communications using the adjusted resource allocation may commence. The round-trip delay can be substantial between distant peers or over a network with substantial latencies and may require additional attention from a software layer adapted to provide buffers. In many systems, the response time of such a software entity is large in comparison with network speeds and the response time required by high performance applications. In particular, the round-trip delay becomes compounded each time the resource allocation of the connection is adjusted. The round-trip delays also exacerbate synchronization issues between hardware and software. Moreover, as the number of connections increases, the inefficiencies in adjusting the resource allocations become accentuated.
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.
Some aspects of the present invention may be found, for example, in systems and methods that provide receive queue (RQ) provisioning. In one embodiment, the present invention may provide a communications system that may include, for example, a first queue pair (QP), a second QP, a general pool and a resource manager. The first QP may be associated with a first connection and with a first limit value. The first QP may include, for example, a first send queue (SQ). The second QP may be associated with a second connection and with a second limit value. The second QP may include, for example, a second SQ. The general pool may include, for example, a shared receive queue (SRQ) that is shared by the first QP and the second QP. The resource manager may provide, for example, provisioning for the SRQ. At least one of the first QP, the second QP and the resource manager may manage the first limit value and the second limit value.
In another embodiment, the present invention may provide a method for communications. The method may include, for example, one or more of the following: establishing a first connection associated with a first QP; establishing a second connection associated with a second QP; sharing an SRQ among the first QP and the second QP; assigning a local limit value to be associated with the first connection, the local limit value being associated with a maximum number of SRQ buffers that are accessible to the first QP; and dropping the first connection or an incoming message on the first connection if the first QP attempts to access more SRQ buffers than its maximum number.
In yet another embodiment, the present invention may provide a communications system. The communications system may include, for example, a first QP associated with a first connection; a second QP associated with a second connection; an SRQ shared by the first QP and the second QP; and a watermark. The watermark may indicate, for example, a low level of work queue elements (WQEs) on the SRQ.
In still another embodiment, the present invention may provide a method for communications. The method may include, for example, one or more of the following: sharing an RQ between a first QP associated with a first connection and a second QP associated with a second connection; setting a threshold that is associated with the shared RQ and is indicative of a particular number of WQEs on the shared RQ; and generating an asynchronous event if the threshold is reached.
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.
Some aspects of the present invention may be found, for example, in systems and methods that provide receive queue (RQ) provisioning. In some embodiments, the present invention may provide a system that includes, for example, a shared receive queue (SRQ) that may be shared among a plurality of connections. The resources of the SRQ may be dynamically allocated based upon, for example, statistical information and information (e.g., actual demand information) about the connections.
In some embodiments, the present invention may find use with, for example, remote direct memory access (RDMA) applications or RDMA-based applications such as, for example, Internet small computer system interface (iSCSI) over RDMA (iSER) applications. In addition, the present invention may find use with, for example, kernel mode applications or user mode applications.
In some embodiments, the present invention may provide a controller (e.g., a storage controller) that may be adapted to dynamically assign resources for messages (e.g., unsolicited messages) while supporting a large number of connections. In other embodiments, the present invention may provide a controller that may be adapted to dynamically assign resources per activity on a particular connection. In still other embodiments, the present invention may provide a controller that may be adapted to recoup buffers (e.g., RQ buffers) that have been posted for a particular connection that is becoming or has become inactive. In yet other embodiments, the present invention may provide a controller that may be adapted to enhance efficiency or to match application needs by running in, for example, a kernel mode or a user mode.
The consumer 40 of the first node 10 may be in communications with the consumer 70 of the second node 20. The consumer 40 may be coupled to the RI 60 via the verb interface 50. The RI 60 may be coupled to the RI 90 via the network. The RI 90 may be coupled to the consumer 70 via the verb interface 80.
In operation according to one embodiment, the consumer 40 may communicate with the consumer 70 resulting in, for example, the sending of information from the first node 10 to the second node 20. The consumer 40 may communicate with the RI 60 by using, for example, verbs. The RI 60 may then perform the requested operation. In one example, the requested operation may include, for example, sending and storing data from the first node 10 to the second node 20. Accordingly, data may be sent from the RI 60 to the RI 90 via the network 30. The consumers 40, 70 may be, for example, in two-way communications sending information back and forth via the network 30.
In one embodiment, the present invention may provide that communications are achieved via one or more queue pairs (QPs) in the first node 10 and one or more QPs in the second node 20. A QP in the first node 10 and a QP in the second node 20 may support, for example, a two-way connection between the first node 10 and the second node 20. A plurality of connections may be supported, for example, by a plurality of QPs in the first node and a corresponding plurality of QPs in the second node. Each QP may include, for example, a send queue (SQ) and a receive queue (RQ). In one example, messages may be sent from an SQ in one node and received in an RQ in another node. The node receiving a message may post, for example, buffers in its RQ that may be consumed by the received messages.
In a particular node, a plurality of connections may be supported by a plurality of QPs. Although an SQ of each QP may be dedicated to each connection, an RQ may be shared by one or more QPs (i.e., by one or more connections). Thus, one or more shared RQs (SRQs) may be provided in a general pool of a particular node, thereby providing resources (e.g., buffers) for a plurality of connections.
In some embodiments according to the present invention, the use of an SRQ by one node may not be known or visible to another node. The SRQ may be, for example, a local concept or a local policy. RQ resources corresponding to communications with multiple remote nodes may be locally grouped and provisioned by one or more SRQs. In one embodiment, multiple remote nodes may be served by one or more SRQs. In another embodiment, a single remote node with multiple connections may be served by one or more SRQs. In yet another embodiment, a group of nodes associated with a particular application or with a particular trust level may be served by one or more SRQs.
Each connection maintained by the nodes 10, 20 may have its own buffering needs which may change with time and which may depend upon the type of connection. Thus, the nodes 10, 20 may provide statistical provisioning of resources (e.g., buffers) for the connections.
In one embodiment, the present invention may provide that the nodes 10, 20 provide statistical provisioning for the SRQ resources. Thus, a node 10, 20 may provide local control for the provisioning of a local SRQ. The use of a local SRQ by one node may not necessarily be known or visible to another node. Local control may minimize delays, for example, in adjusting resource allocations. In addition, local control may support, for example, real-time resource management. The information used in determining the statistical provisioning may be include, for example, static data (e.g., data tables programmed with preset values) or dynamic data (e.g., local empirical data which may change over time). Furthermore, other information that may affect statistical provisioning may include, for example, connection parameters such as, for example, the type of connection, the number of connections and the status of connections.
In another embodiment, the present invention may provide that the nodes 10, 20 provide local control over the resource allocation of each connection. For example, a node 10, 20 may provide a limit as to the number of buffers (e.g., buffers of the SRQ) a particular connection may access at a given time. Thus, for example, the node 10, 20 may make more buffers of an SRQ accessible to an active connection (e.g., a storage target connection) than to an inactive or relatively less active connection (e.g., a desktop connection for e-mail which is accessed only a few times daily). Furthermore, as active connections become less active, the node 10, 20 may make fewer buffers accessible to such less active connections. In the event that a particular connection limit is exceeded, the node 10, 20 may, for example, increase the limit, replenish the buffers, drop the connection or drop data packets carried by the connection. The node 10, 20 may also, upon exceeding a limit, analyze the connection behavior to determine whether, for example, to retune resources, adjust the limit or dry out resources if the connection behavior is indicative of a malicious attack. In one example, if a desktop e-mail connection (i.e., a relatively inactive connection) suddenly becomes active, thereby exceeding its local limit, then the desktop connection may be dropped. Accordingly, a less important connection may be dropped before consuming too many buffers, thereby possibly taking away resources from more important connections (e.g., a database connection that is generally very active).
Limits may be, for example, soft or hard. A soft limit may generate, for example, a local indication to the local buffer management that can analyze connection behavior to determine a course of action. The soft limit may provide a graceful manner in which to handle error conditions or unforeseen conditions (e.g., bursty conditions). A hard limit may trigger an automatic response (e.g., closing a connection) as determined by the local buffer management.
To respond to out-of-order messages (e.g., which may be a form of malicious attack), a QP may consume buffers for the messages in between the next in-order message MN+1 and the out-of-order message MN+x. This may guarantee that the QP has enough resources for all messages and may simplify operation. The QP may use the sequence number of the incoming message (e.g., as provided by a direct data placement (DDP) protocol message) to determine the number of expected messages between the next in-order expected message MN+1 and the out-of-order message MN+x carrying a sequence number of N+x. The QP may then be allocated buffers for all of the messages (i.e., x buffers). If x is large, limited by the only the TCP receive window, then it may starve other QPs. In one embodiment, the buffer manager may impose an out-of-order limit (e.g., setting the out-of-order limit to x) on each QP to prevent it from a particular QP from starving other QPs as may occur during a malicious attack. The out-of-order limit may be different from other limits in other layers dealing with out-of-order messages. In another embodiment, the buffer manager limit may be combined with other limits such as, for example, a TCP limit on the number of holes (i.e., one or more ranges in sequence space between the sequence numbers of received messages) that can be managed. If either of the limits are exceeded, then a frame may be dropped. In providing buffers to the SRQ, the buffer manager may take into account that each QP may have out-of-order messages.
In yet another embodiment, the present invention may provide a watermark that may be used to indicate a particular level (e.g., a low threshold level) of available resources in the SRQ of a node 10, 20. When the available resources of the SRQ become too low so as to reach the watermark, an event may be generated. Accordingly, a buffer manager or an upper layer protocol (ULP) layer or the RI 60, 90 may then be alerted to a potential problem (e.g., a malicious attack, a malfunctioning connection, a runaway QP, etc.) The ULP layer or the RI 60, 90 may then attempt to identify the source of the offending or excessive traffic and deal with it (e.g., drop a connection with excessive traffic).
The verb interface 110 may provide an interface (e.g., a software process) between the consumer 100 and the RI 120. Communications between the consumer 100 and the RI 120 may be achieved, for example, through the use of verbs which may perform, for example, one or more of the following: managing a connection state; managing the memory TPT; submitting work to the RNIC 130; and retrieving work and events from the RNIC 130.
The RI 120 may perform work, for example, on behalf of the consumer 100. The RI 120 may include, for example, software, firmware, hardware or combinations thereof. The RI 120 may be adapted to perform, for example, one or more of the following: queuing; managing memory; converting work requests (WRs) into work queue elements (WQEs); supporting RDMA, DDP or other protocols; converting completion queue elements (CQEs) into work completions (WCs); and generating asynchronous events.
Work may be submitted in the form of a WR. The WR may include, for example, a scatter/gather list (SGL) of local data segments. A local data segment may include, for example, a local steering tag (STag), a local target offset, a length or other modifiers or descriptors. Some examples of WR types include, for example, send, RDMA write, RDMA read, bind memory window, etc.
The RI 120 may convert WRs into WQEs and may process the WQEs. The RI 120 may return control to the consumer 100 after the WR has been converted to a WQE and submitted to the SQ. In one embodiment, the RI 120 may not modify the WR after control has been returned to the consumer.
Tagged buffers may be used, for example, for solicited activity. Tagged activity may employ, for example, the SQ. Untagged buffers may be used, for example, on the SRQ. The CQE may be used, for example, to report completion for the posted SQ/SRQ WQEs. The CQ may be shared or non-shared. Statistical provisioning of the CQEs may be used. In some embodiments, some minimum may be guaranteed per a verb specification to ensure proper operation.
The protocol processing layer 160 may process some of the layered protocols encapsulated in incoming packets using, for example, layered or rototilled protocol processing. In one example, the protocol processing layer 160 may process, for example, one or more of the following protocols: an upper layer protocol; a marker-based upper layer protocol data unit (ULPDU) aligned (MPA) framing protocol or a framing protocol data unit (FPDU) protocol; a transport protocol (e.g., a transmission control protocol (TCP)); an Internet Protocol (IP); and a data link layer protocol (e.g., an Ethernet). Examples of some MPA framing protocols may be found in, for example, U.S. patent application Ser. No. 10/230,643, entitled “System and Method for Identifying Upper Layer Protocol Message Boundaries” and filed on Aug. 29, 2002. The above-referenced U.S. patent application is hereby incorporated herein by reference in its entirety. Other examples of some MPA framing protocols may be found, for example, in conventional MPA framing protocols.
With regard to RQ sharing, one or more of the following may be applicable according to the present invention. The RQ may be a central resource. A buffer manager such as, for example, one or more buffer managers 170, may allocate local limits to one or more QPs (e.g., all QPs). Each QP may draw based upon its respective local limit and the resources available in the SRQ. The top of the CQ processing may determine credit consumption by the QP. New credit may be replenished to each QP on its credit receive queue (CRQ).
In one embodiment, the system may support SRQ resources less than, for example, a total SRQ limit. A local limit may be set via the LRQ for each QP, thereby setting a local maximum for resource consumption in a respective QP. The local limit as well as total limit may be subject to statistical provisioning. For example, the total limit may be related to the sum of the individual statistical provisionings. If a local limit has been reached without replenishment, then connection tear down may occur on the overdraft.
Depletion of SRQ resources may be the result of, for example, an attack from one or more malicious connections or malfunctioning connections. When the resources of the SRQ fall below the low watermark, the buffer manager or the ULP layer may be notified via an asynchronous event. The buffer manager or the ULP layer may attempt to identify the one or more offending connections. For example, if the attack comprises mostly in-order messages, then the ULP layer may analyze the completions off the CQ or SCQ to determine which QP or QPs are the source of the excessive traffic (e.g., runaway traffic). For example, the excessive traffic may be the result of offending traffic such as, for example, too many unsolicited data protocol data units (PDUs); the breaking of unsolicited data into many small direct data placement (DDP) messages; too many no operations (NOPs); too many read commands, etc. The ULP layer may also use heuristics to analyze traffic patterns per connection to aid in identifying the offending QP. In addition, to further assist in the identification of the offending connection, the ULP layer or the buffer manager 170 may perform per-QP score boarding with aging. Additional buffer provisioning may be used to account for any processing latency.
In the case in which the attack comprises mostly out-of-order messages, the ULP layer may not be able to identify rogue connections since, for example, many out-of-order messages can occupy WQEs that the RI 120 cannot complete to the CQ or SCQ. The ULP layer may observe, for example, a large gap between the number of posted WQEs on the SRQ and the number of CQEs on the CQ or SCQ. The ULP layer may lack visibility as the number of uncompleted WQEs that each QP is consuming from the SRQ. Accordingly, the node may be adapted to enhance visibility or to control out-of-order WQE occupancy. In one embodiment, the node may be adapted such that no more than a threshold number of out-of-order WQEs may occur on the SRQ. In another embodiment, the node may be adapted such that no more than a respective threshold number of out-of-order WQEs may occur per QP. The threshold number may vary from QP to QP. Accordingly, a particular QP may not exceed its respective out-of-order limit. In yet another embodiment, the node may be adapted such that all WQEs holding out-of-order messages may be completed with error status to prevent buffer starvation from the SRQ upon reaching a particular high watermark.
One or more embodiments according to the present invention may include, for example, one or more advantages as set forth below.
A general pool implementation may be applicable to either kernel space or user space. The SRQ may be used as a general pool for use with, for example, receive-untagged WQEs. Such an implementation may have, for example, one or more of the following advantages. Resources may be administered locally and may be more flexible. The general pool need not necessitate a flow control for ULPs (e.g., iSER) using the RI nor changes to the ULP or to the wire protocols. A round trip delay might not be assessed each time a resource allocation is adjusted. The general pool implementation may provide scalability for a large number of QPs. The implementation may provide a simplified management scheme of buffers for use with, for example, unsolicited activities, commands and task management. Verbs used with respect to sharing the CQ may also be applicable to sharing the RQ. WQEs need not be completed in order to the CQ. Some embodiments may include buffers, which are all the same size, and may share regions among participating QPs. As the limit may be optional as well as on top of the SRQ, in some embodiments according to the present invention, latencies may not be present as the QPs may manage the buffer consumption.
In some embodiments of the present invention, an SRQ may be provided for use, for example, in a user mode (e.g., an RDMA user mode). Some applications (e.g., database applications, interprocess communication (IPC) applications, etc.) may concurrently use a plurality of QPs. For example, on a particular Tier 2 or a particular Tier 3 server, the number of multiple concurrent QPs may range, for example, from approximately 1,000 QPs to approximately 64,000 QPs. By using an SRQ, instead of each QP having its own solely dedicated RQ, precious system resources may be conserved. For example, if a particular connection is relatively inactive, then statistical provisioning may allocate less than the respective maximum amount of resources to the relatively inactive connection. As a numerical example, instead of providing a full window of 64 KB for every connection of 1000 connections for a total of 64 MB, it may suffice to provide for the longest burst at wire speed before the buffer manager can react by providing more resources (e.g., for a long 1 ms latency of the buffer manager on a 1 gigabit network only 1 MB may be required). In another example, a shared pool may save a substantial amount of system resources, for example, at least for threads of the same process where security schemes (e.g., protection domain schemes) allow.
The RNIC 130, which may have limited on-chip memory, may be adapted to keep state for all active QPs. This may include, for example, a few entries of the SRQ (e.g., a few WQEs). The RNIC 130 may be adapted to handle, for example, out-of-order reception (e.g., potentially receiving message MN+x into WQEN+x), without substantially increasing on-chip caching requirements. In one embodiment, on-chip caching requirements may be alleviated by employing an SRQ in a general pool that may result in less context being kept by each QP. Savings due to the general pool configuration can be quite substantial. In one example, savings of up to approximately 20 percent may be realized. Additional savings including other savings values in excess of approximately 20 percent are also contemplated by the present invention.
The scalability of the RNIC 130 may be enhanced by caching some of the QP context. QP context may be fetched when a respective QP becomes active or becomes increasingly active. Caching may be further enhanced by reducing the size of the QP context. In one example, SRQ WQEs per QP might not be stored. One or more embodiments may benefit from fewer bytes being transferred over a particular time period (e.g., a limited time). Furthermore, an improved real-time solution may be provided with less host bus (e.g., PCI, PCI-X or PCI-Express) arbitration and fewer host bus transactions.
The local limits of respective QPs may allow for the sharing of the SRQ among connections, for example, that are not necessarily affiliated with the same credentials. For example, a plurality of desktops and a server may share the SRQ even though desktops may often be dormant and may not be physically secured like a server. The local limits may also contain the damage that a remote attacking QP may maliciously inflict. Thus, for example, one malicious or malfunctioning connection might not be able to consume all of the SRQ resources, thereby starving other connections sharing the SRQ resources. The local limits may also provide a basic quality of service (QoS) mechanism by which some connections are assigned priority over other connections with respect to any shared resources. Local limiting may also provide for analyzing and adjusting the level of provisioning on a per connection basis. In addition, the local limits may allow for the sharing of STags. For example, STags for tagged buffers may be shared among multiple connections (e.g., connections that may not be trusted) per session.
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 embodiments disclosed, but that the present invention will include all embodiments falling within the scope of the appended claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4493021||Apr 3, 1981||Jan 8, 1985||The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration||Multicomputer communication system|
|US5313582||Apr 30, 1991||May 17, 1994||Standard Microsystems Corporation||Method and apparatus for buffering data within stations of a communication network|
|US5838677 *||Apr 15, 1996||Nov 17, 1998||Hitachi, Ltd.||Switching system having means for congestion control by monitoring packets in a shared buffer and by suppressing the reading of packets from input buffers|
|US5867663||Jul 18, 1996||Feb 2, 1999||Fujitsu Network Communications, Inc.||Method and system for controlling network service parameters in a cell based communications network|
|US5889956||Jul 18, 1996||Mar 30, 1999||Fujitsu Network Communications, Inc.||Hierarchical resource management with maximum allowable allocation boundaries|
|US5916307||Jun 5, 1996||Jun 29, 1999||New Era Of Networks, Inc.||Method and structure for balanced queue communication between nodes in a distributed computing application|
|US5958017||Sep 23, 1997||Sep 28, 1999||Cray Research, Inc.||Adaptive congestion control mechanism for modular computer networks|
|US5999518||Dec 4, 1997||Dec 7, 1999||Alcatel Usa Sourcing, L.P.||Distributed telecommunications switching system and method|
|US6341302||Sep 24, 1998||Jan 22, 2002||Compaq Information Technologies Group, Lp||Efficient inter-task queue protocol|
|US6426957||Dec 11, 1998||Jul 30, 2002||Fujitsu Network Communications, Inc.||Asynchronous transfer mode based service consolidation switch|
|US6501757||Mar 6, 2000||Dec 31, 2002||Centre For Development Of Telematics||ATM switch|
|US6611883||Nov 16, 2000||Aug 26, 2003||Sun Microsystems, Inc.||Method and apparatus for implementing PCI DMA speculative prefetching in a message passing queue oriented bus system|
|US6721806||Sep 5, 2002||Apr 13, 2004||International Business Machines Corporation||Remote direct memory access enabled network interface controller switchover and switchback support|
|US6990528||Oct 19, 2000||Jan 24, 2006||International Business Machines Corporation||System area network of end-to-end context via reliable datagram domains|
|US7095750 *||Aug 16, 2001||Aug 22, 2006||International Business Machines Corporation||Apparatus and method for virtualizing a queue pair space to minimize time-wait impacts|
|US7430211 *||Oct 17, 2003||Sep 30, 2008||Broadcom Corporation||System and method for receive queue provisioning|
|US7508837||Oct 17, 2003||Mar 24, 2009||Broadcom Corporation||System and method for receive queue provisioning|
|US20020003777||Jul 5, 2001||Jan 10, 2002||Nec Corporation||Transmission queue managing system capable of efficiently controlling traffic congestion|
|US20020055993||Oct 31, 2001||May 9, 2002||Shah Hemal V.||Credit based flow control scheme over virtual interface architecture for system area networks|
|US20020083175||Aug 14, 2001||Jun 27, 2002||Wanwall, Inc. (A Delaware Corporation)||Methods and apparatus for protecting against overload conditions on nodes of a distributed network|
|US20020087710||Jul 16, 2001||Jul 4, 2002||Microsoft Corporation||Exposing a bridged network as a single virtual segment|
|US20020101820||Sep 13, 2001||Aug 1, 2002||Narad Networks, Inc.||Broadband system with traffic policing and transmission scheduling|
|US20020118667||Dec 21, 2000||Aug 29, 2002||Chintada Lakshmana Rao||Medium access dynamic congestion control mechanism for wireless data|
|US20020133648||Dec 28, 2001||Sep 19, 2002||Zarlink Semiconductor Limited||Data queue system|
|US20020141424||Mar 28, 2001||Oct 3, 2002||Gasbarro Dominic J.||Host-fabric adapter having work queue entry (WQE) ring hardware assist (HWA) mechanism|
|US20030115340||Oct 31, 2002||Jun 19, 2003||Sagula Rafael Linden||Data transmission process and system|
|US20030154399||Feb 8, 2002||Aug 14, 2003||Nir Zuk||Multi-method gateway-based network security systems and methods|
|US20040049774||Sep 5, 2002||Mar 11, 2004||International Business Machines Corporation||Remote direct memory access enabled network interface controller switchover and switchback support|
|US20040073622||Aug 19, 2003||Apr 15, 2004||Mcdaniel Scott S.||One-shot RDMA|
|US20040120336 *||Dec 24, 2002||Jun 24, 2004||Ariel Hendel||Method and apparatus for starvation-free scheduling of communications|
|WO2000010095A1||Aug 13, 1999||Feb 24, 2000||Intel Corporation||Striping packets of data across multiple virtual channels|
|WO2000041365A1||Dec 28, 1999||Jul 13, 2000||Microsoft Corporation||Method and system for credit-based data flow control|
|WO2000072142A1||May 24, 2000||Nov 30, 2000||Hewlett-Packard Company||Partitioning in distributed computer system|
|1||International Search Report, PCT/US03/33015, Apr. 7, 2004, 4 pgs.|
|2||Mishra, P., Designing buffer management policies at an IP/ATM gateway, 1998 IEEE ATM Workshop Proceedings, pp. 144-153, May 1998.|
|3||Supplementary European Search Report, EP 03809133.6, Nov. 16, 2005, 3 pgs.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8230068 *||Jul 24, 2012||Netapp, Inc.||Dynamic command capacity allocation across multiple sessions and transports|
|US20060123112 *||Dec 2, 2004||Jun 8, 2006||Lsi Logic Corporation||Dynamic command capacity allocation across multiple sessions and transports|
|U.S. Classification||370/412, 370/429|
|International Classification||H04L12/28, H04L29/06, H04L12/56, G06F15/17, G06F, H04J1/16, H04L29/08, G06F13/28|
|Cooperative Classification||H04L69/16, H04L69/32, H04L49/9036, H04L47/621, H04L49/90|
|European Classification||H04L49/90, H04L49/90J, H04L47/62B|
|Apr 6, 2015||FPAY||Fee payment|
Year of fee payment: 4
|Feb 11, 2016||AS||Assignment|
Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH
Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:037806/0001
Effective date: 20160201