Doubly connected multi-dimensional regular topologies for MANs and LANs

The authors present a group of multidimensional regular topologies with two incoming and two outgoing link per node. The use of a mixed-radix numbering system in defining the network topology leads to many choices for the jump distance, which provides better performance when the total number of nodes is large. They introduce a performance parameter named spanning radius (SPR) which determines the addition traversal required to use all different choices when the number of choices exceeds two. The impact of the number of choices and its SPR on the network performance is also studied. The results show that a multidimensional network performs better in terms of diameter and reliability when the penalty of the extra link traversal is offset by the saving due to the additional jump distance choices used.<<ETX>>

[1]  Cauligi S. Raghavendra,et al.  A Survey of Multi-Connected Loop Topologies for Local Computer Networks , 1986, Comput. Networks.

[2]  Makoto Imase,et al.  Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.

[3]  Suresh Rai,et al.  A Cutset Approach to Reliability Evaluation in Communication Networks , 1982, IEEE Transactions on Reliability.

[4]  Mateo Valero,et al.  Discrete Optimization Problem in Local Networks and Data Alignment , 1987, IEEE Transactions on Computers.

[5]  Cauligi S. Raghavendra,et al.  Reliable Loop Topologies for Large Local Computer Networks , 1985, IEEE Transactions on Computers.

[6]  Kenneth Steiglitz,et al.  The Design of Small-Diameter Networks by Local Search , 1979, IEEE Transactions on Computers.

[7]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[8]  Ming T. Liu.  Distributed Loop Computer Networks , 1978, Adv. Comput..

[9]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[10]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[11]  J. Abraham.  An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.

[12]  Maxemchuk.  The Manhattan street network , 1985 .

[13]  Miguel Angel Fiol,et al.  Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.

[14]  F. Boesch.  Synthesis of reliable networks - a survey , 1986, IEEE Transactions on Reliability.

[15]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[16]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[17]  Dhiraj K. Pradhan,et al.  A Fault-Tolerant Communication Architecture for Distributed Systems , 1982, IEEE Transactions on Computers.