DEADLOCK-FREE ROUTING USING EDGE-DISJOINT SUB-NETWORKS

摘要

An aspect includes deadlock-free routing on arbitrary network topologies using edge-disjoint sub-networks. A network topology of a network is identified. The network includes a plurality of links between a plurality of switches. Each of the links is identified as an edge. A plurality of edge-disjoint sub-networks is constructed from the network topology of the network by routing configuration logic. The plurality of edge-disjoint sub-networks is formed by edges between the switches such that the edges are disjoint relative to each of the edge-disjoint sub-networks. The switches are configured to route traffic on the network with each route staying entirely within one of the plurality of edge-disjoint sub-networks within the network.

主权项

1. A method, comprising:
identifying a network topology of a network, the network comprising a plurality of links between a plurality of switches, each of the links identified as an edge; constructing from the network topology of the network, by routing configuration logic, a plurality of edge-disjoint sub-networks formed by edges between the switches such that the edges are disjoint relative to each of the edge-disjoint sub-networks; and configuring the switches to route traffic on the network with each route staying entirely within one of the plurality of edge-disjoint sub-networks within the network.