Article

Brief announcement: on the possibility and the impossibility of message-driven self-stabilizing failure detection

Authors:

Martin Hutle,

Josef WidderAuthors Info & Claims

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Page 208

https://doi.org/10.1145/1073814.1073852

Published: 17 July 2005 Publication History

Get Access

Abstract

No abstract available.

References

[1]

J. Beauquier and S. Kekkonen-Moneta. Fault-tolerance and self-stabilization: Impossibility results and solutions using self-stabilizing failure detectors. International Journal of Systems Science, 28(11):1177--1187, 1997.

Crossref

Google Scholar

[2]

T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685--722, June 1996.

Digital Library

Google Scholar

[3]

T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225--267, March 1996.

Digital Library

Google Scholar

[4]

M. Hutle and J. Widder. On the possibility and the impossibility of message-driven self-stabilizing failure detection. Research Report 34/2004, Technische Universität Wien, Institut für Technische Informatik, July 2004. http://www.ecs.tuwien.ac.at/projects/Theta/papers/.

Google Scholar

[5]

J. Widder, G. Le Lann, and U. Schmid. Failure detection with booting in partially synchronous systems. In Proceedings of the 5th European Dependable Computing Conference (EDCC-5), volume 3463 of LNCS, pages 20--37, Budapest, Hungary, Apr. 2005. Springer Verlag.

Digital Library

Google Scholar

Cited By

View all

Biely MWidder J(2009)Optimal message-driven implementations of omega with mute processesACM Transactions on Autonomous and Adaptive Systems10.1145/1462187.14621914:1(1-22)Online publication date: 9-Feb-2009
https://dl.acm.org/doi/10.1145/1462187.1462191
Biely MWidder J(2006)Optimal message-driven implementation of omega with mute processesProceedings of the 8th international conference on Stabilization, safety, and security of distributed systems10.5555/1759076.1759086(110-121)Online publication date: 17-Nov-2006
https://dl.acm.org/doi/10.5555/1759076.1759086

Index Terms

Brief announcement: on the possibility and the impossibility of message-driven self-stabilizing failure detection

Recommendations

A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks
OPODIS'05: Proceedings of the 9th international conference on Principles of Distributed Systems

Self-stabilizing protocols can tolerate any type and any number of transient faults. However, in general, self-stabilizing protocols provide no guarantee about their behavior against permanent faults. This paper proposes a self-stabilizing link-coloring ...
Timer-based composition of fault-containing self-stabilizing protocols

One of the desired properties of distributed systems is self-adaptability against faults. Self-stabilizing protocols provide autonomous recovery from any finite number of transient faults. However, in practice, catastrophic faults rarely occur, while ...
Brief announcement: linear time byzantine self-stabilizing clock synchronization
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

We present the first self-stabilizing Byzantine clock synchronization algorithm that has linear convergence time.

Comments

Information & Contributors

Information

Published In

PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

July 2005

364 pages

ISBN:1581139942

DOI:10.1145/1073814

General Chair:
Marcos Aguilera
HP Labs
,
Program Chair:
James Aspnes
Yale University

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

July 17 - 20, 2005

NV, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
191
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Biely MWidder J(2009)Optimal message-driven implementations of omega with mute processesACM Transactions on Autonomous and Adaptive Systems10.1145/1462187.14621914:1(1-22)Online publication date: 9-Feb-2009
https://dl.acm.org/doi/10.1145/1462187.1462191
Biely MWidder J(2006)Optimal message-driven implementation of omega with mute processesProceedings of the 8th international conference on Stabilization, safety, and security of distributed systems10.5555/1759076.1759086(110-121)Online publication date: 17-Nov-2006
https://dl.acm.org/doi/10.5555/1759076.1759086

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks

Timer-based composition of fault-containing self-stabilizing protocols

Brief announcement: linear time byzantine self-stabilizing clock synchronization

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks

Timer-based composition of fault-containing self-stabilizing protocols

Brief announcement: linear time byzantine self-stabilizing clock synchronization

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations