Abstract: Systems and methods are provided for “on the fly” routing of data transmissions in the presence of errors. Switches can establish flow channels corresponding to flows in the network. In response to encountering a critical error on a network link along a transmission path, a switch can generate an error acknowledgement. The switch can transmit the error acknowledgements to ingress ports upstream from the network link via the plurality of flow channels. By transmitting the error acknowledgement, it indicates that the network link where the critical error was encountered is a failed link to ingress ports upstream from the failed link. Subsequently, each ingress port upstream from the failed link can dynamically update the path of the plurality of flows that are upstream from the failed link such that the plurality of flows that are upstream from the failed link are routed in a manner that avoids the failed link.

Abstract: In a network, a receiver receives from a transmitter a data frame comprising a transmitter credit count which indicates a total number of credits available at the transmitter. The system determines, based on the transmitter credit counts included in the consecutively received data frames, whether one or more data frames have been lost. In response to one or more data frames being lost, the system calculates a number of credits corresponding to the lost data frames. The system then determines a number of credits to be returned to the transmitter based at least on the lost data frames and credits released by the receiver, updates a receiver credit count by incrementing an instant receiver credit count by the number of credits to be returned to the transmitter, and transmits a credit-control frame to the transmitter, the credit-control frame comprising the number of to-be-returned credits and the updated receiver credit count.

Abstract: One aspect of the instant application provides a network node. The network node may include a packet-header parser to extract a plurality of header fields from a received packet, a hash logic unit to compute a hash value based on the plurality of extracted header fields, and a flow-identifying logic unit to associate the packet with a flow identifier (ID) based on the computed hash value. The flow ID facilitates subsequent network nodes along a path to the packet's destination to recognize the packet as belonging to a flow.

Abstract: One aspect of the instant application provides a system and method for extending a flow from a first network fabric into a second network fabric. During operation, the system may identify, at an egress edge node of the first network fabric, a flow to which a received packet belongs based on a first flow identifier associated with the packet. The egress edge node may forward the received packet to the second network fabric, where a respective node in the second network fabric may identify the flow based on a second flow identifier. The system may indicate to an upstream node of the forwarded packet exiting the first network fabric and keep the flow active within the first network fabric after all packets in the flow exit the first network fabric and until all packets arrive at a destination node.

Abstract: A system receives, by a network device in a first network fabric, a to be forwarded flow over a link aggregation group (LAG) comprising a plurality of physical ports aggregated as a single logical port. The system determines loads associated with the LAG ports and selects a first LAG port based on a first load associated with the first LAG port. The system forwards the flow on a first path over the selected first LAG port. The system stores a state of the flow, wherein the flow is forwarded in a second network fabric. The system receives, from the first LAG port, a redirect acknowledgment (ACK) indicating that the flow is to be considered as a candidate flow to be rerouted. The system selects the flow from a plurality of candidate flows to be rerouted and forwards the selected flow on a second path over a second LAG port.

Abstract: A system generates, by a network device operating as an intermediate network device, a load metric for a respective flow of a first set of received flows. The system sends, to a first ingress network device, a redirect acknowledgment (ACK) including the load metric for the respective flow in response to the load metric being greater than a load value. The system forwards, by the network device operating as a second ingress network device, a second set of flows. The system receives, from a plurality of intermediate network devices, redirect ACKs corresponding to a plurality of flows of the second set of flows. A respective redirect ACK includes a load metric for a corresponding flow of the plurality of flows. The system selects, from the flows based on a set of rerouting conditions, a first flow to be rerouted. The system reroutes the first flow to a new path.

Abstract: A system tracks, in a network device with multiple links, activity over a respective link for a predetermined amount of time. The activity comprises at least one of a number of idle periods or a duration of a respective idle period. The system divides a predetermined time interval into a number of bins. A bin is associated with a range of time. The system stores the tracked activity in data structure entries which each indicate the number of bins, a duration of time associated with a respective bin, and a count associated with the respective bin. The system indicates the tracked activity in the entry for the respective link by incrementing a count associated with a bin matching the duration of the respective idle period based on a first number of idle periods tracked for the matching duration. The system displays the stored tracked activity for the respective link.

Abstract: A system tracks, in a network device with multiple links, activity over a respective link for a predetermined amount of time. The activity comprises at least one of a number of idle periods or a duration of a respective idle period. The system divides a predetermined time interval into a number of bins. A bin is associated with a range of time. The system stores the tracked activity in data structure entries which each indicate the number of bins, a duration of time associated with a respective bin, and a count associated with the respective bin. The system indicates the tracked activity in the entry for the respective link by incrementing a count associated with a bin matching the duration of the respective idle period based on a first number of idle periods tracked for the matching duration. The system displays the stored tracked activity for the respective link.

Abstract: Systems and methods for dynamic buffer management in switches that facilitate a data-driven intelligent networking system are provided. The system can accommodate dynamic traffic with fast, effective congestion control while providing efficient use of internal input buffer space.

Abstract: Methods and systems are provided for controlling wide LAG and ECMP in a network. At the ingress edge of the network, a switch can identify packets as LAG or ECMP packets, and allow them to be forwarded through the switch fabric using multiple output ports or paths.

Abstract: A switch equipped with a reduction engine capable of being dynamically allocated in a network is provided. During operation, the reduction engine can be dynamically armed based on a multicast frame. As a result, the network can facilitate an efficient and scalable environment for high performance computing.

Abstract: Methods and systems are provided for controlling wide LAG and ECMP in a network. At the ingress edge of the network, a switch can identify packets as LAG or ECMP packets, and allow them to be forwarded through the switch fabric using multiple output ports or paths.

Abstract: Systems and methods for dynamic buffer management in switches that facilitate a data-driven intelligent networking system are provided. The system can accommodate dynamic traffic with fast, effective congestion control while providing efficient use of internal input buffer space.

Abstract: Data-driven intelligent networking systems and methods are provided. The system can accommodate dynamic traffic while applying injection limits to different traffic classes at an ingress edge port. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow can be acknowledged after reaching the egress point of the network, and the acknowledgement packets can be sent back to the ingress point of the flow along the same data path. Furthermore, an edge switch can dynamically allocate the ingress port bandwidth among the traffic classes that are active at a given moment.

Abstract: A switch equipped with a reduction engine capable of being dynamically allocated in a network is provided. During operation, the reduction engine can be dynamically armed based on a multicast frame. As a result, the network can facilitate an efficient and scalable environment for high performance computing.

Abstract: Methods and systems are provided for performing lossy dropping and ECN marking in a flow-based network. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow are acknowledged after reaching the egress point of the network, and the acknowledgement packets are sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform per-flow packet dropping and ECN marking.

Abstract: Data-driven intelligent networking systems and methods are provided. The system can accommodate dynamic traffic while applying injection limits to different traffic classes at an ingress edge port. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow can be acknowledged after reaching the egress point of the network, and the acknowledgement packets can be sent back to the ingress point of the flow along the same data path. Furthermore, an edge switch can dynamically allocate the ingress port bandwidth among the traffic classes that are active at a given moment.

Abstract: Data-driven intelligent networking systems and methods are provided. The system can accommodate dynamic traffic with fast, effective endpoint congestion detection and control. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow can be acknowledged after reaching the egress point of the network, and the acknowledgement packets can be sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform flow control on a per-flow basis.

Abstract: A switch equipped with a self-managing reduction engine is provided. During operation, the reduction engine can use a timeout mechanism to manage itself in different latency-induced or error scenarios. As a result, the network can facilitate an efficient and scalable environment for high performance computing.

Abstract: Data-driven intelligent networking systems and methods are provided. The system can accommodate dynamic traffic with fast, effective per-flow credit-based flow control. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow can be acknowledged after reaching the egress point of the network, and the acknowledgement packets can be sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform flow control on a per-flow basis.