US 2022/0141125 A1 · Turn-based deadlock-free routing in a Cartesian topology

Abstract

An apparatus includes an interface and a processor. The interface communicates with a network including network elements interconnected in a Cartesian topology. The processor defines first and second groups of turns, each turn includes a hop from a previous network element to a current network element and a hop from the current network element to a next network element. Based on the turns, the processor specifies rules that when applied to packets traversing respective network elements, guarantee that no deadlock conditions occur in the network. The rules for a given network element include (i) forwarding rules to reach a given target without traversing the turns of the second group, and (ii) Virtual Lane (VL) modification rules for reassigning packets, which traverse turns of the first group and which are assigned to a first VL, to a different second VL. The processor configures the given network element with the rules.

Claims24

Dependent claims

An apparatus, comprising:

a network interface, configured to communicate with a network comprising a plurality of network elements interconnected in a Cartesian topology;
and
a processor configured to:
define a first group of turns and a second group of turns in the topology, wherein each turn in the first group and each turn in the second group comprises an input hop from a previous network element to a current network element and an output hop from the current network element to a next network element;
based on the turns in the first and second groups, specify rules that when applied to packets traversing respective network elements, guarantee that no deadlock conditions occur in the network,
wherein the rules specified for a given network element comprise (i) forwarding rules from one or more input ports to one or more output ports so as to reach a given target coupled to the network without traversing any of the turns of the second group, and (ii) Virtual Lane (VL) modification rules for reassigning packets, which traverse turns of the first group and which are assigned to a first VL, to a different second VL;
and
configure the given network element with the rules.

5 more elements

A method, comprising:

in a network manager that communicates with a network comprising a plurality of network elements interconnected in a Cartesian topology,
defining a first group of turns and a second group of turns in the topology, wherein each turn in the first group and each turn in the second group comprises an input hop from a previous network element to a current network element and an output hop from the current network element to a next network element;
based on the turns in the first and second groups, specifying rules that when applied to packets traversing respective network elements, guarantee that no deadlock conditions occur in the network, wherein the rules specified for a given network element comprise (i) forwarding rules from one or more input ports to one or more output ports so as to reach a given target coupled to the network without traversing any of the turns of the second group, and (ii) Virtual Lane (VL) modification rules for reassigning packets, which traverse turns of the first group and which are assigned to a first VL, to a different second VL;
and
configuring the given network element with the rules.

2 more elements

Dependencies are inferred from the claim text.

Turn-based deadlock-free routing in a Cartesian topology

Life of this patent

Turn-based deadlock-free routing in a Cartesian topology

Life of this patent

Abstract

Claims24