Optimal File Allocation Problems for Distributed Data Bases in Unreliable Computer Networks,

Abstract

This paper deals with the problem of optimally locating files, and their optimum number of redundant copies in a vulnerable communication network. It is assumed that each node and link of the communication network can fail independently. The optimization problem maximizes the probability that a commander can access the subset of files that he needs while minimizing the network-wide costs related to storage, query and update communication costs. The problem reduces to a linear zero-one integer programming one; several theorems that reduce its complexity of solution are presented. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1982
Accession Number
ADA123302

Entities

People

  • Michael Athans
  • Moses Ma

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Sensors

DTIC Thesaurus Topics

  • Air
  • Communication Networks
  • Computer Networks
  • Computer Programming
  • Computers
  • Databases
  • Distributed Computing
  • Information Processing
  • Integer Programming
  • Literature Surveys
  • Mathematics
  • Network Protocols
  • Networks
  • Optimization
  • Probability
  • Vulnerability

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Operations Research