Fully symmetric swapped networks based on bipartite cluster connectivity |
| |
Authors: | Wenjun Xiao Weidong Chen Wenhong Wei |
| |
Affiliation: | a School of Software Engineering, South China University of Technology, Guangzhou 510641, PR China b Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA |
| |
Abstract: | The class of swapped or OTIS (optical transpose interconnect system) networks, built of n copies of an n-node cluster by connecting node i in cluster j to node j in cluster i for i≠j, has been studied extensively. One problem with such networks is that node i of cluster i has no intercluster link. This slight asymmetry complicates a number of algorithms and hinders both theoretical investigations and practical pursuits, such as building parallel node-disjoint paths for fault tolerance. We introduce biswapped networks that are fully symmetric and have cluster connectivity very similar to swapped/OTIS networks. We derive basic topological parameters, present a simple distributed shortest-path routing algorithm, and point to a number of other interesting properties under investigation for biswapped networks. |
| |
Keywords: | Bipartite graph Hierarchical network Interconnection network OTIS network Routing algorithm Swapped network Topological parameters |
本文献已被 ScienceDirect 等数据库收录! |
|