Premium
Construction of large‐size interconnection networks with high performance
Author(s) -
Shen Hong,
Back RalphJohan
Publication year - 1993
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230230421
Subject(s) - hypercube , degree (music) , binary logarithm , interconnection , computer science , node (physics) , frame (networking) , mathematics , set (abstract data type) , basis (linear algebra) , combinatorics , topology (electrical circuits) , discrete mathematics , algorithm , computer network , physics , geometry , structural engineering , acoustics , engineering , programming language
This paper proposes a new method, recursive expansion (RE), for systematically constructing interconnection networks of arbitrary large size with high performance. On the basis of two small‐size networks, a frame and a unit, the RE method works in a manner of recursively replacing each node in the frame with an expanded network containing a set of copies of the unit and each edge in the frame with a set of interunit connections connecting a pair of the networks until a network of the desired size has been obtained. By RE, we can construct various kinds of large‐size and low‐cost interconnection networks. Two applications of the method, the ℋ Σ r network based on the torus and the ℋ Σ r network based on the hypercube, show that our method can produce networks with cost O((log 3/2 n )/(log 3/2 log n )) (degree O(1)) and O (log n log log n ) (degree O(log log n )). In addition to low cost, networks constructed by RE also possess other properties such as high constructability, good extendability, symmetric topology, and efficient message routing. This paper describes an algorithm, for automatically constructing arbitrary large size networks with high performance. For constructing a network of size n r through r phases RE on the basis of a frame of degree d f and a unit of size n u and degree d u , the algorithm has a time complexity O((max{( d f / n u ), ( d u / r )}) rn 2 r ). Finally, a routing algorithm for networks constructed by RE is presented. The routing algorithm can realize point‐to‐point message routing without using a global routing table at each node and has a time complexity O(( k u + k f ) d f r ), where k u and k f are diameters of the frame and of the unit, d f is the degree of the frame, and r is the number of phases of RE to construct the network. © 1993 by John Wiley & Sons, Inc.