Deadlock-free rerouting using bypassing paths to resolve local link failure

• Main Authors: RONEN TAMIR, LEVI LEON, UZAN, NERIA, YAROZZI, JOSE, KUSHNIR VLADIMIR
• Format: Patent
• Language: Chinese; English
• Published: 29.03.2022
• Subjects: ELECTRIC COMMUNICATION TECHNIQUE; ELECTRICITY; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION

A computing system includes a plurality of network elements arranged in at least one group. A number of network elements in a group are designated as ridges and a further number of network elements are designated as leaves, the ridges and leaves are interconnected in a binary topology, and at least some of the ridges and leaves in the group are configured to: in a first leaf, receive a packet from a source node that is intended to be delivered to a destination node via a second leaf, forwarding the packet to the first ridge via the first link and to the second leaf via the second link; in response to detecting that the second link has failed, applying a bypass path from the first leaf to the second leaf, the bypass path including a bypass link in a ridge-to-leaf direction and another bypass link in a leaf-to-ridge direction; and forwarding a subsequent packet received in the first leaf and scheduled to the second leaf via the bypass path. 一种计算系统，包括：被布置在至少一个群组中的多个网络元件。群组中的数个网络元件被指定为脊，而另外数个网络元件被指定为叶，脊和叶以二分拓扑互连，