The Implications of Interactive Consistency for Fault-Tolerant Computations.

Abstract

The program examined the significance of interactive consistency for battlefield communications. This environment is different from those considered in the original work on interactive consistency in three ways: the network is apt to be very large; it is incomplete in the sense that a particular node will not be able to communicate directly with every other one; and it is variable in unpredictable ways as links fade out or become useful. Recent work on interactive consistency is reviewed for its relevance to an environment with these characteristics. Recent work has demonstrated that, in incomplete networks, the network connectivity is critical. Specifically, in a network with N nodes of which not more than N may be faulty, interactive consistency can be assured if N is greater than 3M and the network connectivity is greater than 2M. Given the variability of the networks being considered, this makes it vital that we have a way for determining network connectivity. Two distributed algorithms for determining network connectivity have been developed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1982
Accession Number
ADA118111

Entities

People

  • Marshall C. Pease

Organizations

  • SRI International

Tags

Communities of Interest

  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Acquisition
  • Algorithms
  • Battlefields
  • Communication Networks
  • Computations
  • Computer Science
  • Consistency
  • Cross Correlation
  • Distributed Computing
  • Environment
  • Military Research
  • Networks
  • North Carolina
  • Scientists
  • Security
  • Simulations
  • Spread Spectrum

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Regression Analysis.
  • Systems Analysis and Design