A self-stabilizing algorithm for the shortest path problem in a distributed system

A self-stabilizing algorithm for the shortest path problem in a distributed system

0.00 Avg rating0 Votes
Article ID: iaor2004704
Country: United Kingdom
Volume: 43
Issue: 1/2
Start Page Number: 103
End Page Number: 109
Publication Date: Jan 2002
Journal: Computers & Mathematics with Applications
Authors: ,
Abstract:

In this paper, we propose a self-stabilizing algorithm for finding shortest paths in a distributed system in which a central daemon is assumed. The correctness of the proposed algorithm is proved by using the bounded function technique.

Reviews

Required fields are marked *. Your email address will not be published.