loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)
One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks
May 07-May 09
ISBN: 978-0-7695-3125-0
ASCII Text
x 
 
Saeedeh Bakhshi, Hamid Sarbazi-Azad, "One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 227-232, The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/I-SPAN.2008.37,
author = {Saeedeh Bakhshi and Hamid Sarbazi-Azad},
title = {One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3125-0},
pages = {227-232},
doi = {http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2008.37},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks
SN - 978-0-7695-3125-0
SP227
EP232
A1 - Saeedeh Bakhshi,
A1 - Hamid Sarbazi-Azad,
PY - 2008
KW - Multi-computers
KW - interconnection networks
KW - WK-recursive
KW - Parallel routing
KW - node-disjoint paths
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Recently, routing with disjoint paths has received much attention to provide more performance and fault tolerance. On the other hand, WK-recursive mesh network has been studied extensively due to its favorable properties such as high degree of stability and resilience. The connectivity of a network is an important measure of fault tolerance, while the diameter represents the worst-case transmission delay between two arbitrary nodes. In this paper, we proposeone-to-one and one-to-many disjoint routings mechanisms for WK-recursive mesh networks tofurther exhibit the performance and fault tolerance of such networks.
Index Terms:
Multi-computers, interconnection networks, WK-recursive, Parallel routing, node-disjoint paths
Citation:
Saeedeh Bakhshi, Hamid Sarbazi-Azad, "One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks," ispan, pp.227-232, The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.