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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 64; číslo 10; s. 4121 - 4136
Hlavní autori:	Mo, Yuanqiu, Dasgupta, Soura, Beal, Jacob
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.10.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!