双立方体中节点到集合不相交路径的路由

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008) Pub Date : 2008-05-07 DOI:10.1109/I-SPAN.2008.18

K. Kaneko, S. Peng

{"title":"双立方体中节点到集合不相交路径的路由","authors":"K. Kaneko, S. Peng","doi":"10.1109/I-SPAN.2008.18","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Node-to-Set Disjoint Paths Routing in Dual-Cube\",\"authors\":\"K. Kaneko, S. Peng\",\"doi\":\"10.1109/I-SPAN.2008.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":305776,\"journal\":{\"name\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I-SPAN.2008.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SPAN.2008.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

在本文中，我们提出了一种寻找双立方体中节点到集合路由不相交路径的有效算法。双立方体是一种类似超立方体的互连网络，每个节点的链路数量大约是包含相同数量节点的超立方体的一半。对于每个节点有n条链路的双立方Dn，算法在0(n2 log n)时间内找到n条不相交的路径，s rrti, 1 lrrti, 1 llsln，路径的最大长度以3n + 3为界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)

自引率

0.00%

发文量