Zobrazit v EDS

Node disjoint path construction algorithm in the folded divide-and-swap cube.

Uloženo v:
Podrobná bibliografie
Název: Node disjoint path construction algorithm in the folded divide-and-swap cube.
Autoři: Gao, Ying, You, Lantao, Han, Yuejuan, Zhang, Yunsong
Zdroj: PeerJ Computer Science; Jan2026, p1-28, 28p
Témata: HYPERCUBES, ALGORITHMS, ELECTRIC network topology, SERVER farms (Computer network management), GRAPH theory
Abstrakt: The folded divide-and-swap cube FDSCn  (n = 2d, d ≥ 1) is a new hypercube variant, which has many superior properties compared to the hypercube. FDSCn is suitable as a candidate topology for data center networks. In this article, we investigate the one-to-one node disjoint path problem of FDSCn. We first present an algorithm to construct a path between any two distinct nodes u and v based on the structural characteristics of FDSCn. Then we develop an algorithm to build d + 2 node disjoint paths between any two different nodes in FDSCn, and show that the maximum length of these paths shall not exceed n + 9. [ABSTRACT FROM AUTHOR]
Copyright of PeerJ Computer Science is the property of PeerJ Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
Popis
Abstrakt:The folded divide-and-swap cube FDSC<subscript>n</subscript>  (n = 2<sup>d</sup>, d ≥ 1) is a new hypercube variant, which has many superior properties compared to the hypercube. FDSC<subscript>n</subscript> is suitable as a candidate topology for data center networks. In this article, we investigate the one-to-one node disjoint path problem of FDSC<subscript>n</subscript>. We first present an algorithm to construct a path between any two distinct nodes u and v based on the structural characteristics of FDSC<subscript>n</subscript>. Then we develop an algorithm to build d + 2 node disjoint paths between any two different nodes in FDSC<subscript>n</subscript>, and show that the maximum length of these paths shall not exceed n + 9. [ABSTRACT FROM AUTHOR]
ISSN:23765992
DOI:10.7717/peerj-cs.3458