Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912910780923904 |
|---|---|
| author | Zhang, Wenjing Cai, Qingqiong Chang, Jou-Ming |
| author_facet | Zhang, Wenjing Cai, Qingqiong Chang, Jou-Ming |
| contents | BCube, as a popular server-centric data center network (DCN), offers significant advantages in low latency, load balancing, and high bandwidth. The many-to-many paired $m$-disjoint path cover ($m$-DPC), a generalization of Hamiltonian paths, enhances message transmission efficiency by constructing disjoint paths that connect $m$ source-destination pairs while covering all the nodes. However, with the continuous expansion of DCNs, link and service failures have grown increasingly common, necessitating robust fault-tolerant algorithms to guarantee reliable communication.This paper mainly investigates the fault-tolerant paired 2-DPC embedding in BCube. We prove that under the partitioned edge fault (PEF) model, BCube retains a paired 2-DPC even when exponentially many edge failures occur. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_02150 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Paired 2-disjoint path covers of Bcube under the partitioned edge fault model Zhang, Wenjing Cai, Qingqiong Chang, Jou-Ming Combinatorics 05C85, 68R10, 68M10 C.2.1; G.2.2 BCube, as a popular server-centric data center network (DCN), offers significant advantages in low latency, load balancing, and high bandwidth. The many-to-many paired $m$-disjoint path cover ($m$-DPC), a generalization of Hamiltonian paths, enhances message transmission efficiency by constructing disjoint paths that connect $m$ source-destination pairs while covering all the nodes. However, with the continuous expansion of DCNs, link and service failures have grown increasingly common, necessitating robust fault-tolerant algorithms to guarantee reliable communication.This paper mainly investigates the fault-tolerant paired 2-DPC embedding in BCube. We prove that under the partitioned edge fault (PEF) model, BCube retains a paired 2-DPC even when exponentially many edge failures occur. |
| title | Paired 2-disjoint path covers of Bcube under the partitioned edge fault model |
| topic | Combinatorics 05C85, 68R10, 68M10 C.2.1; G.2.2 |
| url | https://arxiv.org/abs/2505.02150 |