ARRANGEMENT GRAPHS - A CLASS OF GENERALIZED STAR GRAPHS

被引：151

作者：

DAY, K

TRIPATHI, A

机构：

[1] Department of Computer Science, University of Minnesota, Minneapolis

来源：

INFORMATION PROCESSING LETTERS | 1992年 / 42卷 / 05期

关键词：

FAULT TOLERANCE; ROUTING; STAR GRAPHS; SYMMETRY;

D O I：

10.1016/0020-0190(92)90030-Y

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present a new interconnection topology, called the arrangement graph, as a generalization of the star graph topology and prove many of its properties such as: hierarchical structure, vertex and edge symmetry, simple and optimal routing, and many fault tolerance properties. The arrangement graph presents more flexibility than the star graph in terms of choosing the major design parameters: degree, diameter, and number of nodes.

引用

页码：235 / 241

页数：7