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

Fault-tolerant hierarchical routing

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

4 Author(s)
Alari, G. ; Unite d''Inf., Univ. Catholique de Louvain, Belgium ; Datta, A. ; Derby, J. ; Lawrence, J.

This paper presents a self-stabilizing, fault-tolerant hierarchical routing algorithm. Hierarchical routing algorithms are less expensive algorithm than traditional all-pairs routing algorithms (i.e., lower memory requirements, faster routing table lookups, and less costly broadcast). The algorithm presented here retains these benefits yet, maintains routing capability between all pairs of connected nodes, even in the presence of faults, such as link/node failures and repairs and corruption of program variables. Additionally, this algorithm solves the problem of area partition where nodes that are defined to be in the same subset of the network become isolated by link or node failure. Being self-stabilizing, starting from an arbitrary state the protocol is guaranteed to reach a configuration with routing tables containing valid entries in a finite time. The protocol automatically updates the shortest paths in the face of dynamically changing link weights. The protocol dynamically allocates/deallocates storage for the routing information as the network size changes. The algorithm works on an arbitrary topology and under a distributed daemon model

Published in:

Performance, Computing, and Communications Conference, 1997. IPCCC 1997., IEEE International

Date of Conference:

5-7 Feb 1997

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.