Abstract
The recent biswapped networks (BSNs) offer a systematic scheme for building large, scalable, modular, and robust parallel architectures of arbitrary basis networks. BSNs are related to well-known swapped or OTIS networks, and are promising because of their attractive performance attributes including structural symmetry and algorithmic efficiency. In this paper we present an efficient general algorithm for constructing a maximal number of node-disjoint paths between two distinct nodes in a BSN built of an arbitrary basis network and analyze its performance. From this algorithm, we prove that a BSN is maximally fault tolerant if its basis network is connected. As an example application, we show that this algorithm finds the desirable node disjoint paths of length at most 1.5D+3 in 0(log <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> N) time when applied to an N-node BSN of diameter D built of a cube, and also estimate the average performance concerning the maximum path length by computer simulation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
