Optimal Placement of Identical Resources in a Distributed Network.

reportActive / Technical Report | Accession Number: ADA094786 | Open PDF

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.

Author(s):
Fischer, Michael J. ; Griffeth, Nancy D. ; Guibas, Leo J. ; Lynch, Nancy A.
Author Organization(s):
WASHINGTON UNIV SEATTLE DEPT OF COMPUTER SCIENCE
Descriptive Note:
Technical rept.,
Supplementary Note:
Prepared in cooperation with Georgia Inst. of Tech., Atlanta. Contracts N00014-79-C-0873 and DAAG29-79-C-0155.
Pagination:
0018

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TR-81-01-03
Contract/Grant Number(s):
N00014-80-C-0221
 Subject Terms
Joint Capability Areas:
JCA_6.1_Information Transport; JCA_6_Net Centric; JCA_5_Command and Control; JCA_5.3_Planning
Modernization Areas:
5G
Communities of Interest:
Energy and Power Technologies
Descriptor(s):
*MATHEMATICAL MODELS, *COMPUTER COMMUNICATIONS, *COMPUTER ARCHITECTURE, *ROUTING, ALGORITHMS, OPTIMIZATION, QUEUEING THEORY, COST EFFECTIVENESS, TIME DEPENDENCE, COST ANALYSIS, NODES, COMMUNICATIONS NETWORKS, RESOURCE MANAGEMENT, NETWORK FLOWS, THEOREMS, BINARY NOTATION
Field(s)/Group(s):
Theoretical Mathematics, Computer Hardware, Computer Systems, Non-Radio Communications
Keyword(s):
*Trees(Mathematics), Distributed data processing, Placement algorithms, WUNR049456
Report Date:
1981 Jan 01