Fault-tolerant path and disjoint path construction in data center network based on augmented cube

Weibei FAN; Jingman PEI; Mengjie LV; Xueli SUN; Guijuan WANG

doi:10.1007/s11704-025-50487-w

Front. Comput. Sci. ›› 2026, Vol. 20 ›› Issue (6) : 2006109 DOI: 10.1007/s11704-025-50487-w

Architecture

LETTER

Fault-tolerant path and disjoint path construction in data center network based on augmented cube

Weibei FAN ¹^,^‡
, Jingman PEI ¹^,^‡
, Mengjie LV ¹
, Xueli SUN ¹^,^‡
, Guijuan WANG ²^,³^,^‡

Author information +

History +

PDF (447KB)

Graphical abstract

Cite this article

Download citation ▾

Weibei FAN, Jingman PEI, Mengjie LV, Xueli SUN, Guijuan WANG. Fault-tolerant path and disjoint path construction in data center network based on augmented cube. Front. Comput. Sci., 2026, 20(6): 2006109 DOI:10.1007/s11704-025-50487-w

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Huang Y, Lin L, Xu L, Hsieh S Y . Probabilistic reliability via subsystem structures of arrangement graph networks. IEEE Transactions on Reliability, 2024, 73( 1): 279–289

[2]	Chen G, Cheng B, Wang D . Constructing completely independent spanning trees in data center network based on augmented cube. IEEE Transactions on Parallel and Distributed Systems, 2021, 32( 3): 665–673

[3]	Li X Y, Zhao K, Zhuang H, Jia X . Novel schemes for embedding Hamiltonian paths and cycles in balanced hypercubes with exponential faulty edges. Journal of Parallel and Distributed Computing, 2023, 177: 182–191

[4]	Zhuang H, Li X Y, Chang J M, Wang D . An efficient algorithm for Hamiltonian path embedding of k-Ary n-cubes under the partitioned edge fault model. IEEE Transactions on Parallel and Distributed Systems, 2023, 34( 6): 1802–1815

[5]	Fan W, Xiao F, Lv M, Han L, Yu S . Efficient fault-tolerant path embedding for 3D torus network using locally faulty blocks. IEEE Transactions on Computers, 2024, 73( 9): 2305–2319

[6]	Xiang D . Test compression for launch-on-capture transition fault testing. ACM Transactions on Design Automation of Electronic Systems, 2024, 29( 1): 7

[7]	Hao R X, Qin X W, Zhang H, Chang J M . Two-disjoint-cycle-cover pancyclicity of data center networks. Applied Mathematics and Computation, 2024, 475: 128716

[8]	Li Y, Zhou S, Cheng E . Paired 2-disjoint path covers of balanced hypercube under the partitioned edge fault model. The Journal of Supercomputing, 2025, 81( 1): 273

[9]	Zhao S L, Hao R X, Wei C . Internally disjoint trees in the line graph and total graph of the complete bipartite graph. Applied Mathematics and Computation, 2022, 422: 126990