{"title":"Set-to-Set Disjoint Paths Routing in Dual-Cubes","authors":"K. Kaneko, S. Peng","doi":"10.1109/PDCAT.2008.11","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set routing in a dual-cube. A 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 D<sub>n</sub> with n links per node, the algorithm finds n disjoint paths, node s<sub>i</sub>rarrt<sub>j</sub> (1 les i, j les n), s<sub>i</sub> isin S, tj isin T, in O (n<sup>2</sup> log n) time and the maximum length of the paths is bounded by 3n + 3.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2008.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set routing in a dual-cube. A 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, node sirarrtj (1 les i, j les n), si isin S, tj isin T, in O (n2 log n) time and the maximum length of the paths is bounded by 3n + 3.
在本文中，我们提出了一种寻找双立方体中集对集路由不相交路径的有效算法。双立方体是一种类似超立方体的互连网络，每个节点的链路数量是包含相同数量节点的超立方体的一半。对于每个节点有n条链路的双立方Dn，算法在O (n2 log n)时间内找到n条不相交的路径，节点sirartj (1 les i, j les n)，节点siisin S，节点tjisin T，路径的最大长度以3n + 3为界。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
