DocumentCode
2002971
Title
Shortest path routing in a class of Cayley graphs of semi-direct product of finite groups
Author
Wu, Fen Lin ; Lakshmivarahan, S. ; Dhall, S.K.
Author_Institution
Sch. of Comput. Sci., Oklahoma Univ., Norman, OK, USA
fYear
1995
fDate
28-31 Mar 1995
Firstpage
256
Lastpage
262
Abstract
Recently R.N. Draper (1990) initiated the study of interconnection networks based on Cayley graphs of semi-direct products of two cyclic groups called supertoroids graphs. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. In this paper we described a deterministic, distributed, shortest path algorithm for routing in this class of networks
Keywords
multiprocessor interconnection networks; Cayley graphs; finite groups; interconnection networks; semi-direct product; shortest path routing; supertoroids graphs; toroids; Broadcasting; Computer science; Costs; Intelligent networks; Multiprocessor interconnection networks; Network topology; Parallel architectures; Partitioning algorithms; Routing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on
Conference_Location
Scottsdale, AZ
Print_ISBN
0-7803-2492-7
Type
conf
DOI
10.1109/PCCC.1995.472483
Filename
472483
Link To Document