DEADLOCK-FREE ROUTING USING EDGE-DISJOINT SUB-NETWORKS
摘要
<p>Described is a method for 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.</p>
申请公布号
WO2014115049(A1)
申请公布日期
2014.07.31
申请号
WO2014IB58114
申请日期
2014.01.08
申请人
INTERNATIONAL BUSINESS MACHINES CORPORATION;IBM UNITED KINGDOM LIMITED;IBM (CHINA) INVESTMENT COMPANY LIMITED
发明人
SINGLA, ANKIT;DIXON, COLIN, KIMM;FELTER, WESLEY, MICHAEL;CARTER, JOHN, BRUCE