By Topic

A self-stabilizing shortest path algorithm in a DAG

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)
B. Bourgon ; Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA ; S. K. Das ; A. K. Datta ; V. Natarajan

This paper describes two protocols applicable to directed acrylic graph topologies. The first is a topological sorting of the successor list at each node, and the second is a shortest routing path protocol. Both of these protocols are resilient to transient failures in that they guarantee system recovery in a finite number of moves. This resiliency is obtained by using the notion of self-stabilization. This is a method by which convergence to the desired behavior is guaranteed. These algorithms have direct application in network routing

Published in:

Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on

Date of Conference:

28-31 Mar 1995