Vertex-Disjoint Paths in BCDC Networks

For any integer $n\geq 2,\ B_{n}$, the $n$-dimensional BCDC network, based on a class of BC networks, crossed cube, is a server-centric and high-performance data center network for mega data centers with manageable cabling complexity. Implementing vertex-disjoint paths has great value of application in fault-tolerance and multi-path routing of data center networks. In this pa...