A Self-Stabilizing Quickest Path Routing Algorithm

Abstract

This paper presents a self-stabilized algorithm for the quickest path problem. This algorithm will guarantee that an asynchronous distributed system will in finite t ime have an all-pairs quickest path routing table at each node i n finite t ime. Also, the system can handle node additions/deletions/perturbations without permanent eflects on the system.