Hamilton Connectivity Analysis of Data Center Network Based on Meta-structure Network.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 189071732 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Hamilton Connectivity Analysis of Data Center Network Based on Meta-structure Network. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Hui+Li%22">Hui Li</searchLink><relatesTo>1</relatesTo><i> jwc@humc.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Linyu+Yang%22">Linyu Yang</searchLink><relatesTo>2</relatesTo><i> yanglinyu@henu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Xiaoyu+Du%22">Xiaoyu Du</searchLink><relatesTo>3</relatesTo><i> dxy@henu.edu.cn</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Engineering+Letters%22">Engineering Letters</searchLink>. Nov2025, Vol. 33 Issue 11, p4507-4517. 11p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Hamiltonian+graph+theory%22">Hamiltonian graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+architectures%22">Computer network architectures</searchLink><br /><searchLink fieldCode="DE" term="%22Time+complexity%22">Time complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Data+centers%22">Data centers</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=189071732 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 11 StartPage: 4507 Subjects: – SubjectFull: Hamiltonian graph theory Type: general – SubjectFull: Computer network architectures Type: general – SubjectFull: Time complexity Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Data centers Type: general Titles: – TitleFull: Hamilton Connectivity Analysis of Data Center Network Based on Meta-structure Network. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Hui Li – PersonEntity: Name: NameFull: Linyu Yang – PersonEntity: Name: NameFull: Xiaoyu Du IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 1816093X Numbering: – Type: volume Value: 33 – Type: issue Value: 11 Titles: – TitleFull: Engineering Letters Type: main |
| ResultId | 1 |
