Robustness of the Adaptive Bellman -Ford Algorithm: Global Stability and Ultimate Bounds

Self-stabilizing distance estimation algorithms are an important building block of many distributed systems, such as seen in the emerging field of aggregate computing. Their safe use in feedback systems or under persistent perturbations has not previously been formally analyzed. Self-stabilization o...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automatic control Jg. 64; H. 10; S. 4121 - 4136
Hauptverfasser:	Mo, Yuanqiu, Dasgupta, Soura, Beal, Jacob
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.10.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Adaptive algorithms Aggregates Aggregating computing Algorithms Asymptotic methods Asymptotic properties Asymptotic stability Computer networks Convergence Error analysis Feedback Internet of things Liapunov functions Lyapunov function Lyapunov methods Perturbation methods Robustness stability Stability analysis ultimate boundedness
ISSN:	0018-9286, 1558-2523
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!