DocumentCode
321681
Title
Minimum distance routing in the bidirectional shufflenet
Author
Gerla, Mario ; Leonardi, Emilio ; Neri, Fabio ; Palnati, Prasasth
Author_Institution
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Volume
1
fYear
1998
fDate
29 Mar-2 Apr 1998
Firstpage
102
Abstract
In this paper we study the bidirectional shufflenet topology, which is obtained from the well-known (unidirectional) shufflenet by considering bidirectional links. More specifically, we define a shortest-path routing algorithm, and derive the diameter and the average distance of the topology. The bidirectional shufflenet is then compared, in terms of average distance, with other variations of the perfect shuffle
Keywords
hypercube networks; minimisation of switching nets; network topology; telecommunication network routing; average distance; bidirectional links; bidirectional shufflenet; diameter; minimum distance routing; shortest-path routing algorithm; topology; Computer science; Contracts; Ink; Intelligent networks; Multiprocessor interconnection networks; Optical fiber networks; Optical receivers; Optical transmitters; Routing; Telecommunication network topology;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location
San Francisco, CA
ISSN
0743-166X
Print_ISBN
0-7803-4383-2
Type
conf
DOI
10.1109/INFCOM.1998.659643
Filename
659643
Link To Document