Cart (Loading....) | Create Account
Close category search window

On Fault-Tolerant Distributor Communication Architecture

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
$31 $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)
Guha, S. ; Department of Mathematics, Jadavpur University ; Sen, A.

A new routing algorithm is proposed in this correspondence for the network architecture developed in [1]. It has been shown that this algorithm gives the shortest path between the source to destination, when all the processors and the communication links of the network are non- faulty. For the situation when some of the processors are faulty, a heuristic function is given, which if used in the routing algorithm will give shortest path from the source to destination, if such a path exists.

Published in:

Computers, IEEE Transactions on  (Volume:C-35 ,  Issue: 3 )

Date of Publication:

March 1986

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.