Finding safe paths in a faulty environment

Authors:
D. Dolev;J. Meseguer;M. C. Pease
Affiliations:
-;-;-
Venue:
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
1982

Citing 6
Cited 0

Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Graph Algorithms

Graph Algorithms
Polynomial algorithms for multiple processor agreement

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An o(nm log n) algorithm for maximum network flow

An o(nm log n) algorithm for maximum network flow

Quantified Score

Hi-index	0.00

Visualization

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.