Computer Science – Data Structures and Algorithms
Scientific paper
2008-10-19
Computer Science
Data Structures and Algorithms
6 pages, 2 columns, 3 figures. To appear in: Proceedings of the 20th IASTED International Conference on Parallel and Distribut
Scientific paper
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet. Also, these node failures are usually transient. Consequently, having the routing paths globally recomputed does not pay off since the failed nodes recover fairly quickly, and the recomputed routing paths need to be discarded. Instead, we develop algorithms and protocols for dealing with such transient single node failures by suppressing the failure (instead of advertising it across the network), and routing messages to the destination via alternate paths that do not use the failed node. We compare our solution to that of Ref. [11] wherein the authors have presented a "Failure Insensitive Routing" protocol as a proactive recovery scheme for handling transient node failures. We show that our algorithms are faster by an order of magnitude while our paths are equally good. We show via simulation results that our paths are usually within 15% of the optimal for randomly generated graph with 100-1000 nodes.
Bhosle Amit M.
Gonzalez Teofilo F.
No associations
LandOfFree
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-265081