Back to Search
Start Over
Internode Distance and Optimal Routing ma Class of Alternating Group Networks.
- Source :
- IEEE Transactions on Computers; Dec2006, Vol. 55 Issue 12, p1645-1648, 4p
- Publication Year :
- 2006
-
Abstract
- Alternating group graphs AG<subscript>n</subscript>, 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<subscript>n</subscript>, of such graphs, proposed by Youhou and dubbed alternating group networks, has been shown to possess advantages over AG<subscript>n</subscript>. For example, AN<subscript>n</subscript> has a node degree that is smaller by a factor of about 2 while maintaining a diameter comparable to that of AG<subscript>n</subscript>, 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<subscript>n</subscript> and present an optimal (shortest-path) routing algorithm for this class of networks. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189340
- Volume :
- 55
- Issue :
- 12
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Computers
- Publication Type :
- Academic Journal
- Accession number :
- 23195760
- Full Text :
- https://doi.org/10.1109/TC.2006.199