The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2006 vol.55)
pp: 1645-1648
ABSTRACT
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.
INDEX TERMS
Alternating group graph, Cayley graph, diameter, interconnection network, internode distance, optimal routing, permutation group, regular graph, shortest-path routing.
CITATION
Wenjun Xiao, Behrooz Parhami, "Internode Distance and Optimal Routing in a Class of Alternating Group Networks", IEEE Transactions on Computers, vol.55, no. 12, pp. 1645-1648, December 2006, doi:10.1109/TC.2006.199
7 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool