### Abstract

A regular interconnection network for large distributed systems which is indicated as R_{n} is presented, we call it R_{n}. This interconnection network is based on a mixed radix number system. The system topology is formed by complete graph product and consists of N = n! points, n(n-1)n!/4 lines and is regular of degree n(n-1)/2. The performance of such network is measured through an analysis of its degree, diameter, connectivity, fault tolerance, routing algorithm and reliability. A number of interesting properties of this network are revealed. Those include its average message distance which is approximately equal to (n-H_{n}), (H_{n} is the nth Harmonic number), the number of point disjoint paths (n(n-1)/2), and an attractive routing algorithm that is similar to Boolean hypercube. Finally, we show that it posseses super-λ property. The reliability of R_{n} can also be readily obtained.

Original language | English |
---|---|

Pages (from-to) | 583-587 |

Number of pages | 5 |

Journal | Microprocessing and Microprogramming |

Volume | 32 |

Issue number | 1-5 |

DOIs | |

Publication status | Published - 1991 Aug |

### All Science Journal Classification (ASJC) codes

- Engineering(all)

## Fingerprint Dive into the research topics of 'A regular interconnection network'. Together they form a unique fingerprint.

## Cite this

*Microprocessing and Microprogramming*,

*32*(1-5), 583-587. https://doi.org/10.1016/0165-6074(91)90405-I