loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
A New Routing Method to Tolerate both Convex and Concave
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
ASCII Text
x 
 
Huaxi Gu, Zengji Liu, Guochang Kang, Hong Shen, "A New Routing Method to Tolerate both Convex and Concave," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 714-719, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.27,
author = {Huaxi Gu and Zengji Liu and Guochang Kang and Hong Shen},
title = {A New Routing Method to Tolerate both Convex and Concave},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {714-719},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.27},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - A New Routing Method to Tolerate both Convex and Concave
SN - 0-7695-2405-2
SP714
EP719
A1 - Huaxi Gu,
A1 - Zengji Liu,
A1 - Guochang Kang,
A1 - Hong Shen,
PY - 2005
KW - null
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Huaxi Gu, State Key Laboratory of ISN, Xidian University, Xi?an, China
Zengji Liu, State Key Laboratory of ISN, Xidian University, Xi?an, China
Guochang Kang, State Key Laboratory of ISN, Xidian University, Xi?an, China
Hong Shen, Japan Advanced Institute of Science and Technology (JAIST), Japan
To make the exiting fault routing algorithms tolerate concave fault regions without disabling any healthy nodes, the concept of hole is proposed in this paper. A hole consists of healthy nodes in the concave parts and neighborhood of a given concave fault region. By guiding the packet routing inside and outside the hole, the new routing method empowers the convex fault tolerant routing algorithm to tolerate concave shape regions without disabling any healthy nodes. The proposed modification method is simple and does not add new virtual channels. Moreover, it doesn?t change the rules of the previous algorithms. Finally, the performance of the modified routing algorithm is simulated under various concave fault patterns.
Citation:
Huaxi Gu, Zengji Liu, Guochang Kang, Hong Shen, "A New Routing Method to Tolerate both Convex and Concave," pdcat, pp.714-719, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.