A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Conditional diagnosability of alternating group networks
Information Processing Letters
Construction of vertex-disjoint paths in alternating group networks
The Journal of Supercomputing
| Hi-index | 14.98 |
Alternating group graphs AG_{n}, studied by Jwo and others, constitute a class of Cayley graphs that possess certain desirable properties compared with other regular networks considered by researchers in parallel and distributed computing. A different form, AN_{n}, of such graphs, proposed by Youhou and dubbed alternating group networks, has been shown to possess advantages over AG_{n}. For example, AN_{n} has a node degree that is smaller by a factor of about 2 while maintaining a diameter comparable to that of AG_{n}, is maximally fault-tolerant, and shares some of the positive structural attributes of the well-known star graph. In this paper, we characterize the distance between any two nodes in AN_{n} and present an optimal (shortest-path) routing algorithm for this class of networks.