Rabin numbers of Butterfly networks
β Scribed by Sheng-Chyang Liaw; Gerard J. Chang
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 505 KB
- Volume
- 196
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Reliability
and efficiency are important criteria in the design of interconnection networks. Recently, the w-wide diameter d,(G), the (W -1 )-fault diameter D,,(G), and the w-Rabin number r,(G) have been used to measure network reliability and efficiency. In this paper, we study these parameters for an important class of parallel networks -Butterfly networks. The main result of this paper is to determine the Rabin number of Butterfly networks.
π SIMILAR VOLUMES
## Abstract Let __G__ be a connected graph. A routing in __G__ is a set of fixed paths for all ordered pairs of vertices in __G__. The forwarding index of __G__ is the minimum of the largest number of paths specified by a routing passing through any vertex of __G__ taken over all routings in __G__.