A Reliable Broadcasting Algorithm in Locally Twisted Cubes
Reliable broadcasting for a network can be obtained by using completely independent spanning trees(CISTs). Locally twisted cubes are popular networks which have been studied widely in the literature. In this paper, we study the problem of using CISTs to establish reliable broadcasting in locally twisted cubes. We first propose an algorithm, named LTQCIST, to construct two CISTs in locally twisted cubes, then exemplify the construction procedures to construct CISTs. Finally, we prove the correctness of Algorithm LTQCIST and simulate CISTs with JUNG.
MSU Digital Commons Citation
Cheng, Baolei; Fan, Jianxi; Wang, Dajin; and Yang, Jiwen, "A Reliable Broadcasting Algorithm in Locally Twisted Cubes" (2016). Department of Computer Science Faculty Scholarship and Creative Works. 62.