Authors

Jie Li, Shuai Ding, Xiaoyu Du, Zhijie Han

Abstract

The HCN network topology is composed of dual-port servers and multi-port switches. And it is an efficient interconnection structure with lower equipment costs. Furthermore, it has a high degree of regularity, scalability and symmetry, in line with the modular design of the data center. At the same time, Hamiltonian is one of the important performance indicators to measure the network structure. It has many applications. For example, the application of Hamiltonian path in the multicast and broadcast algorithms of data center networks can effectively reduce the congestion of multicast and broadcast algorithms. Thereby improving the efficiency of network communication. In this paper, we mainly prove that a h level HCN built with n port switches is Hamiltonian connected for n ≥ 4 and k ≥ 0.

Citation

  • Journal: Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies
  • Year: 2020
  • Volume:
  • Issue:
  • Pages: 176–180
  • Publisher: ACM
  • DOI: 10.1145/3444370.3444567

BibTeX

@inproceedings{Li_2020,
  series={CIAT 2020},
  title={{The Analysis of Hamiltonian based on HCN network topology}},
  DOI={10.1145/3444370.3444567},
  booktitle={{Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies}},
  publisher={ACM},
  author={Li, Jie and Ding, Shuai and Du, Xiaoyu and Han, Zhijie},
  year={2020},
  pages={176--180},
  collection={CIAT 2020}
}

Download the bib file

References

  • Shafer J, Datacenter storage architecture for mapreduce applications[C]//ACLD. Workshop on Architectural Concerns in Large Datacenters (2009)
  • Wittmann, Informationweek (2010)
  • Al-Fares, M., Loukissas, A. & Vahdat, A. A scalable, commodity data center network architecture. Proceedings of the ACM SIGCOMM 2008 conference on Data communication 63–74 (2008) doi:10.1145/1402958.1402967 – 10.1145/1402958.1402967
  • Greenberg, A. et al. VL2. Commun. ACM 54, 95–104 (2011) – 10.1145/1897852.1897877
  • Guo, C. et al. Dcell. Proceedings of the ACM SIGCOMM 2008 conference on Data communication 75–86 (2008) doi:10.1145/1402958.1402968 – 10.1145/1402958.1402968
  • Guo, ACM SIGCOMM Conf. Data Commun. (2009)
  • Deke Guo et al. Expandable and Cost-Effective Network Structures for Data Centers Using Dual-Port Servers. IEEE Trans. Comput. 62, 1303–1317 (2013) – 10.1109/tc.2012.90
  • Zhu, L., Wu, J., Jiang, G., Chen, L. & Lam, S.-K. Efficient hybrid multicast approach in wireless data center network. Future Generation Computer Systems 83, 27–36 (2018) – 10.1016/j.future.2018.01.012
  • Wenhui LI, 2-disjoint path covers in k-ary 3-cubes with fault edges[J]. computer engineering & applications (2017)
  • Razavi, S. & Sarbazi-Azad, H. The triangular pyramid: Routing and topological properties. Information Sciences 180, 2328–2339 (2010) – 10.1016/j.ins.2010.02.016
  • DOI not foun – 10.5555/1097029
  • Wang, X., Erickson, A., Fan, J. & Jia, X. Hamiltonian Properties of DCell Networks. The Computer Journal 58, 2944–2955 (2015) – 10.1093/comjnl/bxv019
  • Fan, J. Hamilton-connectivity and cycle-embedding of the Möbius cubes. Information Processing Letters 82, 113–117 (2002) – 10.1016/s0020-0190(01)00256-3
  • Qin, X.-W. & Hao, R.-X. Hamiltonian properties of some compound networks. Discrete Applied Mathematics 239, 174–182 (2018) – 10.1016/j.dam.2017.12.043
  • Yinhe Huangfu, Hamiltonian Analysis of Network Structure Based on Basic Elements [D] (2019)