Dynamic File Allocation in a Computer Network
Abstract
One of the main reasons computer networks are a major area of great attention and development today is their capability to provide the facilities for common use of data bases and information files by all computers in the system. When a file is used by several computers in the network, it can be stored in the memory of at least one of them and can be accessed by the other computers via the communication channels. In general the cost or querying is reduced as we increase the number of copies in the system. On the other hand, storage costs, limitations on the size of the memories and the cost of updating (every copy must be updated) will dictate decreasing of the number of copies. This thesis considers the problem of optimal dynamic file allocation when more than one copy is allowed to exist in the system at any given time. The use of two types of control variables, one for adding new copies to the system and the other for erasing copies, gives the model certain properties that permit the construction of an efficient algorithm to solve the optimization problem. In the last chapter the model and algorithms are applied to several numerical examples.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1976
- Accession Number
- ADA031608
Entities
People
- Francisco De Asis Ros Peran
Organizations
- Massachusetts Institute of Technology