A Reliable Broadcasting Algorithm in Locally Twisted Cubes

Baolei Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - 2nd IEEE International Conference on Cyber Security and Cloud Computing, CSCloud 2015 - IEEE International Symposium of Smart Cloud, IEEE SSC 2015
EditorsTao Zhang, Sajal K. Das, Tao Zhang, Meikang Qiu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages323-328
Number of pages6
ISBN (Electronic)9781467392990
DOIs
StatePublished - 4 Jan 2016
Event2nd IEEE International Conference on Cyber Security and Cloud Computing, CSCloud 2015 - New York, United States
Duration: 3 Nov 20155 Nov 2015

Publication series

NameProceedings - 2nd IEEE International Conference on Cyber Security and Cloud Computing, CSCloud 2015 - IEEE International Symposium of Smart Cloud, IEEE SSC 2015

Other

Other2nd IEEE International Conference on Cyber Security and Cloud Computing, CSCloud 2015
Country/TerritoryUnited States
CityNew York
Period3/11/155/11/15

Keywords

  • Completely independent spanning tree
  • Interconnection network
  • Locally twisted cube
  • Node-disjoint
  • Reliable broadcasting

Fingerprint

Dive into the research topics of 'A Reliable Broadcasting Algorithm in Locally Twisted Cubes'. Together they form a unique fingerprint.

Cite this