Biswapped Networks and Their Topological Properties

In this paper, we propose a new class of interconnection networks, called "biswapped networks" (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. In particular, if the basis network is a Cayley digraph then so is the resulting BSN. Our proposed networks provide a systematic construction strategy for large, scalable, modular, and robust parallel architectures, while maintaining many desirable attributes of the underlying basis network that comprises its clusters. We show how key parameters of a BSN are related to the corresponding parameters of its basis network and obtain a number of results on internode distances, Hamiltonian cycles, and node-disjoint paths. We also discuss the relationship between BSNs and swapped or OTIS networks.

[1]  N. Biggs.  Algebraic Graph Theory , 1974 .

[2]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[3]  Partho Pratim Mishra,et al.  A hop by hop rate-based congestion control scheme , 1992, SIGCOMM 1992.

[4]  H. T. Kung,et al.  The FCVC (flow-controlled virtual channels) proposal for ATM networks: a summary , 1993, 1993 International Conference on Network Protocols.

[5]  Wenjun Xiao,et al.  Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes , 2007, Discret. Appl. Math..

[6]  Abdel Elah Al-Ayyoub,et al.  Topological Properties of OTIS-Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  Ivan Stojmenovic,et al.  Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[8]  S C Esener,et al.  Optical transpose interconnection system architectures. , 1993, Optics letters.

[9]  Behrooz Parhami,et al.  Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors , 1996, Proceedings of 1996 International Conference on Parallel and Distributed Systems.

[10]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[11]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[12]  David R. Cheriton.  Sirpent: a high-performance internetworking approach , 1989, SIGCOMM 1989.

[13]  Wenjun Xiao,et al.  Some mathematical properties of cayley digraphs with applications to interconnection network design , 2005, Int. J. Comput. Math..

[14]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[15]  Arnold L. Rosenberg,et al.  Group Action Graphs and Parallel Architectures , 1990, SIAM J. Comput..

[16]  G.J. Minden,et al.  A survey of active network research , 1997, IEEE Communications Magazine.

[17]  Satish K. Tripathi,et al.  On hop-by-hop rate-based congestion control , 1996, TNET.

[18]  Behrooz Parhami.  Introduction to Parallel Processing , 2002, Series in Computer Science.

[19]  Behrooz Parhami,et al.  Swapped interconnection networks: Topological, performance, and robustness attributes , 2005, J. Parallel Distributed Comput..

[20]  Behrooz Parhami,et al.  Introduction to Parallel Processing: Algorithms and Architectures , 1999 .

[21]  Marie-Claude Heydemann,et al.  Cayley graphs and interconnection networks , 1997 .

[22]  Behrooz Parhami,et al.  A Unified Formulation of Honeycomb and Diamond Networks , 2001, IEEE Trans. Parallel Distributed Syst..