Intel Corporation

Roberto Penaranda Cebrian

Malek Musleh

Robert G Southworth

Pedro Yebenes Segura

Rong Pan

Allister Alemania

Arvind Srinivasan

Changhoon Kim

Jeongkeun Lee

Francesc Guim Bernat

Sujoy Sen

Michael A Parker

Helia A Naeimi

Albert S Cheng

James Earl McCormick, Jr

Ramakrishna Huggahalli

Jonathan A Dama

Gaspar Mora Porta

Karl S Papadantonakis

Anupama Kurpad

Gene Wu

Jim McCormick

Curt E Bruns

Examples described herein relate to a network interface device that is to adjust a transmission rate of packets based on a number of flows contributing to congestion and/or based on whether latency is increasing or decreasing. In some examples, adjusting the transmission rate of packets based on a number of flows contributing to congestion comprises adjust an additive increase (AI) parameter based on the number of flows contributing to congestion. In some examples, latency is based on a measured roundtrip time and a baseline roundtrip time.

Congestion control

Examples described herein relate to a network agent, when operational, to: receive a packet, determine transmit rate-related information for a sender network device based at least on operational and telemetry information accumulated in the received packet, and transmit the transmit rate-related information to the sender network device. In some examples, the network agent includes a network device coupled to a server, a server, or a network device. In some examples, the operational and telemetry information comprises: telemetry information generated by at least one network device in a path from the sender network device to the network agent.

Receiver-based precision congestion control

Examples described herein relate to a switch, when operational, that is configured to receive in a packet an indicator of number of remaining bytes in a flow and to selectively send a congestion message based on a fullness level of a buffer and indication of remainder of the flow. In some examples, the indicator is received in an Internet Protocol version 4 consistent Options header field or Internet Protocol version 6 consistent Flow label field. In some examples, the congestion message comprises one or more of: an Explicit Congestion Control Notification (ECN), priority-based flow control (PFC), and/or in-band telemetry (INT). In some examples, to selectively send a congestion message to a transmitter based on a fullness level of a buffer that stored the packet and the number of remaining bytes in flow, the switch is to determine whether the buffer is large enough to store the remaining bytes in the flow.

Selective congestion notification by a network interface device

Methods for improving end-to-end congestion reaction using adaptive routing and congestion-hint based throttling for IP-routed datacenter networks and associated apparatus. In connection with forwarding packets between sending and receiving endpoints coupled to one or more networks, one or more network switches are configured to detect current or approaching congestion conditions, generate congestion notification packets (CNPs), and return the CNPs to sending endpoints. The CNPs may be routed using one or more adaptive routing mechanisms to forward the CNPs along non-congested paths or may be forwarded along a fastest path to a sender. The CNPs further may comprise meta-data including a flow identifier associated with a packet sent from an endpoint, a congestion level for the flow, and a timestamp. CNPs may comprise unreliable datagrams that may be received out-of-order, with the timestamps being used to determine whether CNPs should be disregarded at a switch along the forwarding path to the sending endpoint or at the sending endpoint. Endpoint network interfaces implement a congestion-CNP table storing entries associating congested flows with congestion levels.

Improving end-to-end congestion reaction using adaptive routing and congestion-hint based throttling for IP-routed datacenter networks

Examples are described herein that relate to a mesh in a switch fabric. The mesh can include one or more buses that permit operations (e.g., read, write, or responses) to continue in the same direction, drop off to a memory, drop off a bus to permit another operation to use the bus, or receive operations that are changing direction. A latency estimate can be determined at least for operations that drop off from a bus to permit another operation to use the bus or receive and channel operations that are changing direction. An operation with a highest latency estimate (e.g., time of traversing a mesh) can be permitted to use the bus, even causing another operation, that is not to change direction, to drop off the bus and re-enter later.

Shared memory mesh for switching

In some embodiments, the invention involves using a weighted arbiter switch to provide fairness in passing input streams through a plurality of input ports to an output port. The weighted arbiter switches may be combined in a hierarchical architecture to enable routing through many levels of switches. Each input port has an associated flow counter to count input stream traffic through the input port. An arbiter switch uses the flow counts and weights from arbiter switches at a lower level in the hierarchy to generate a fairly distributed routing of input streams through the output port. Other embodiments are described and claimed.

System and method to enable fairness on multi-level arbitrations for switch architectures

Growing community of inventors

Santa Clara, CA, United States of America

Roberto Penaranda Cebrian