Connectivity and Routing Algorithm of the Data Center Network HSDC - Network and Parallel Computing Access content directly
Conference Papers Year : 2021

Connectivity and Routing Algorithm of the Data Center Network HSDC

Abstract

In order to satisfy the rapidly increasing demand for data volume, large data center networks (DCNs) have been proposed. In 2019, Zhang et al. proposed a new highly scalable DCN architecture named HSDC, which can achieve greater incremental scalability. In this paper, we give the definition of the logical graph of HSDC, named $$H_n$$Hn, which can be treated as a compound graph of hypercube and complete graph of the same dimension. First, we prove that the connectivity and tightly super connectivity of $$H_n$$Hn are both n. Then, we give an O(n) routing algorithm to find a shortest path between any two distinct nodes in $$H_n$$Hn, and prove the correctness of this algorithm. In fact, we also prove that the distance constructed by this algorithm is no more than $$2d+1$$2d+1 if $$d
Fichier principal
Vignette du fichier
511910_1_En_35_Chapter.pdf (722.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03768752 , version 1 (04-09-2022)

Licence

Attribution

Identifiers

Cite

Hui Dong, Jianxi Fan, Baolei Cheng, Yan Wang, Jingya Zhou. Connectivity and Routing Algorithm of the Data Center Network HSDC. 17th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2020, Zhengzhou, China. pp.407-419, ⟨10.1007/978-3-030-79478-1_35⟩. ⟨hal-03768752⟩
9 View
1 Download

Altmetric

Share

Gmail Facebook X LinkedIn More