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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 64; no. 10; pp. 4121 - 4136
Main Authors:	Mo, Yuanqiu, Dasgupta, Soura, Beal, Jacob
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!