Location of Repository

Biswapped networks of the form $Bsw(G)$ have recently been proposed as interconnection networks to be implemented as optical transpose interconnection systems. We provide a systematic construction of $\kappa+1$ vertex-disjoint paths joining any two distinct vertices in $Bsw(G)$, where $\kappa\geq 1$ is the connectivity of $G$. In doing so, we obtain an upper bound of $\max\{2\Delta(G)+5,\Delta_\kappa(G)+\Delta(G)+2\}$ on the $(\kappa+1)$-diameter of $Bsw(G)$, where $\Delta(G)$ is the diameter of $G$ and $\Delta_\kappa(G)$ the $\kappa$-diameter. Suppose that we have a deterministic multipath source routing algorithm in an interconnection network $G$ that finds $\kappa$ mutually vertex-disjoint paths in $G$ joining any $2$ distinct vertices and does this in time polynomial in $\Delta_\kappa(G)$, $\Delta(G)$ and $\kappa$ (and independently of the number of vertices of $G$). Our constructions yield an analogous deterministic multipath source routing algorithm in the interconnection network $Bsw(G)$ that finds $\kappa+1$ mutually vertex-disjoint paths joining any $2$ distinct vertices in $Bsw(G)$ so that these paths all have length bounded as above. Moreover, our algorithm has time complexity polynomial in $\Delta_\kappa(G)$, $\Delta(G)$ and $\kappa$. We also show that if $G$ is Hamiltonian then $Bsw(G)$ is Hamiltonian, and that if $G$ is a Cayley graph then $Bsw(G)$ is a Cayley graph

Topics:
Interconnection networks, OTIS networks, Biswapped networks, Connectivity, Hamiltonicity, Cayley graphs.

Publisher: Oxford University Press

Year: 2011

DOI identifier: 10.1093/comjnl

OAI identifier:
oai:dro.dur.ac.uk.OAI2:7496

Provided by:
Durham Research Online

Downloaded from
http://dro.dur.ac.uk/7496/1/7496.pdf

- (1995). A Introduction to the Theory of Groups,
- (1998). Algorithms for the Otis Optoelectronic Computer,
- (1993). An Introduction to Photonic Switching Fabrics,
- (1988). Comparison between electrical and free-space optical interconnects based on power and speed considerations,
- (1989). Efficient dispersal of information for security, load balancing, and fault tolerance,
- (2008). Graph Theory and Interconnection Networks,
- (2005). Graph Theory,
- (1994). On the k-diameter of k-regular k-connected graphs,
- (1993). Optical transpose interconnection system architectures,
- (2004). Optical transpose k-ary n-cube networks,
- (1991). Performance comparison between optoelectronic and VLSI multistage interconnection networks,
- (2004). Principles and Practices of Interconnection Networks,
- (2009). Swapped (OTIS) networks built of connected basis networks are maximally fault tolerant,
- (2005). The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks,
- (1988). Topological properties of hypercubes,
- (2002). Topological properties of OTIS-networks,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.