By Topic

MMAR:A deadlock recovery-based fault tolerant routing algorithm for mesh/torus 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

4 Author(s)
Lei Song ; Key Lab of Broadband Optical Fiber Transmission and Communication Network, University of Electronic Science and Technology of China, Chengdu, Sichuan, China ; Du Xu ; Guo Jiang ; Qing Yao

In direct networks, such as mesh and torus, the switching capacity will increase as the number of components increase. But the fault probability of the network also increases with the increasing of components. This paper proposes a novel fault-tolerant algorithm, named as minimal misrouted adaptive routing (MMAR) which is based on true fully adaptive routing algorithm and deadlock recovery mechanism. Due to the high adaptability, MMAR can accommodate arbitrary shaped fault models using minimal number of virtual channels in each physical link. When encountering concave fault models, MMAR minimizes the length of the misrouted path by avoiding routing the message into the irrespective holes. Simulation results show that MMAR can work efficiently and achieve favorable performance.

Published in:

Communications, Circuits and Systems, 2007. ICCCAS 2007. International Conference on

Date of Conference:

11-13 July 2007