Weak vs. self vs. probabilistic stabilization

Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

31 被引用数 (Scopus)

抄録

Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weak-stabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that selfstabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one. This latter result hints at more practical use of weak-stabilization, as such algorithms are easier to design and prove than their (probabilistic) selfstabilizing counterparts.

本文言語英語
ホスト出版物のタイトルProceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008
ページ681-688
ページ数8
DOI
出版ステータス出版済み - 2008
イベント28th International Conference on Distributed Computing Systems, ICDCS 2008 - Beijing, 中国
継続期間: 7 17 20087 20 2008

出版物シリーズ

名前Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008

その他

その他28th International Conference on Distributed Computing Systems, ICDCS 2008
国/地域中国
CityBeijing
Period7/17/087/20/08

All Science Journal Classification (ASJC) codes

  • ハードウェアとアーキテクチャ
  • ソフトウェア

フィンガープリント

「Weak vs. self vs. probabilistic stabilization」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル