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 (Highly Scalable Data Center Network), which can achieve greater incremental scalability. In this paper, we give the definition of the logical graph of HSDC, named \(H_n\), 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\) are both n. Then, we give an O(n) shortest unicast algorithm to find a shortest path between any two distinct nodes in \(H_n\), and prove the correctness of this algorithm. In fact, we also prove that the length of the shortest path constructed by this algorithm is no more than \(2d+1\) if \(d<n\) and at most 2d if \(d=n\), where d is the Hamming distance between the start and end nodes, and the diameter of \(H_n\) is 2n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. In: Proceedings of the ACM SIGCOMM 2008 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 63–74 (2008)
Leiserson, C.E.: Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. 34(10), 892–901 (1985)
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., Lu, S.: BCube: a high performance, server-centric network architecture for modular data centers. In: Proceedings of the ACM SIGCOMM 2009 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 63–74 (2009)
Greenberg, A., Hamilton, J.R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D.A., Patel, P., Sengupta, S.: VL2: a scalable and flexible data center network. Commun. Acm. 54(3), 95–104 (2009)
Hamedazimi, N., Qazi, Z., Gupta, H., Sekar, V., Das, S.R., Longtin, J.P., Shah, H., Tanwer, A.: FireFly: a reconfigurable wireless data center fabric using free-space optics. ACM SIGCOMM Compu. Commun. Rev. 44(4), 319–330 (2014)
Liu, Y.J., Wong, B., Gao, P.X., Keshav, S.: Quartz: a new design element for low-latency DCNs. ACM SIGCOMM Comput. Commun. Rev. 44(4), 283–294 (2014)
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., Lu, S.: DCell: a scalbable and fault-tolerant network structure for data centers. Acm SIGCOMM Comput. Commun. Rev. 38(4), 75–86 (2008)
Li, Z., Guo, Z., Yang, Y.: BCCC: an expandable network for data centers. IEEE/ACM Trans. Netw. 24(6), 77–88 (2014)
Liao, Y., Yin, J., Yin, D., Gao, L.: Dpillar: dualport server interconnection network for large scale data centers. Comput. Netw. 56(8), 2132–2147 (2012)
Li, D., Guo, C., Wu, H., Tan, K., Zhang, Y., Lu, S., Wu, J.: Scalable and cost-effective interconnection of data-center servers using dual server ports. IEEE/ACM Trans. Netw. 19(1), 102–114 (2011)
Wang, X., Fan, J., Lin, C.-K., Zhou, J., Liu, Z.: BCDC: a high-performance, server-centric data center network. J. Comput. Sci. Technol. 33(2), 400–416 (2018)
Bhuyan, L.N., Agrawal, D.P.: Generalized hypercube and hyperbus structures for a computer network. IEEE Trans. Comput. 33(4), 323–333 (1984)
Wang, D.: Constructing optimal subnetworks for the crossed cube network. Networks 60(2), 86–93 (2012)
Zhang, Z., Deng, Y., Min, G., Xie, J., Yang, L., Zhou, Y.: HSDC: a highly scalable data center network architecture for greater incremental scalability. IEEE Trans. Parallel Distrib. Syst. 30(5), 1105–1119 (2019)
Wang, X., Fan, J., Jia, X., Lin, C.-K.: An efficient algorithm to construct disjoint path covers of DCell networks. Theor. Comput. Sci. 609, 197–210 (2016)
Hsu, L.-H., Lin, C.-K.: Graph theory and interconnection networks. CRC Press, London (2008)
Guo, D., Chen, H., He, Y., Jin, H., Chen, C., Chen, H., Shu, Z., Huang, G.: KCube: a novel architecture for interconnection networks. Inf. Process. Lett. 110(18–19), 821–825 (2010)
Xu, J.: Combinatorial theory in networks. Science Press, Beijing (2001)
Wang, X., Fan, J., Zhou, J., Lin, C.-K.: The restricted h-connectivity of the data center network DCell. Discret. Appl. Math. 203, 144–157 (2016)
Efe, K.: A variation on the hypercube with lower diameter. IEEE Trans. Comput. 40(11), 1312–1316 (1991)
Zhou, W., Fan, J., Jia, X., Zhang, S.: The spined cube: a new hypercube variant with smaller diameter. Inf. Process. Lett. 111(12), 561–567 (2011)
Fan, J., Lin, X., Jia, X., Lau, R.W.H.: Edge-pancyclicity of twisted cubes. International Symposium on Algorithms and Computation (ISAAC 2005). Lecture Notes in Computer Science. vol. 3827, pp. 1090-1099 (2005)
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Nos. U1905211 and 61972272) and the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Dong, H., Fan, J., Cheng, B. et al. Fault-Tolerant and Unicast Performances of the Data Center Network HSDC. Int J Parallel Prog 49, 700–714 (2021). https://doi.org/10.1007/s10766-021-00699-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10766-021-00699-x