{"title":"局部扭曲数据集的可靠广播算法","authors":"B. Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang","doi":"10.1109/CSCloud.2015.13","DOIUrl":null,"url":null,"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.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Reliable Broadcasting Algorithm in Locally Twisted Cubes\",\"authors\":\"B. Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang\",\"doi\":\"10.1109/CSCloud.2015.13\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":278090,\"journal\":{\"name\":\"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCloud.2015.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCloud.2015.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
