Fault-tolerant embedding of complete binary trees in locally twisted cubes

详细信息    查看全文

• 作者：Zhao Liu^a ; ^b ; ^{liuzhao@suda.edu.cn}Author Vitae ; Jianxi Fan^a ; ^b ; ^{jxfan@suda.edu.cn}Author Vitae ; Jingya Zhou^a ; ^b ; ^{jy_zhou@suda.edu.cn}Author Vitae ; Baolei Cheng^a ; ^b ; ^{chengbaolei@suda.edu.cn}Author Vitae ; Xiaohua Jia^c ; ^{csjia@cityu.edu.hk}Author Vitae
• 刊名：Journal of Parallel and Distributed Computing
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：101
• 期：Complete
• 页码：69-78
• 全文大小：1535 K
• 卷排序：101

文摘

We prove that the complete binary tree can be embedded with dilation 2, congestion 1, expansion 1, and load 1 into Locally twisted cube. We present three effective algorithms for fault-tolerant embedding of complete binary trees in locally twisted cubes with respect to one faulty node, two faulty node, and any faulty set FF of 2<|F|≤2n−12<|F|≤2n−1 nodes, respectively.