Optimal Placement of Identical Resources in a Distributed Network.

Abstract

The problem is considered of locating a number of identical resources at nodes of a tree so as to minimize the total expected cost of servicing a set of random requests for the resources. The cost of servicing a request is the tree distance from the requesting node to the node at which the resource satisfying the request is located. An algorithm for finding an optimal placement of resources is presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1981
Accession Number
ADA094786

Entities

People

  • Leonidas J. Guibas
  • Michael J. Fischer
  • Nancy D. Griffeth
  • Nancy Lynch

Organizations

  • University of Washington

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Computations
  • Computer Networks
  • Computer Science
  • Contracts
  • Military Research
  • Networks
  • Probability
  • Probability Distributions
  • Random Variables
  • Step Functions
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Radar Systems Engineering.