Node-to-Set Disjoint Paths Routing in Dual-Cube

Node-to-Set Disjoint Paths Routing in Dual-Cube
复制标题

DOI：
10.1109/i-span.2008.18
复制
发表时间：
2008-05
期刊：
2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)
影响因子：
--
通讯作者：
K. Kaneko;S. Peng
K. Kaneko;S. Peng
中科院分区：
其他
文献类型：
--
作者：
K. Kaneko;S. Peng

文献摘要

被引文献

相似文献

在本文中，我们提出了一个有效的算法，发现不相交路径的节点到集路由双立方体。双立方体是一种类似于超立方体的互连网络，与包含相同节点数的超立方体相比，每个节点的链接数约为一半。对于每个节点具有n条链路的双立方体Dn，该算法在0（n2 log n）时间内找到n条不相交的路径，s rnti，1 les i les n，并且路径的最大长度由3n + 3限定。
In this paper, we propose an efficient algorithm that finds disjoint paths for node-to-set routing in dual-cube. Dual-cube is a hypercube-like interconnection network with about half of links per node compared with the hypercube containing equal number of nodes. For a dual-cube Dn with n links per node, the algorithm finds n disjoint paths, s rarr ti, 1 les i les n, in 0(n2 log n) time and the maximum length of the paths is bounded by 3n + 3.