This is generally related to the technical field of networking. More specifically, this disclosure is related to systems and methods for facilitating a network interface controller (NIC) with efficient management of non-idempotent operations.
As network-enabled devices and applications become progressively more ubiquitous, various types of traffic as well as the ever-increasing network load continue to demand more performance from the underlying network architecture. For example, applications such as high-performance computing (HPC), media streaming, and Internet of Things (IOT) can generate different types of traffic with distinctive characteristics. As a result, in addition to conventional network performance metrics such as bandwidth and delay, network architects continue to face challenges such as scalability, versatility, and efficiency.
A network interface controller (NIC) capable of efficient management of non-idempotent operations is provided. The NIC that can be equipped with a network interface, storage management logic block, and an operation management logic block. During operation, the network interface can receive a request for an operation from a remote device. The storage management logic block can store outcomes of operation executed by the NIC in a local data structure. The operation management logic block can determine whether the NIC has previously executed the operation. If the NIC has previously executed the operation, the operation management logic block can obtain an outcome of the operation from the data structure and generate a response comprising the obtained outcome for responding to the request.
In the figures, like reference numerals refer to the same figure elements.
Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Thus, the present invention is not limited to the embodiments shown.
Overview
The present disclosure describes systems and methods that facilitate dynamic management for non-idempotent operations in a network interface controller (NIC). The NIC allows a host to communicate with a data-driven network.
The embodiments described herein solve the problem of ensuring proper execution of remotely-requested non-idempotent operations by (i) storing the outcome (or result) of the non-idempotent operations, which can be issued from a remote source, at a target NIC until acknowledged from the source, and (ii) upon receiving a request for an already-executed operation from the source, generating a response with the stored outcome. In this way, the NIC may avoid re-execution of a non-idempotent operation even if the source reissues the request.
During operation, an application, which may run on a source device of a NIC, can request a data operation (e.g., a “GET” or a “PUT” command of remote direct memory access (RDMA)) for a memory location of a remote target device. The NIC of the target device can receive the request, facilitate the execution of the operation, and send a response with the outcome of the execution. Examples of an outcome can include, but are not limited to, one or more values generated from a computation associated with the operation, an indicator that indicates successful or unsuccessful execution of the operation, a memory location or index associated with the operation, and information indicating the state of a data structure based on the execution of the operation on the data structure. The NICs of the source and target devices can be referred to as the source and target NICs, respectively. The operation can be an idempotent or a non-idempotent operation. An idempotent operation may be executed more than once without causing an error. On the other hand, a non-idempotent operation can be executed once. Executing a non-idempotent operation more than once may cause an error.
Typically, RDMA operations may include more non-idempotent operations than idempotent operations. Examples of non-idempotent operations can include, but are not limited to atomic memory operations, adding data to a queue, and indicating the completion of an operation. Since RDMA operations can be issued from a source device and transferred across a switch fabric to a target device, these operations are executed based on a request-response communication protocol between the source and target NICs. Under such circumstances, if a source NIC issues a request for an operation and does not receive a response, either the request or the response can be lost (e.g., due to packet loss in the switch fabric). For non-idempotent operations, such a loss may cause the source NIC to determine that operation has not been performed.
However, the source NIC may not distinguish whether the request or the response is lost. As a result, the source NIC may not be able to determine whether the target has already executed the operation. Consequently, the source NIC may reissue the request for the operation. Upon receiving the reissued request, the target NIC may re-execute the operation (e.g., if the response has been lost). Repeating the execution of a non-idempotent operation may cause an error. For example, if the operation is an enqueue operation, repeating the execution can cause the target NIC to erroneously enter an additional element in a queue.
To solve this problem, the source NIC can generate an indicator that indicates whether a requested operation is a non-idempotent operation. The source NIC can then include the request in a packet and send the packet to a target NIC via a switch fabric. The source NIC can include the indicator in the request (e.g., as a parameter of the request) or the packet (e.g., in the header of the packet). Upon receiving the request, the target NIC can determine that the requested operation is a non-idempotent operation based on the indicator. The target NIC can then store an indicator, which can be the received indicator or a locally generated one, indicating that the request is for a non-idempotent operation. The target NIC can also store the outcome of the operation in a local data structure. The target NIC can then generate a response based on the outcome, include the response in a packet, and send the packet to the source NIC.
If the target NIC receives a request for the same operation, the target NIC can determine that the request has been repeated by inspecting the stored outcomes. Accordingly, the target NIC can determine that the response sent to the source NIC may have been lost. Consequently, the target NIC can obtain the stored outcome from the data structure and return a response with the stored outcome, thereby avoiding the repetition of a non-idempotent operation. When the source NIC receives the response, the source NIC can send an acknowledgment piggybacked in a subsequent request message. Upon receiving the acknowledgment, the target NIC may remove the outcome from the data structure. The operation can be part of a sequence of operations. The source NIC can then use cumulative acknowledgment for a set of sequential responses. The target NIC may clear a corresponding set of outcomes based on the cumulative acknowledgment.
One embodiment of the present invention provides a NIC that can be equipped with a network interface, storage management logic block, and an operation management logic block. During operation, the network interface can receive a request for an operation from a remote device. The storage management logic block can store, in a local data structure, outcome of operations executed by the NIC. The operation management logic block can determine whether the NIC has previously executed the operation. If the NIC has previously executed the operation, the operation management logic block can obtain an outcome of the operation from the data structure and generate a response comprising the obtained outcome for responding to the request.
In a variation on this embodiment, the operation management logic block can determine whether the operation has been previously executed based on a sequence number of the operation and an expected sequence number.
In a variation on this embodiment, the operation management logic block can determine whether the operation is a non-idempotent operation based on an indicator in the request.
In a variation on this embodiment, if the operation has previously not been executed, the operation management logic block can execute the operation to generate the outcome.
In a further variation, the storage management logic block can store the generated outcome in the data structure.
In a variation on this embodiment, the storage management logic block may identify an acknowledgment associated with a sequence number in the request and remove a set of outcomes from the data structure based on the acknowledgment.
In a variation on this embodiment, the operation is in a set of sequential operations, which should be executed in order.
In a variation on this embodiment, the operation corresponds to an RDMA command.
In this disclosure, the description in conjunction with
Exemplary NIC Architecture
In some embodiments, HI 210 can be a peripheral component interconnect (PCI) or a peripheral component interconnect express (PCIe) interface. HI 210 can be coupled to a host via a host connection 201, which can include N (e.g., N can be 16 in some chips) PCle Gen 4 lanes capable of operating at signaling rates up to 25 Gbps per lane. HNI 210 can facilitate a high-speed network connection 203, which can communicate with a link in switch fabric 100 of
NIC 202 can support one or more of: point-to-point message passing based on Message Passing Interface (MPI), remote memory access (RMA) operations, offloading and progression of bulk data collective operations, and Ethernet packet processing. When the host issues an MPI message, NIC 202 can match the corresponding message type. Furthermore, NIC 202 can implement both eager protocol and rendezvous protocol for MPI, thereby offloading the corresponding operations from the host.
Furthermore, the RMA operations supported by NIC 202 can include PUT, GET, and Atomic Memory Operations (AMO). NIC 202 can provide reliable transport. For example, if NIC 202 is a source NIC, NIC 202 can provide a retry mechanism for idempotent operations. Furthermore, connection-based error detection and retry mechanism can be used for ordered operations that may manipulate a target state. The hardware of NIC 202 can maintain the state necessary for the retry mechanism. In this way, NIC 202 can remove the burden from the host (e.g., the software). The policy that dictates the retry mechanism can be specified by the host via the driver software, thereby ensuring flexibility in NIC 202.
Furthermore, NIC 202 can facilitate triggered operations, a general-purpose mechanism for offloading, and progression of dependent sequences of operations, such as bulk data collectives. NIC 202 can support an application programming interface (API) (e.g., libfabric API) that facilitates fabric communication services provided by switch fabric 100 of
NIC 202 can include a Command Queue (CQ) unit 230. CQ unit 230 can be responsible for fetching and issuing host side commands. CQ unit 230 can include command queues 232 and schedulers 234. Command queues 232 can include two independent sets of queues for initiator commands (PUT, GET, etc.) and target commands (Append, Search, etc.), respectively. Command queues 232 can be implemented as circular buffers maintained in the memory of NIC 202. Applications running on the host can write to command queues 232 directly. Schedulers 234 can include two separate schedulers for initiator commands and target commands, respectively. The initiator commands are sorted into flow queues 236 based on a hash function. One of flow queues 236 can be allocated to a unique flow. Furthermore, CQ unit 230 can further include a triggered operations module (or logic block) 238, which is responsible for queuing and dispatching triggered commands.
Outbound transfer engine (OXE) 240 can pull commands from flow queues 236 in order to process them for dispatch. OXE 240 can include an address translation request unit (ATRU) 244 that can send address translation requests to address translation unit (ATU) 212. ATU 212 can provide virtual to physical address translation on behalf of different engines, such as OXE 240, inbound transfer engine (IXE) 250, and event engine (EE) 216. ATU 212 can maintain a large translation cache 214. ATU 212 can either perform translation itself or may use host-based address translation services (ATS). OXE 240 can also include message chopping unit (MCU) 246, which can fragment a large message into packets of sizes corresponding to a maximum transmission unit (MTU). MCU 246 can include a plurality of MCU modules. When an MCU module becomes available, the MCU module can obtain the next command from an assigned flow queue. The received data can be written into data buffer 242. The MCU module can then send the packet header, the corresponding traffic class, and the packet size to traffic shaper 248. Shaper 248 can determine which requests presented by MCU 246 can proceed to the network.
Subsequently, the selected packet can be sent to packet and connection tracking (PCT) 270. PCT 270 can store the packet in a queue 274. PCT 270 can also maintain state information for outbound commands and update the state information as responses are returned. PCT 270 can also maintain packet state information (e.g., allowing responses to be matched to requests), message state information (e.g., tracking the progress of multi-packet messages), initiator completion state information, and retry state information (e.g., maintaining the information required to retry a command if a request or response is lost). If a response is not returned within a threshold time, the corresponding command can be stored in retry buffer 272. PCT 270 can facilitate connection management for initiator and target commands based on source tables 276 and target tables 278, respectively. For example, PCT 270 can update its source tables 276 to track the necessary state for reliable delivery of the packet and message completion notification. PCT 270 can forward outgoing packets to HNI 220, which stores the packets in outbound queue 222.
NIC 202 can also include an IXE 250, which provides packet processing if NIC 202 is a target or a destination. IXE 250 can obtain the incoming packets from HNI 220. Parser 256 can parse the incoming packets and pass the corresponding packet information to a List Processing Engine (LPE) 264 or a Message State Table (MST) 266 for matching. LPE 264 can match incoming messages to buffers. LPE 264 can determine the buffer and start address to be used by each message. LPE 264 can also manage a pool of list entries 262 used to represent buffers and unexpected messages. MST 266 can store matching results and the information required to generate target side completion events. MST 266 can be used by unrestricted operations, including multi-packet PUT commands, and single-packet and multi-packet GET commands.
Subsequently, parser 256 can store the packets in packet buffer 254. IXE 250 can obtain the results of the matching for conflict checking. DMA write and AMO module 252 can then issue updates to the memory generated by write and AMO operations. If a packet includes a command that generates target side memory read operations (e.g., a GET response), the packet can be passed to the OXE 240. NIC 202 can also include an EE 216, which can receive requests to generate event notifications from other modules or units in NIC 202. An event notification can specify that either a fill event or a counting event is generated. EE 216 can manage event queues, located within host processor memory, to which it writes full events. EE 216 can forward counting events to CQ unit 230.
Dynamic Operations Management in NIC
Suppose that operation 350 is a non-idempotent operation. Since request 312 can be issued from device 302 and transferred across switch fabric 320 to device 304, operation 350 is executed based on a request-response communication protocol between devices 302 and 304. Under such circumstances, if device 302 issues request 312 and does not receive response 314, either request 312 or response 314 can be lost (e.g., due to packet loss in switch fabric 320). Such a loss may cause device 302 to determine that operation has not been performed. Since operation 350 can be a non-idempotent operation, device 302 may determine that operation 350 should be performed.
Device 302 may not distinguish whether request 312 or response 314 is lost. As a result, device 302 may not be able to determine whether operation 350 has been executed by device 304. Hence, device 302 may reissue request 312 for operation 350 even if device 304 has already executed operation 350. Consequently, upon receiving reissued request 312, device 304 may re-execute operation 350. Repeating the execution of non-idempotent operation 350 may cause an error. For example, if operation 350 is an enqueue operation, re-execution of operation 350 can cause device 304 to erroneously enter an additional element in a queue.
To solve this problem, NIC 310 can generate an indicator that indicates whether operation 350 is a non-idempotent operation. NIC 310 can then include request 312 in a packet and send the packet to NIC 202 via switch fabric 320. NIC 310 can include the indicator in request 312 or the packet. Upon receiving request 312, NIC 202 can determine that operation 350 is a non-idempotent operation based on the indicator. NIC 202 can then store an indicator, which can be the received indicator or a locally generated one, indicating that request 312 is for a non-idempotent operation. NIC 202 can also store outcome (or result) 336 of operation 350 in a local data structure 330. Data structure 330 can be referred to as a target result store (TRS). TRS 330 can be in target tables 278 of PCT 270 of NIC 202.
NIC 202 can then generate response 314 based on outcome 336, include response 314 in a packet, and sends the packet to NIC 302. If NIC 202 receives request 312 again, NIC 202 can determine that request 312 has been repeated by inspecting a sequence number of operation 350 and an expected sequence number. For example, if operation 350 is repeated, the sequence number of operation 350 can be smaller than the expected sequence number (e.g., between the sequence number of the last acknowledged response and the sequence number of the next expected new request). Accordingly, NIC 202 can determine that response 314 sent to NIC 310 may have been lost. Consequently, NIC 202 can obtain outcome 336 from TRS 330 and return response 314 with outcome 336. In this way, NIC 202 can reissue response 314 without repeating non-idempotent operation 350.
In some embodiments, operation 350 can be part of a set of ordered operations that should be executed sequentially. NIC 310 can include a sequence number in request 312 indicating the order of operation 350. Furthermore, NIC 310 can send an acknowledgment piggybacked request 312 for operations that have been successfully responded back to NIC 310. For example, TRS 330 can store outcomes 332 and 334 of operations that have been executed prior to the execution of operation 350. Upon receiving outcomes 332 and 334 from NIC 202, NIC 310 can include an acknowledgment for outcome 334.
Since the operations should be executed in order, the acknowledgment can cumulatively acknowledge outcomes 332 and 334. In other words, the acknowledgment can instruct NIC 202 to clear all outcomes up to outcome 334 from TRS 330. In the same way, when NIC 310 receives response 314, NIC 312 can send an acknowledgment piggybacked in a subsequent request message. Upon receiving the acknowledgment, NIC 202 may remove outcome 336 from TRS 330.
If the operation is an idempotent operation (operation 454) or the operation is not a repeat operation (operation 460), the NIC can execute the operation to obtain an outcome and store the outcome in the TRS (operation 462). On the other hand, if the operation is a repeat operation (e.g., the sequence number of the operation is smaller than the expected sequence number), the NIC can obtain the outcome from the TRS (operation 466). Upon obtaining the outcome (operation 462 or 466), the NIC can include the outcome in a packet and forward the packet to the remote NIC (operation 464).
Exemplary Computer System
Computer system 550 can be equipped with a host interface coupling a NIC 520 that facilitates efficient data request management. NIC 520 can provide one or more HNIs to computer system 550. NIC 520 can be coupled to a switch 502 via one of the HNIs. NIC 520 can include a PCT logic block 530, as described in conjunction with
PCT logic block 530 can also include an TRS logic block 536 that can store the outcome of the execution of an operation in a local data structure (e.g., in memory device 554). TRS logic block 536 can remove (or clear) outcomes from the data structure based on cumulative acknowledgments. Operation logic block 534 can also determine whether an outcome of an operation is already stored in the data structure. If the outcome is already in the data structure, operation logic block 534 may obtain the outcome from the data structure instead of executing the operation. Upon generating the outcome, NIC 520 can include the outcome in a packet and forward the packet to the source NIC.
In summary, the present disclosure describes a NIC that facilitates efficient management of non-idempotent operations. The NIC can be equipped with a network interface, storage management logic block, and an operation management logic block. During operation, the network interface can receive a request for an operation from a remote device. The storage management logic block can store, in a local data structure, outcome of operations executed by the NIC. The operation management logic block can determine whether the NIC has previously executed the operation. If the NIC has previously executed the operation, the operation management logic block can obtain an outcome of the operation from the data structure and generate a response comprising the obtained outcome for responding to the request.
The methods and processes described above can be performed by hardware logic blocks, modules, or apparatus. The hardware logic blocks, modules, logic blocks, or apparatus can include, but are not limited to, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), dedicated or shared processors that execute a piece of code at a particular time, and other programmable-logic devices now known or later developed. When the hardware logic blocks, modules, or apparatus are activated, they perform the methods and processes included within them.
The methods and processes described herein can also be embodied as code or data, which can be stored in a storage device or computer-readable storage medium. When a processor reads and executes the stored code or data, the processor can perform these methods and processes.
The foregoing descriptions of embodiments of the present invention have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the present invention to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. Additionally, the above disclosure is not intended to limit the present invention. The scope of the present invention is defined by the appended claims.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/US2020/024304 | 3/23/2020 | WO |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2020/236294 | 11/26/2020 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5138615 | Lamport et al. | Aug 1992 | A |
5457687 | Newman | Oct 1995 | A |
5937436 | Watkins | Aug 1999 | A |
5960178 | Cochinwala et al. | Sep 1999 | A |
5983332 | Watkins | Nov 1999 | A |
6112265 | Harriman et al. | Aug 2000 | A |
6246682 | Roy et al. | Jun 2001 | B1 |
6493347 | Sindhu et al. | Dec 2002 | B2 |
6545981 | Garcia et al. | Apr 2003 | B1 |
6633580 | Toerudbakken et al. | Oct 2003 | B1 |
6714553 | Poole et al. | Mar 2004 | B1 |
6728211 | Peris et al. | Apr 2004 | B1 |
6732212 | Sugahara | May 2004 | B2 |
6735173 | Lenoski et al. | May 2004 | B1 |
6894974 | Aweva et al. | May 2005 | B1 |
7023856 | Washabaugh et al. | Apr 2006 | B1 |
7133940 | Blightman et al. | Nov 2006 | B2 |
7218637 | Best et al. | May 2007 | B1 |
7269180 | Bly et al. | Sep 2007 | B2 |
7337285 | Tanoue | Feb 2008 | B2 |
7397797 | Eri et al. | Jul 2008 | B2 |
7430559 | Lomet | Sep 2008 | B2 |
7464174 | Ngai | Dec 2008 | B1 |
7483442 | Torudbakken et al. | Jan 2009 | B1 |
7562366 | Pope et al. | Jul 2009 | B2 |
7593329 | Kwan et al. | Sep 2009 | B2 |
7596628 | Aloni et al. | Sep 2009 | B2 |
7620791 | Wentzlaff et al. | Nov 2009 | B1 |
7633869 | Morris et al. | Dec 2009 | B1 |
7639616 | Manula et al. | Dec 2009 | B1 |
7734894 | Wentzlaff et al. | Jun 2010 | B1 |
7774461 | Tanaka et al. | Aug 2010 | B2 |
7782869 | Chitlur Srinivasa | Aug 2010 | B1 |
7796579 | Bruss | Sep 2010 | B2 |
7856026 | Finan et al. | Dec 2010 | B1 |
7933282 | Gupta et al. | Apr 2011 | B1 |
7953002 | Opsasnick | May 2011 | B2 |
7975120 | Sabbatini, Jr. et al. | Jul 2011 | B2 |
8014278 | Subramanian et al. | Sep 2011 | B1 |
8023521 | Woo et al. | Sep 2011 | B2 |
8050180 | Judd | Nov 2011 | B2 |
8077606 | Litwack | Dec 2011 | B1 |
8103788 | Miranda | Jan 2012 | B1 |
8160085 | Voruganti et al. | Apr 2012 | B2 |
8175107 | Yalagandula et al. | May 2012 | B1 |
8249072 | Sugumar et al. | Aug 2012 | B2 |
8281013 | Mundkur et al. | Oct 2012 | B2 |
8352727 | Chen et al. | Jan 2013 | B2 |
8353003 | Noehring et al. | Jan 2013 | B2 |
8443151 | Tang et al. | May 2013 | B2 |
8473783 | Andrade et al. | Jun 2013 | B2 |
8543534 | Alves et al. | Sep 2013 | B2 |
8619793 | Lavian et al. | Dec 2013 | B2 |
8626957 | Blumrich et al. | Jan 2014 | B2 |
8719543 | Kaminski et al. | May 2014 | B2 |
8811183 | Anand et al. | Aug 2014 | B1 |
8948175 | Bly et al. | Feb 2015 | B2 |
9001663 | Attar et al. | Apr 2015 | B2 |
9053012 | Northcott et al. | Jun 2015 | B1 |
9088496 | Vaidya et al. | Jul 2015 | B2 |
9178782 | Matthews et al. | Nov 2015 | B2 |
9208071 | Talagala et al. | Dec 2015 | B2 |
9218278 | Talagala et al. | Dec 2015 | B2 |
9231876 | Mir et al. | Jan 2016 | B2 |
9231888 | Bogdanski et al. | Jan 2016 | B2 |
9239804 | Kegel et al. | Jan 2016 | B2 |
9269438 | Nachimuthu et al. | Feb 2016 | B2 |
9276864 | Pradeep | Mar 2016 | B1 |
9286236 | Auernhammer et al. | Mar 2016 | B2 |
9436651 | Underwood et al. | Sep 2016 | B2 |
9455915 | Sinha et al. | Sep 2016 | B2 |
9460178 | Bashyam et al. | Oct 2016 | B2 |
9479426 | Munger et al. | Oct 2016 | B2 |
9496991 | Plamondon et al. | Nov 2016 | B2 |
9544234 | Markine | Jan 2017 | B1 |
9548924 | Pettit et al. | Jan 2017 | B2 |
9594521 | Blagodurov et al. | Mar 2017 | B2 |
9635121 | Mathew et al. | Apr 2017 | B2 |
9742855 | Shuler et al. | Aug 2017 | B2 |
9762488 | Previdi et al. | Sep 2017 | B2 |
9762497 | Kishore et al. | Sep 2017 | B2 |
9830273 | Bk et al. | Nov 2017 | B2 |
9838500 | Ilan et al. | Dec 2017 | B1 |
9853900 | Mula et al. | Dec 2017 | B1 |
9887923 | Chorafakis et al. | Feb 2018 | B2 |
10003544 | Liu et al. | Jun 2018 | B2 |
10009270 | Stark et al. | Jun 2018 | B1 |
10031857 | Menachem et al. | Jul 2018 | B2 |
10050896 | Yang et al. | Aug 2018 | B2 |
10061613 | Brooker et al. | Aug 2018 | B1 |
10063481 | Jiang et al. | Aug 2018 | B1 |
10089220 | Mckelvie et al. | Oct 2018 | B1 |
10169060 | Vincent et al. | Jan 2019 | B1 |
10178035 | Dillon | Jan 2019 | B2 |
10200279 | Aljaedi | Feb 2019 | B1 |
10218634 | Aldebert et al. | Feb 2019 | B2 |
10270700 | Burnette et al. | Apr 2019 | B2 |
10305772 | Zur et al. | May 2019 | B2 |
10331590 | Macnamara et al. | Jun 2019 | B2 |
10353833 | Hagspiel et al. | Jul 2019 | B2 |
10454835 | Contavalli et al. | Oct 2019 | B2 |
10498672 | Graham et al. | Dec 2019 | B2 |
10567307 | Fairhurst et al. | Feb 2020 | B2 |
10740243 | Benisty | Aug 2020 | B1 |
10802828 | Volpe et al. | Oct 2020 | B1 |
10817502 | Talagala et al. | Oct 2020 | B2 |
11416749 | Bshara et al. | Aug 2022 | B2 |
20010010692 | Sindhu et al. | Aug 2001 | A1 |
20010047438 | Forin | Nov 2001 | A1 |
20020152328 | Kagan et al. | Oct 2002 | A1 |
20020174279 | Wynne et al. | Nov 2002 | A1 |
20030016808 | Hu et al. | Jan 2003 | A1 |
20030041168 | Musoll | Feb 2003 | A1 |
20030091055 | Craddock et al. | May 2003 | A1 |
20030110455 | Baumgartner et al. | Jun 2003 | A1 |
20030174711 | Shankar | Sep 2003 | A1 |
20030223420 | Ferolito | Dec 2003 | A1 |
20040008716 | Stiliadis | Jan 2004 | A1 |
20040049580 | Boyd et al. | Mar 2004 | A1 |
20040059828 | Hooper et al. | Mar 2004 | A1 |
20040095882 | Hamzah et al. | May 2004 | A1 |
20040133634 | Luke et al. | Jul 2004 | A1 |
20040223452 | Santos et al. | Nov 2004 | A1 |
20050021837 | Haselhorst et al. | Jan 2005 | A1 |
20050047334 | Paul et al. | Mar 2005 | A1 |
20050088969 | Carlsen et al. | Apr 2005 | A1 |
20050091396 | Nilakantan et al. | Apr 2005 | A1 |
20050108444 | Flauaus et al. | May 2005 | A1 |
20050108518 | Pandya | May 2005 | A1 |
20050270974 | Mayhew | Dec 2005 | A1 |
20050270976 | Yang et al. | Dec 2005 | A1 |
20060023705 | Zoranovic et al. | Feb 2006 | A1 |
20060067347 | Naik et al. | Mar 2006 | A1 |
20060075480 | Noehring et al. | Apr 2006 | A1 |
20060173970 | Pope et al. | Aug 2006 | A1 |
20060174251 | Pope et al. | Aug 2006 | A1 |
20070061433 | Reynolds et al. | Mar 2007 | A1 |
20070198804 | Moyer | Aug 2007 | A1 |
20070242611 | Archer et al. | Oct 2007 | A1 |
20080013453 | Chiang et al. | Jan 2008 | A1 |
20080013549 | Okagawa et al. | Jan 2008 | A1 |
20080071757 | Ichiriu et al. | Mar 2008 | A1 |
20080084864 | Archer et al. | Apr 2008 | A1 |
20080091915 | Moertl et al. | Apr 2008 | A1 |
20080126553 | Boucher et al. | May 2008 | A1 |
20080147881 | Krishnamurthy et al. | Jun 2008 | A1 |
20080159138 | Shepherd et al. | Jul 2008 | A1 |
20080253289 | Naven et al. | Oct 2008 | A1 |
20090003212 | Kwan et al. | Jan 2009 | A1 |
20090010157 | Holmes et al. | Jan 2009 | A1 |
20090013175 | Elliott | Jan 2009 | A1 |
20090055496 | Garg et al. | Feb 2009 | A1 |
20090092046 | Naven et al. | Apr 2009 | A1 |
20090141621 | Fan et al. | Jun 2009 | A1 |
20090198958 | Arimilli et al. | Aug 2009 | A1 |
20090259713 | Blumrich et al. | Oct 2009 | A1 |
20090285222 | Hoover et al. | Nov 2009 | A1 |
20100061241 | Sindhu et al. | Mar 2010 | A1 |
20100220595 | Petersen | Sep 2010 | A1 |
20100274876 | Kagan et al. | Oct 2010 | A1 |
20100302942 | Shankar et al. | Dec 2010 | A1 |
20100316053 | Miyoshi et al. | Dec 2010 | A1 |
20110051724 | Scott et al. | Mar 2011 | A1 |
20110099326 | Jung et al. | Apr 2011 | A1 |
20110110383 | Yang et al. | May 2011 | A1 |
20110128959 | Bando et al. | Jun 2011 | A1 |
20110158096 | Leung et al. | Jun 2011 | A1 |
20110158248 | Vorunganti et al. | Jun 2011 | A1 |
20110164496 | Loh et al. | Jul 2011 | A1 |
20110173370 | Jacobs et al. | Jul 2011 | A1 |
20110264822 | Ferguson et al. | Oct 2011 | A1 |
20110320724 | Mejdrich et al. | Dec 2011 | A1 |
20120093505 | Yeap et al. | Apr 2012 | A1 |
20120102506 | Hopmann et al. | Apr 2012 | A1 |
20120117423 | Andrade et al. | May 2012 | A1 |
20120137075 | Vorbach | May 2012 | A1 |
20120144065 | Parker et al. | Jun 2012 | A1 |
20120147752 | Ashwood-Smith et al. | Jun 2012 | A1 |
20120170462 | Sinha | Jul 2012 | A1 |
20120170575 | Mehra | Jul 2012 | A1 |
20120213118 | Lindsay et al. | Aug 2012 | A1 |
20120250512 | Jagadeeswaran et al. | Oct 2012 | A1 |
20120287821 | Godfrey et al. | Nov 2012 | A1 |
20120300669 | Zahavi | Nov 2012 | A1 |
20120307838 | Manula et al. | Dec 2012 | A1 |
20120314707 | Epps et al. | Dec 2012 | A1 |
20130010636 | Regula | Jan 2013 | A1 |
20130039169 | Schlansker et al. | Feb 2013 | A1 |
20130060944 | Archer et al. | Mar 2013 | A1 |
20130103777 | Kagan et al. | Apr 2013 | A1 |
20130121178 | Mainaud et al. | May 2013 | A1 |
20130136090 | Liu et al. | May 2013 | A1 |
20130194927 | Yamaguchi et al. | Aug 2013 | A1 |
20130203422 | Masputra et al. | Aug 2013 | A1 |
20130205002 | Wang et al. | Aug 2013 | A1 |
20130208593 | Nandagopal | Aug 2013 | A1 |
20130290673 | Archer et al. | Oct 2013 | A1 |
20130301645 | Bogdanski et al. | Nov 2013 | A1 |
20130304988 | Totolos et al. | Nov 2013 | A1 |
20130311525 | Neerincx et al. | Nov 2013 | A1 |
20130329577 | Suzuki et al. | Dec 2013 | A1 |
20130336164 | Yang et al. | Dec 2013 | A1 |
20140003427 | Nishi et al. | Jan 2014 | A1 |
20140019661 | Hormuth et al. | Jan 2014 | A1 |
20140032695 | Michels et al. | Jan 2014 | A1 |
20140036680 | Lih et al. | Feb 2014 | A1 |
20140064082 | Yeung et al. | Mar 2014 | A1 |
20140095753 | Crupnicoff et al. | Apr 2014 | A1 |
20140098675 | Frost et al. | Apr 2014 | A1 |
20140119367 | Han et al. | May 2014 | A1 |
20140122560 | Ramey et al. | May 2014 | A1 |
20140133292 | Yamatsu et al. | May 2014 | A1 |
20140136646 | Tamir et al. | May 2014 | A1 |
20140169173 | Naouri et al. | Jun 2014 | A1 |
20140207881 | Nussle et al. | Jul 2014 | A1 |
20140211804 | Makikeni et al. | Jul 2014 | A1 |
20140226488 | Shamis et al. | Aug 2014 | A1 |
20140241164 | Cociglio et al. | Aug 2014 | A1 |
20140301390 | Scott et al. | Oct 2014 | A1 |
20140307554 | Basso et al. | Oct 2014 | A1 |
20140328172 | Kumar et al. | Nov 2014 | A1 |
20140347997 | Bergamasco et al. | Nov 2014 | A1 |
20140362698 | Arad | Dec 2014 | A1 |
20140369360 | Carlstrom | Dec 2014 | A1 |
20150003247 | Mejia et al. | Jan 2015 | A1 |
20150006849 | Xu et al. | Jan 2015 | A1 |
20150026361 | Matthews et al. | Jan 2015 | A1 |
20150029848 | Jain | Jan 2015 | A1 |
20150055476 | Decusatis et al. | Feb 2015 | A1 |
20150055661 | Boucher et al. | Feb 2015 | A1 |
20150067095 | Gopal et al. | Mar 2015 | A1 |
20150089495 | Persson et al. | Mar 2015 | A1 |
20150103667 | Elias et al. | Apr 2015 | A1 |
20150124826 | Edsall et al. | May 2015 | A1 |
20150146527 | Kishore et al. | May 2015 | A1 |
20150161064 | Pope | Jun 2015 | A1 |
20150180782 | Rimmer et al. | Jun 2015 | A1 |
20150186318 | Kim et al. | Jul 2015 | A1 |
20150193262 | Archer et al. | Jul 2015 | A1 |
20150195388 | Snyder et al. | Jul 2015 | A1 |
20150208145 | Parker et al. | Jul 2015 | A1 |
20150220449 | Stark et al. | Aug 2015 | A1 |
20150220481 | Tanimoto | Aug 2015 | A1 |
20150244617 | Nakil et al. | Aug 2015 | A1 |
20150244804 | Warfield et al. | Aug 2015 | A1 |
20150263955 | Talaski et al. | Sep 2015 | A1 |
20150263994 | Haramaty et al. | Sep 2015 | A1 |
20150288626 | Aybay | Oct 2015 | A1 |
20150365337 | Pannell | Dec 2015 | A1 |
20150370586 | Cooper et al. | Dec 2015 | A1 |
20160006664 | Sabato et al. | Jan 2016 | A1 |
20160012002 | Arimilli et al. | Jan 2016 | A1 |
20160028613 | Haramaty et al. | Jan 2016 | A1 |
20160065455 | Wang et al. | Mar 2016 | A1 |
20160094450 | Ghanwani et al. | Mar 2016 | A1 |
20160134559 | Abel et al. | May 2016 | A1 |
20160142318 | Beecroft | May 2016 | A1 |
20160154756 | Dodson et al. | Jun 2016 | A1 |
20160205023 | Janardhanan | Jul 2016 | A1 |
20160226797 | Aravinthan et al. | Aug 2016 | A1 |
20160254991 | Eckert et al. | Sep 2016 | A1 |
20160259394 | Ragavan | Sep 2016 | A1 |
20160283422 | Crupnicoff et al. | Sep 2016 | A1 |
20160285545 | Schmidtke et al. | Sep 2016 | A1 |
20160285677 | Kashyap et al. | Sep 2016 | A1 |
20160294694 | Parker et al. | Oct 2016 | A1 |
20160294926 | Zur et al. | Oct 2016 | A1 |
20160301610 | Amit et al. | Oct 2016 | A1 |
20160342567 | Tsirkin | Nov 2016 | A1 |
20160381189 | Caulfield et al. | Dec 2016 | A1 |
20170024263 | Verplanken | Jan 2017 | A1 |
20170039063 | Gopal et al. | Feb 2017 | A1 |
20170041239 | Goldenberg et al. | Feb 2017 | A1 |
20170048144 | Liu | Feb 2017 | A1 |
20170054633 | Underwood et al. | Feb 2017 | A1 |
20170091108 | Arellano et al. | Mar 2017 | A1 |
20170093770 | Flajslik et al. | Mar 2017 | A1 |
20170097840 | Bridgers | Apr 2017 | A1 |
20170103108 | Datta et al. | Apr 2017 | A1 |
20170118090 | Pettit et al. | Apr 2017 | A1 |
20170118098 | Littlejohn et al. | Apr 2017 | A1 |
20170153852 | Ma et al. | Jun 2017 | A1 |
20170237671 | Rimmer et al. | Aug 2017 | A1 |
20170250914 | Caulfield et al. | Aug 2017 | A1 |
20170251394 | Johansson et al. | Aug 2017 | A1 |
20170270051 | Chen et al. | Sep 2017 | A1 |
20170272331 | Lissack | Sep 2017 | A1 |
20170286316 | Doshi et al. | Oct 2017 | A1 |
20170289066 | Haramaty et al. | Oct 2017 | A1 |
20170295098 | Watkins et al. | Oct 2017 | A1 |
20170324664 | Xu et al. | Nov 2017 | A1 |
20170371778 | Mckelvie et al. | Dec 2017 | A1 |
20180019948 | Patwardhan et al. | Jan 2018 | A1 |
20180026878 | Zahavi et al. | Jan 2018 | A1 |
20180077064 | Wang | Mar 2018 | A1 |
20180083868 | Cheng | Mar 2018 | A1 |
20180097645 | Rajagopalan et al. | Apr 2018 | A1 |
20180097912 | Chumbalkar et al. | Apr 2018 | A1 |
20180113618 | Chan et al. | Apr 2018 | A1 |
20180115469 | Erickson et al. | Apr 2018 | A1 |
20180131602 | Civanlar et al. | May 2018 | A1 |
20180131678 | Agarwal et al. | May 2018 | A1 |
20180152317 | Chang et al. | May 2018 | A1 |
20180152357 | Natham et al. | May 2018 | A1 |
20180191609 | Caulfield et al. | Jul 2018 | A1 |
20180191742 | Dawes | Jul 2018 | A1 |
20180198736 | Labonte et al. | Jul 2018 | A1 |
20180212876 | Bacthu et al. | Jul 2018 | A1 |
20180212902 | Steinmacher-Burow | Jul 2018 | A1 |
20180219804 | Graham et al. | Aug 2018 | A1 |
20180225238 | Karguth et al. | Aug 2018 | A1 |
20180234343 | Zdornov et al. | Aug 2018 | A1 |
20180254945 | Bogdanski et al. | Sep 2018 | A1 |
20180260324 | Marathe et al. | Sep 2018 | A1 |
20180278540 | Shalev et al. | Sep 2018 | A1 |
20180287928 | Levi et al. | Oct 2018 | A1 |
20180323898 | Dods | Nov 2018 | A1 |
20180335974 | Simionescu et al. | Nov 2018 | A1 |
20180341494 | Sood et al. | Nov 2018 | A1 |
20190007349 | Wang et al. | Jan 2019 | A1 |
20190018808 | Beard et al. | Jan 2019 | A1 |
20190036771 | Sharpless et al. | Jan 2019 | A1 |
20190042337 | Dinan et al. | Feb 2019 | A1 |
20190044809 | Willis et al. | Feb 2019 | A1 |
20190044827 | Ganapathi et al. | Feb 2019 | A1 |
20190044872 | Ganapathi et al. | Feb 2019 | A1 |
20190044875 | Murty et al. | Feb 2019 | A1 |
20190052327 | Motozuka et al. | Feb 2019 | A1 |
20190058663 | Song | Feb 2019 | A1 |
20190068501 | Schneider et al. | Feb 2019 | A1 |
20190095134 | Li | Mar 2019 | A1 |
20190104057 | Goel et al. | Apr 2019 | A1 |
20190108106 | Aggarwal et al. | Apr 2019 | A1 |
20190108332 | Glew et al. | Apr 2019 | A1 |
20190109791 | Mehra et al. | Apr 2019 | A1 |
20190140979 | Levi et al. | May 2019 | A1 |
20190146477 | Cella et al. | May 2019 | A1 |
20190196982 | Rozas et al. | Jun 2019 | A1 |
20190199646 | Singh et al. | Jun 2019 | A1 |
20190280978 | Schmatz et al. | Sep 2019 | A1 |
20190294575 | Dennison et al. | Sep 2019 | A1 |
20190332314 | Zhang et al. | Oct 2019 | A1 |
20190361728 | Kumar et al. | Nov 2019 | A1 |
20190379610 | Srinivasan et al. | Dec 2019 | A1 |
20200145725 | Eberle | May 2020 | A1 |
20200177505 | Li | Jun 2020 | A1 |
20210152494 | Johnsen et al. | May 2021 | A1 |
20210263779 | Haghighat et al. | Aug 2021 | A1 |
20210334206 | Colgrove et al. | Oct 2021 | A1 |
20210377156 | Michael et al. | Dec 2021 | A1 |
20220197831 | Gorodetsky et al. | Jun 2022 | A1 |
20220210058 | Bataineh et al. | Jun 2022 | A1 |
20220217101 | Yefet | Jul 2022 | A1 |
20220329521 | Roweth et al. | Oct 2022 | A1 |
Number | Date | Country |
---|---|---|
101729609 | Jun 2010 | CN |
102932203 | Feb 2013 | CN |
110324249 | Oct 2019 | CN |
110601888 | Dec 2019 | CN |
2187576 | May 2010 | EP |
2219329 | Aug 2010 | EP |
2947832 | Nov 2015 | EP |
3445006 | Feb 2019 | EP |
2003-244196 | Aug 2003 | JP |
3459653 | Oct 2003 | JP |
10-2012-0062864 | Jun 2012 | KR |
10-2012-0082739 | Jul 2012 | KR |
10-2014-0100529 | Aug 2014 | KR |
10-2015-0026939 | Mar 2015 | KR |
10-2015-0104056 | Sep 2015 | KR |
10-2017-0110106 | Oct 2017 | KR |
10-1850749 | Apr 2018 | KR |
2001069851 | Sep 2001 | WO |
0247329 | Jun 2002 | WO |
2003019861 | Mar 2003 | WO |
2004001615 | Dec 2003 | WO |
2005094487 | Oct 2005 | WO |
2007034184 | Mar 2007 | WO |
2009010461 | Jan 2009 | WO |
2009018232 | Feb 2009 | WO |
2014092780 | Jun 2014 | WO |
2014137382 | Sep 2014 | WO |
2014141005 | Sep 2014 | WO |
2018004977 | Jan 2018 | WO |
2018046703 | Mar 2018 | WO |
2019072072 | Apr 2019 | WO |
Entry |
---|
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024304, dated Jul. 15, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US20/24340, dated Oct. 26, 2020, 9 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US20/24342, dated Oct. 27, 2020,10 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2020/024192, dated Oct. 23, 2020, 9 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2020/024221, dated Oct. 26, 2020, 9 pages. |
International Search Report cited in PCT/US2020/024170 dated Dec. 16, 2020; 3 pages. |
Maabi, S., et al.; “ERFAN: Efficient reconfigurable fault-tolerant deflection routing algorithm for 3-D Network-on-Chip” Sep. 6-9, 2016. |
Maglione-Mathey, G., et al.; “Scalable Deadlock-Free Deterministic Minimal-Path Routing Engine for InfiniBand-Based Dragonfly Networks”; Aug. 21, 2017; 15 pages. |
Mamidala, A.R., et al.; “Efficient Barrier and Allreduce on Infiniband clusters using multicast and adaptive algorithms” Sep. 20-23, 2004; 10 pages. |
Mammeri, Z; “Reinforcement Learning Based Routing in Networks: Review and Classification of Approaches”; Apr. 29, 2019; 35 pages. |
Mollah; M. A., et al.; “High Performance Computing Systems. Performance Modeling, Benchmarking, and Simulation 8th International Workshop”; Nov. 13, 2017. |
Open Networking Foundation; “OpenFlow Switch Specification”; Mar. 26, 2015; 283 pages. |
Prakash, P., et al.; “The TCP Outcast Problem: Exposing Unfairness in Data Center Networks”; 2011; 15 pages. |
Ramakrishnan, K., et al.; “The Addition of Explicit Congestion Notification (ECN) to IP”; Sep. 2001; 63 pages. |
Roth, P. C., et al.; “MRNet: A Software-Based Multicast/Reduction Network for Scalable Tools1”; Nov. 15-21, 2003; 16 pages. |
Silveira, J., et al.; “Preprocessing of Scenarios for Fast and Efficient Routing Reconfiguration in Fault-Tolerant NoCs” Mar. 4-6, 2015. |
Tsunekawa, K.; “Fair bandwidth allocation among LSPs for AF class accommodating TCP and UDP traffic in a Diffserv-capable MPLS network”; Nov. 17, 2005; 9 pages. |
Underwood, K.D., et al.; “A hardware acceleration unit for MPI queue processing”; Apr. 18, 2005; 10 pages. |
Wu, J.; “Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels” Feb. 2000; 11 pages. |
Xiang, D., et al.; “Fault-Tolerant Adaptive Routing in Dragonfly Networks”; Apr. 12, 2017; 15 pages. |
Xiang, D., et al.; “Deadlock-Free Broadcast Routing in Dragonfly Networks without Virtual Channels”, submission to IEEE transactions on Parallel and Distributed Systems, 2015, 15 pages. |
Awerbuch, B., et al.; “An On-Demand Secure Routing Protocol Resilient to Byzantine Failures”; Sep. 2002; 10 pages. |
Belayneh L.W., et al.; “Method and Apparatus for Routing Data in an Inter-Nodal Communications Lattice of a Massively Parallel Computer System by Semi-Randomly Varying Routing Policies for Different Packets”; 2019; 3 pages. |
Bhatele, A., et al.; “Analyzing Network Health and Congestion in Dragonfly-based Supercomputers”; May 23-27, 2016; 10 pages. |
Blumrich, M.A., et al.; “Exploiting Idle Resources in a High-Radix Switch for Supplemental Storage”; Nov. 2018; 13 pages. |
Chang, F., et al.; “PVW: Designing Vir PVW: Designing Virtual World Ser orld Server Infr er Intiastructur astructure”; 2010; 8 pages. |
Chang, F., et al; “PVW: Designing Virtual World Server Infrastructure”; 2010; 8 pages. |
Chen, F., et al.; “Requirements for RoCEv3 Congestion Management”; Mar. 21, 2019; 8 pages. |
Cisco Packet Tracer; “packet-tracer;—ping”; https://www.cisco.com/c/en/us/td/docs/security/asa/asa-command-reference/l-R/cmdref2/p1 .html; 2017. |
Cisco; “Understanding Rapid Spanning Tree Protocol (802.1w)”; Aug. 1, 2017; 13 pages. |
Eardley, ED, P; “Pre-Congestion Notification (PCN) Architecture”; Jun. 2009; 54 pages. |
Escudero-Sahuquillo, J., et al.; “Combining Congested-Flow Isolation and Injection Throttling in HPC Interconnection Networks”; Sep. 13-16, 2011; 3 pages. |
Hong, Y.; “Mitigating the Cost, Performance, and Power Overheads Induced by Load Variations in Multicore Cloud Servers”; Fall 2013; 132 pages. |
Huawei; “The Lossless Network For Data Centers”; Nov. 7, 2017; 15 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024248, dated Jul. 8, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/024332, dated Jul. 8, 2020, 13 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24243, dated Jul. 9, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24253, dated Jul. 6, 2020, 12 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24256, dated Jul. 7, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24257, dated Jul. 7, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24258, dated Jul. 7, 2020, 9 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24259, dated Jul. 9, 2020, 13 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24260, dated Jul. 7, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24268, dated Jul. 9, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24269, dated Jul. 9, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US20/24339, dated Jul. 8, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024125, dated Jul. 10, 2020, 5 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024129, dated Jul. 10, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024237, dated Jul. 14, 2020, 5 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024239, dated Jul. 14, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024241, dated Jul. 14, 2020, 13 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024242, dated Jul. 6, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024244, dated Jul. 13, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024245, dated Jul. 14, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024246, dated Jul. 14, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024250, dated Jul. 14, 2020, 12 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024254, dated Jul. 13, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024262, dated Jul. 13, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024266, dated Jul. 9, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024270, dated Jul. 10, 2020, 13 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024271, dated Jul. 9, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024272, dated Jul. 9, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024276, dated Jul. 13, 2020, 9 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024311, dated Jul. 17, 2020, 8 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024321, dated Jul. 9, 2020, 9 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024324, dated Jul. 14, 2020, 10 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024327, dated Jul. 10, 2020, 15 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/24158, dated Jul. 6, 2020, 18 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/24251, dated Jul. 6, 2020, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/US2020/24267, dated Jul. 6, 2020, 9 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US20/24303, dated Oct. 21, 2020, 9 pages. |
Ramakrishnan et al., RFC 3168, “The addition of Explicit Congestion Notification (ECN) to IP”, Sep. 2001 (Year: 2001). |
Number | Date | Country | |
---|---|---|---|
20220200897 A1 | Jun 2022 | US |
Number | Date | Country | |
---|---|---|---|
62852203 | May 2019 | US | |
62852273 | May 2019 | US | |
62852289 | May 2019 | US |