Finding safe paths in a faulty environment

D. Dolev, J. Meseguer, M. C. Pease

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

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 languageEnglish (US)
Title of host publicationProceedings of the 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982
PublisherAssociation for Computing Machinery
Pages95-103
Number of pages9
ISBN (Print)0897910818
DOIs
StatePublished - Aug 18 1982
Externally publishedYes
Event1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982 - Ottawa, Canada
Duration: Aug 18 1982Aug 20 1982

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Other

Other1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982
Country/TerritoryCanada
CityOttawa
Period8/18/828/20/82

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Finding safe paths in a faulty environment'. Together they form a unique fingerprint.

Cite this