DocumentCode :
3346954
Title :
A Novel ACO-Based Fault-Tolerant Routing Algorithm in Hypercube Networks
Author :
Wang, Hongwei ; Wu, Zhibo
Author_Institution :
Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., Harbin, China
fYear :
2011
fDate :
21-23 Oct. 2011
Firstpage :
216
Lastpage :
219
Abstract :
This paper proposes an ACO (ant colony optimization)-based fault-tolerant routing algorithm (AFTR) to capture the optimal and sub-optimal routing path in hypercube networks. To reduce the computing complexity in solving AFTR, it also introduces the concept of relay node technique which is derived from RIP protocol. According to the high regularity of hypercube networks, an optimized distributed algorithm (RT-AFTR) for AFTR is proposed, whose computing complexity can fill the requirements of the actual networks. The simulation results indicate that effectiveness of the algorithm can be improved drastically using Opt-AFTR.
Keywords :
ant colony optimisation; computational complexity; distributed algorithms; fault tolerance; hypercube networks; network routing; ACO-based fault-tolerant routing algorithm; AFTR; Opt-AFTR; RIP protocol; RT-AFTR; ant colony optimization; computing complexity reduction; hypercube networks; optimal routing path; optimized distributed algorithm; relay node technique; suboptimal routing path; Computers; Fault tolerance; Fault tolerant systems; Hypercubes; Peer to peer computing; Relays; Routing; Hypercube networks; Interconnection networks; ant colony optimization; faulttolerant routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Instrumentation, Measurement, Computer, Communication and Control, 2011 First International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-0-7695-4519-6
Type :
conf
DOI :
10.1109/IMCCC.2011.63
Filename :
6154039
Link To Document :
بازگشت