By Topic

A self-stabilizing ranking algorithm for tree structured networks

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

3 Author(s)
B. Bourgon ; Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA ; A. K. Datta ; V. Natarajan

This paper presents a self-stabilizing algorithm for ranking a group of processors connected in a distributed system. The protocol suggested is resilient to transient failures, and is guaranteed to recover in finite time. This resiliency is achieved through self-stabilization which guarantees convergence to the desired behavior within finite time. This protocol has application in leader election, routing, agreement, and all other applications requiring unique identification of nodes

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