File Assignment in a Central Server Computer Network.
Abstract
The placement of files among the nodes of a computer network can have a significant impact on the performance of the network. The problem of determining the optimal file placement is known as the file assignment problem. This work extends previous performance oriented file assignment research in two major areas. First, a method to obtain file assignments for read-only files that allows replication of file copies it presented. Then this method is extended to read-write files with both non-replication and replication of file copies. The network topology considered is the central server or star network topology. The star network is analyzed using techniques that model the system as a network of queues. The measure of file assignment optimality used is maximum central node throughput. For the read-only model, we introduce the concept of replicated files with split access as a method to improve central node utilization. The problem is formulated as a multiple objective integer linear programming problem. The problem is solved with a polynomially time bounded heuristic. The solution is within proven bounds on the total storage required for an optimal solution.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1979
- Accession Number
- ADA090541
Entities
People
- Lawrence Gene Jones
Organizations
- Air Force Institute of Technology