Probabilistic self-stabilization and random walks

Masafumi Yamashita

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (Scopus)

抄録

A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers legitimate computation, but only probabilistically unlike a self-stabilizing system. After introducing the notion of probabilistic self-stabilizing systems, we discuss how to design probabilistic self-stabilizing algorithms.

元の言語英語
ホスト出版物のタイトルProceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011
ページ1-7
ページ数7
DOI
出版物ステータス出版済み - 12 1 2011
イベント2nd International Conference on Networking and Computing, ICNC 2011 - Osaka, 日本
継続期間: 11 30 201112 2 2011

出版物シリーズ

名前Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011

その他

その他2nd International Conference on Networking and Computing, ICNC 2011
日本
Osaka
期間11/30/1112/2/11

Fingerprint

Stabilization

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

これを引用

Yamashita, M. (2011). Probabilistic self-stabilization and random walks. : Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011 (pp. 1-7). [6131787] (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011). https://doi.org/10.1109/ICNC.2011.11

Probabilistic self-stabilization and random walks. / Yamashita, Masafumi.

Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. p. 1-7 6131787 (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011).

研究成果: 著書/レポートタイプへの貢献会議での発言

Yamashita, M 2011, Probabilistic self-stabilization and random walks. : Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011., 6131787, Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011, pp. 1-7, 2nd International Conference on Networking and Computing, ICNC 2011, Osaka, 日本, 11/30/11. https://doi.org/10.1109/ICNC.2011.11
Yamashita M. Probabilistic self-stabilization and random walks. : Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. p. 1-7. 6131787. (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011). https://doi.org/10.1109/ICNC.2011.11
Yamashita, Masafumi. / Probabilistic self-stabilization and random walks. Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. pp. 1-7 (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011).
@inproceedings{bc0e4b4e657144bca1075664afb45387,
title = "Probabilistic self-stabilization and random walks",
abstract = "A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers legitimate computation, but only probabilistically unlike a self-stabilizing system. After introducing the notion of probabilistic self-stabilizing systems, we discuss how to design probabilistic self-stabilizing algorithms.",
author = "Masafumi Yamashita",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/ICNC.2011.11",
language = "English",
isbn = "9780769545691",
series = "Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011",
pages = "1--7",
booktitle = "Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011",

}

TY - GEN

T1 - Probabilistic self-stabilization and random walks

AU - Yamashita, Masafumi

PY - 2011/12/1

Y1 - 2011/12/1

N2 - A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers legitimate computation, but only probabilistically unlike a self-stabilizing system. After introducing the notion of probabilistic self-stabilizing systems, we discuss how to design probabilistic self-stabilizing algorithms.

AB - A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers legitimate computation, but only probabilistically unlike a self-stabilizing system. After introducing the notion of probabilistic self-stabilizing systems, we discuss how to design probabilistic self-stabilizing algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84856829804&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856829804&partnerID=8YFLogxK

U2 - 10.1109/ICNC.2011.11

DO - 10.1109/ICNC.2011.11

M3 - Conference contribution

AN - SCOPUS:84856829804

SN - 9780769545691

T3 - Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011

SP - 1

EP - 7

BT - Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011

ER -