1. Internode Distance and Optimal Routing ma Class of Alternating Group Networks.
- Author
-
Baoxing Chen, Wenjun Xiao, and Parhami, Behrooz
- Subjects
ROUTING (Computer network management) ,NETWORK routers ,COMPUTER networks ,CAYLEY graphs ,DISTRIBUTED computing ,COMPUTER systems ,FAULT-tolerant computing ,ALGORITHMS ,COMPUTER science - 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, ANn , of such graphs, proposed by Youhou and dubbed alternating group networks, has been shown to possess advantages over AGn . For example, ANn has a node degree that is smaller by a factor of about 2 while maintaining a diameter comparable to that of AGn , 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 ANn and present an optimal (shortest-path) routing algorithm for this class of networks. [ABSTRACT FROM AUTHOR]- Published
- 2006
- Full Text
- View/download PDF