By Topic

An efficient optimal reconfiguration algorithm for FBRNs

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

1 Author(s)
Kamat, S.D. ; Dept. of Comput. Sci., Texas A&M Univ., College Station, TX

We study a new network architecture called FBRN (FDDI-based reconfigurable network). An FBRN consists of multiple FDDI token rings and has the ability to reconfigure itself in the event of network faults. Thus, an FBRN has the potential to provide high available bandwidth even in the presence of numerous faults. Realization of this potential depends crucially on the choice of reconfiguration algorithm. We design and analyze a distributed reconfiguration algorithm for FBRNs. Our algorithm is optimal in the sense that it always produces a configuration that has the maximum available bandwidth possible for the given fault pattern. This algorithm has polynomial time complexity and hence can be efficiently implemented. We evaluate the algorithm's performance in terms of the available bandwidth in the network as a function of the number of faults

Published in:

Distributed Computing Systems, 1995., Proceedings of the 15th International Conference on

Date of Conference:

30 May-2 Jun 1995