A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

The problem of locating centers of graphs has a variety of applications in the areasof transportation and communication in distributed systems. In this paper, we design and prove the correctness of a self-stabilizing algorithm which finds the center(s) for a distributed system with a tree topology....

Full description

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) 2004-11, Vol.48 (10), p.1667-1676
Main Authors: Huang, Tetz C., Lin, Ji-Cherng, Mou, Nathan
Format: Article
Language:English
Subjects:
Algorithms
Center
Computer networks
Computer simulation
Design engineering
Graphs
Interleaving model
Mathematical models
Model of computation
Read/write separate atomicity
Self-stabilizing algorithm
Topology
Transportation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of locating centers of graphs has a variety of applications in the areasof transportation and communication in distributed systems. In this paper, we design and prove the correctness of a self-stabilizing algorithm which finds the center(s) for a distributed system with a tree topology. The computational model employed in this paper was introduced by Dolev et al., which assumes the read/write separate atomicity.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2004.01.014