Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting

Multiple edge-disjoint Hamiltonian cycles (EDHCs) provide the advantages of data broadcast in parallel and edge fault-tolerance in network communications. This paper investigates how to construct more EDHCs in a hypercube-variant network called crossed cube, denoted as $$CQ_n$$ . The topology of $$CQ_n$$ has more wealth than normal hypercubes in network properties, e.g., it has about half of the diameter of a hypercube with the same dimension. Then, we obtain the following results in this paper: (1) We first provide the construction of three EDHCs in $$CQ_6$$ . (2) According to the recursive structure of $$CQ_n$$ , we prove by induction that there exist also three EDHCs in $$CQ_n$$ for $$n\geqslant 7$$ . (3) Finally, we evaluate the performance of data broadcasting by simulation through three EDHCs and compare it against the best previous result in [18] using two EDHCs. In particular, our findings significantly improved the average success rate in edge fault-tolerant data broadcasting and two specific metrics concerning the broadcasting delivery time (latency).