当前位置: X-MOL 学术Front. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Fault-tolerant hamiltonian cycles and paths embedding into locally exchanged twisted cubes
Frontiers of Computer Science ( IF 4.2 ) Pub Date : 2021-02-11 , DOI: 10.1007/s11704-020-9387-3
Weibei Fan , Jianxi Fan , Zhijie Han , Peng Li , Yujie Zhang , Ruchuan Wang

The foundation of information society is computer interconnection network, and the key of information exchange is communication algorithm. Finding interconnection networks with simple routing algorithm and high fault-tolerant performance is the premise of realizing various communication algorithms and protocols. Nowadays, people can build complex interconnection networks by using very large scale integration (VLSI) technology. Locally exchanged twisted cubes, denoted by (s + t + 1)-dimensional LeTQs,t, which combines the merits of the exchanged hypercube and the locally twisted cube. It has been proved that the LeTQs,t has many excellent properties for interconnection networks, such as fewer edges, lower overhead and smaller diameter. Embeddability is an important indicator to measure the performance of interconnection networks. We mainly study the fault tolerant Hamiltonian properties of a faulty locally exchanged twisted cube, LeTQs,t − (fv + fe), with faulty vertices fv and faulty edges fe. Firstly, we prove that an LeTQs,t can tolerate up to s − 1 faulty vertices and edges when embedding a Hamiltonian cycle, for s ⩾ 2, t ⩾ 3, and st. Furthermore, we also prove another result that there is a Hamiltonian path between any two distinct fault-free vertices in a faulty LeTQs,t with up to (s − 2) faulty vertices and edges. That is, we show that LeTQs,t is (s − 1)-Hamiltonian and (s − 2)-Hamiltonian-connected. The results are proved to be optimal in this paper with at most (s − 1)-fault-tolerant Hamiltonicity and (s − 2) fault-tolerant Hamiltonian connectivity of LeTQs,t.



中文翻译:

容错哈密顿循环和路径嵌入到本地交换的扭曲立方体中

信息社会的基础是计算机互连网络,信息交换的关键是通信算法。寻找具有简单路由算法和高容错性能的互连网络是实现各种通信算法和协议的前提。如今,人们可以使用超大规模集成(VLSI)技术来构建复杂的互连网络。局部交换的扭曲多维数据集,用(s + t + 1)维LeTQ st表示,它结合了交换后的超立方体和局部扭曲的多维数据集的优点。它已被证明LeTQ小号ŧ对于互连网络,它具有许多优异的性能,例如更少的边缘,更低的开销和更小的直径。可嵌入性是衡量互连网络性能的重要指标。我们主要研究有故障顶点f v和有故障边缘f e的有缺陷的局部交换扭曲立方体LeTQ st-f v + f e)的容错哈密顿性质。首先,我们证明当嵌入哈密顿循环时,LeTQ st可以容忍高达s − 1的顶点和边的错误⩾2,⩾3和小号。此外,我们还证明了另一个结果,即在有缺陷的LeTQ s中t最多有(s -2)个有缺陷的顶点和边在两个不同的无缺陷顶点之间存在哈密顿路径。也就是说,我们表明LeTQ st是(s -1)-哈密​​尔顿和(s -2)-哈密​​尔顿相连。事实证明,在LeTQ s的s -1)容错哈密顿性和(s -2)容错哈密顿连通性中,结果是最优Ť

更新日期:2021-02-11
down
wechat
bug