Abstract
The problem of tolerating crash/or link failures has been extensively studied. These studies focused on a single link, and how to mask failures of that link. In contrast, this paper studies lossy links in the context of an entire system: it is shown that the effect of lossy links depends on the proportion of faulty processes in the system. The results assume permanent process crashes, and more importantly, the effect of adding link failures on the solvability of problems in general is studied. This approach stresses the importance of the notion of correct-restricted problems.
| Original language | English |
|---|---|
| Pages | 246 |
| Number of pages | 1 |
| DOIs | |
| Publication status | Published - 1 May 1996 |
| Externally published | Yes |
| Event | 15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996 - Philadelphia, PA, USA Duration: 23 May 1996 → 26 May 1996 |
Conference
| Conference | 15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996 |
|---|---|
| City | Philadelphia, PA, USA |
| Period | 23/05/96 → 26/05/96 |
Fingerprint
Dive into the research topics of 'Crash failures vs. crash + link failures'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver