The disjoint path cover in the data center network HSDC with prescribed vertices in each path

He, Yan; Zhang, Shurong; Chen, Lin; Yang, Weihua

doi:10.1016/j.amc.2023.128262

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dong et al [12] studied the Hamiltonian properties in an L-HSDC and proved that the n-dimensional L-HSDC is (n − 3)-fault-tolerant Hamiltonianconnected and (n − 2)-fault-tolerant Hamiltonian for n ≥ 3. He et al [13] constructed a 2-disjoint path cover with prescribed end nodes in an HSDC.…”

Section: Introductionmentioning

confidence: 99%

An Improved Fault Diagnosis Algorithm for Highly Scalable Data Center Networks

Lin,

Li,

Chang

et al. 2024

Mathematics

View full text Add to dashboard Cite

Fault detection and localization are vital for ensuring the stability of data center networks (DCNs). Specifically, adaptive fault diagnosis is deemed a fundamental technology in achieving the fault tolerance of systems. The highly scalable data center network (HSDC) is a promising structure of server-centric DCNs, as it exhibits the capacity for incremental scalability, coupled with the assurance of low cost and energy consumption, low diameter, and high bisection width. In this paper, we first determine that both the connectivity and diagnosability of the m-dimensional complete HSDC, denoted by HSDCm(m), are m. Further, we propose an efficient adaptive fault diagnosis algorithm to diagnose an HSDCm(m) within three test rounds, and at most N+4m(m−2) tests with m≥3 (resp. at most nine tests with m=2), where N=m·2m is the total number of nodes in HSDCm(m). Our experimental outcomes demonstrate that this diagnosis scheme of HSDC can achieve complete diagnosis and significantly reduce the number of required tests.

show abstract

Section: Introductionmentioning

confidence: 99%

An Improved Fault Diagnosis Algorithm for Highly Scalable Data Center Networks

Lin,

Li,

Chang

et al. 2024

Mathematics

View full text Add to dashboard Cite

show abstract

Disjoint paths construction algorithm in the data center network DPCell

Dong,

Wang,

et al. 2024

The Computer Journal

View full text Add to dashboard Cite

With the development of the fourth industrial revolution, the importance of data centers has significantly increased. Data centers are widely used in many fields due to their ability to provide efficient, secure, and reliable data storage and processing services. However, with the increasing amount of data, traditional data center networks (DCNs) are currently facing various challenges, prompting academia and industry to propose new DCN architectures. As a dual-port server-based DCN, DPCell has excellent scalability and bisection width, enabling it to meet the demands of large-scale data storage, processing, and computation in the digital revolution. In order to ensure the secure and reliable data communication in the DPCell, this paper designs a disjoint paths communication scheme based on the actual DCN routing requirements. This scheme constructs the optimal number of disjoint paths in DPCell, with a maximum path length of $2^{k}+3$, where $k$ represents the dimension of the DPCell. Furthermore, experiments have verified that the time complexity of this scheme is sublinear, making it more efficient than the current optimal maximum flow algorithm. To a certain extent, this scheme provides DPCell with the required high bandwidth, fault tolerance, and security for data communication.

show abstract

The disjoint path cover in the data center network HSDC with prescribed vertices in each path

Cited by 2 publications

References 16 publications

An Improved Fault Diagnosis Algorithm for Highly Scalable Data Center Networks

An Improved Fault Diagnosis Algorithm for Highly Scalable Data Center Networks

Disjoint paths construction algorithm in the data center network DPCell

Contact Info

Product

Resources

About