Probabilistic self-stabilization and random walks

Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011
Pages1-7
Number of pages7
DOIs
Publication statusPublished - Dec 1 2011
Event2nd International Conference on Networking and Computing, ICNC 2011 - Osaka, Japan
Duration: Nov 30 2011Dec 2 2011

Publication series

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

Other

Other2nd International Conference on Networking and Computing, ICNC 2011
CountryJapan
CityOsaka
Period11/30/1112/2/11

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Probabilistic self-stabilization and random walks'. Together they form a unique fingerprint.

Cite this