Abstract
In massive parallel and distributed systems, high fault-tolerance and reliability are extremely important for interconnection networks. Node-disjoint paths play a key role in improving the performance, reliability and scalability of networks.The hypercube, as well as many hypercube-like variants, are among the most popular and attractive network architectures. The divide-and-swap cube DS C n is a newly proposed hypercube variant which has many desirable properties. In this work, we show that there exist d + 1 node-disjoint paths between any two distinct nodes in divide-and-swap cubes. Since the connectivity of the network is d + 1, d + 1 is the maximum number of paths that can be constructed between any two distinct nodes.
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 callMore From: International Journal of Computer Mathematics: Computer Systems Theory
Disclaimer: 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.
