Fault-Tolerant Communication in HSDC: Ensuring Reliable Data Transmission in Smart Cities

As the core of cloud computing, the data center network (DCN) provides services and decision support for smart cities by providing powerful data storage and computing capabilities. As a server-centric DCN, the high scalability data center network architecture (HSDC) can cope with the rapid growth of data volume and provide an effective service foundation for smart cities. However, the rapid development of smart cities requires that DCNs can still operate reliably in the presence of faulty while expanding its scale. Therefore, it is very important to design reliable fault-tolerant communication algorithms in DCNs. This article investigates the fault-tolerant communication algorithm in HSDC. Initially, we propose an $O(n^{2})$ algorithm to establish $n$ disjoint paths between any pair of nodes in the $n$ -dimension HSDC. Simulation experiments show that the disjoint paths generated by our algorithm in HSDC have a maximum length only 3 longer than the diameter, which guarantees a small communication delay in the worst case. In addition, we propose an $O(n)$ algorithm to establish a fault-tolerant unicast path between any pair of fault-free nodes in the $n$ -dimension HSDC. Moreover, simulation experiments indicate that as the scale of HSDC increases, the algorithm performs well in both running efficiency and the length of constructed paths.