By Topic

A Novel ACO-Based Fault-Tolerant Routing Algorithm in Hypercube Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hongwei Wang ; Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., Harbin, China ; Zhibo Wu

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.

Published in:

Instrumentation, Measurement, Computer, Communication and Control, 2011 First International Conference on

Date of Conference:

21-23 Oct. 2011