Abstract
This paper addresses the problem of finding safe paths through a network, some of whose nodes may be faulty. By a safe path we mean one between two nodes that does not contain any faulty node. The kinds of faults that concern us are not limited to those that may cause a failure of a node or link, but include those that may cause a node to distort messages in arbitrary ways. Furthermore, we want a distributed algorithm to allow the network itself to discover suitable paths without depending on a central controller for the analysis. More broadly, we assume that each node has only local knowledge of the network structure.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982 |
| Publisher | Association for Computing Machinery |
| Pages | 95-103 |
| Number of pages | 9 |
| ISBN (Print) | 0897910818 |
| DOIs | |
| State | Published - 18 Aug 1982 |
| Externally published | Yes |
| Event | 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982 - Ottawa, Canada Duration: 18 Aug 1982 → 20 Aug 1982 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
|---|
Conference
| Conference | 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982 |
|---|---|
| Country/Territory | Canada |
| City | Ottawa |
| Period | 18/08/82 → 20/08/82 |
Bibliographical note
Publisher Copyright:© 1982 ACM.