DocumentCode :
3444787
Title :
Node-to-Set Disjoint Paths Routing in Dual-Cube
Author :
Kaneko, Keiichi ; Peng, Shietung
Author_Institution :
Fac. of Eng., Tokyo Univ., Tokyo
fYear :
2008
fDate :
7-9 May 2008
Firstpage :
77
Lastpage :
82
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.
Keywords :
computer networks; hypercube networks; telecommunication network routing; dual-cube; hypercube; interconnection network; node-to-set disjoint path routing; Agricultural engineering; Agriculture; Computer networks; Computer science; Concurrent computing; Hypercubes; Multiprocessor interconnection networks; Network topology; Parallel architectures; Routing; algorithm; dual-cube; interconnection network; node-to-set routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms, and Networks, 2008. I-SPAN 2008. International Symposium on
Conference_Location :
Sydney, NSW
ISSN :
1087-4089
Print_ISBN :
978-0-7695-3125-0
Type :
conf
DOI :
10.1109/I-SPAN.2008.18
Filename :
4520198
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3444787
بازگشت