Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps

We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V_r, and make all processes of other components detecting t...

Popoln opis

Bibliografske podrobnosti

Principais autores:	Stéphane Devismes, David Ilcinkas, Colette Johnen
Format:	Artigo
Jezik:	Inglês
Izdano:	Discrete Mathematics & Theoretical Computer Science 2017-11-01
Serija:	Discrete Mathematics & Theoretical Computer Science
Teme:	disconnected network routing algorithm shortest path distributed algorithm self-stabilization shortest-path tree [info.info-ni] computer science [cs]/networking and internet architecture [cs.ni]
Online dostop:	https://dmtcs.episciences.org/3181/pdf
Oznake:	Označite Brez oznak, prvi označite!