A self-stabilizing ranking algorithm for tree structured networks

Author

Bourgon, Brian ; Datta, Ajoy ; Natarajan, Viruthagiri

Author_Institution

Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA

fYear

1995

fDate

28-31 Mar 1995

Firstpage

23

Lastpage

28

Abstract

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

Keywords

distributed algorithms; distributed processing; multiprocessor interconnection networks; network routing; protocols; distributed system; leader election; protocol; ranking algorithm; routing; transient failures; tree structured networks; Computer science; Convergence; Distributed algorithms; Intrusion detection; Law; Nominations and elections; Registers; Routing protocols; Sections; Sorting;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Scottsdale, AZ

Print_ISBN

0-7803-2492-7

Type

conf

DOI

10.1109/PCCC.1995.472517

Filename

472517