ISSN:
1436-5057
Keywords:
AMS Subject Classifications:68M10, 90B12.
;
Key words.Interconnection network topology, routing strategy, scalability, deadlock freedom, communication overhead, fault tolerancy.
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract. This paper presents an easy and straightforward routing algorithm for WK-recursive topologies. The algorithm, based on adaptive routing, takes advantage of the geometric properties of such topologies. Once a source node S and destination node D have been determined for a message communication, they characterize, at some level l, two virtual nodes $hl\_vn(S_D)$ and $hl\_vn(D_S)$ that respectively contain S but not D and D but not S. Such virtual nodes characterize other $N_d-2$ (where $N_d$ is the node degree for a fixed topology) virtual nodes $hl\_vn(I_{SD})$ of the same level that contain neither S nor D. Consequently, it is possible to locate $N_d-2$ triangles whose vertices are these virtual nodes with property to share the same path, called the self-routing path, directly connecting $hl\_vn(S_D)$ to $hl\_vn(D_S)$ . When the self-routing path is unavailable to transmit a message from S to D because of deadlock, fault, and congestion conditions, the routing strategy can follow what we call the triangle rule to deliver it. The proposed communication scheme has the advantage that 1) it is the same for all three conditions; 2) each node of a WK-recursive network, to transmit messages, does not require any information about their presence or location. Furthermore, this routing algorithm is able to tolerate up to $\big[{N_d(N_d-3)\over2}+1\big]{N_d^l-1\over N_d-1}$ faulty links.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s006070050057
Permalink
