Bibliographic Details
| Title: |
Hamilton Connectivity Analysis of Data Center Network Based on Meta-structure Network. |
| Authors: |
Hui Li1 jwc@humc.edu.cn, Linyu Yang2 yanglinyu@henu.edu.cn, Xiaoyu Du3 dxy@henu.edu.cn |
| Source: |
Engineering Letters. Nov2025, Vol. 33 Issue 11, p4507-4517. 11p. |
| Subjects: |
Hamiltonian graph theory, Computer network architectures, Time complexity, Algorithms, Data centers |
| Abstract: |
Hamilton-connected is essential property of data center network. In this paper, we propose X(n, k) and research under what conditions X(n, k) is Hamiltonian-connected, which is small specific structures to extend large data center network architectures. Secondly, We study the Hamilton connectivity of BCube(n, k) in all cases and some other DCN (Data Center Network) structures by using X(n, k) theorem and inference. Finally, we propose O(logk * nk) time complexity algorithm to find the Hamiltonian path between any two distinct servers in BCube(n, k) (n ≥ 3 and k ≥ 0). [ABSTRACT FROM AUTHOR] |
|
Copyright of Engineering Letters is the property of International Association of Engineers (IAENG) 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.) |
| Database: |
Engineering Source |
