A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property - Computer Science > Data Structures and AlgorithmsReportar como inadecuado




A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property - Computer Science > Data Structures and Algorithms - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The minimum spanning tree MST construction is a classical problem inDistributed Computing for creating a globally minimized structuredistributedly. Self-stabilization is versatile technique for forward recoverythat permits to handle any kind of transient faults in a unified manner. Theloop-free property provides interesting safety assurance in dynamic networkswhere edge-cost changes during operation of the protocol. We present a newself-stabilizing MST protocol that improves on previous known ap- proaches inseveral ways. First, it makes fewer system hypotheses as the size of thenetwork or an upper bound on the size need not be known to the participants.Second, it is loop-free in the sense that it guarantees that a spanning treestructure is always preserved while edge costs change dynamically and theprotocol adjusts to a new MST. Finally, time complexity matches the best knownresults, while space complexity results show that this protocol is the mostefficient to date.



Autor: Lélia Blin IBISC, Maria Gradinariu Potop-Butucaru INRIA Rocquencourt, Stephane Rovedakis IBISC, Sébastien Tixeuil INRIA Futurs,

Fuente: https://arxiv.org/







Documentos relacionados