A Reliable Broadcasting Algorithm in Locally Twisted Cubes

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI:10.1109/CSCloud.2015.13

B. Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang

引用次数: 5

Abstract

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.

查看原文本刊更多论文

局部扭曲数据集的可靠广播算法

通过使用完全独立的生成树(cist)，可以获得网络的可靠广播。局部扭曲立方体是一种流行的网络，在文献中得到了广泛的研究。本文研究了利用cist在局部扭曲数据集中建立可靠广播的问题。首先提出了LTQCIST算法在局部扭曲立方体中构造两个cist，然后举例说明了构造cist的过程。最后，我们证明了LTQCIST算法的正确性，并用JUNG对算法进行了仿真。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing

自引率

0.00%

发文量