Back to Search
Start Over
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting.
- Source :
-
Journal of Supercomputing . Mar2023, Vol. 79 Issue 4, p4126-4145. 20p. - Publication Year :
- 2023
-
Abstract
- 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 C Q n . The topology of C Q 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 C Q 6 . (2) According to the recursive structure of C Q n , we prove by induction that there exist also three EDHCs in C Q n for n ⩾ 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). [ABSTRACT FROM AUTHOR]
- Subjects :
- *BROADCASTING industry
*HYPERCUBES
*TELECOMMUNICATION systems
*CUBES
Subjects
Details
- Language :
- English
- ISSN :
- 09208542
- Volume :
- 79
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Journal of Supercomputing
- Publication Type :
- Academic Journal
- Accession number :
- 161549592
- Full Text :
- https://doi.org/10.1007/s11227-022-04825-5