Accession Number:

ADA090541

Title:

File Assignment in a Central Server Computer Network.

Descriptive Note:

Doctoral thesis,

Corporate Author:

AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH

Personal Author(s):

• Jones,Lawrence Gene

Report Date:

1979-01-01

Pagination or Media Count:

183.0

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.

Descriptors:

• *COMPUTER COMMUNICATIONS
• *COMPUTER ARCHITECTURE
• *COMMUNICATIONS NETWORKS
• *COMPUTER FILES
• DATA BASES
• QUEUEING THEORY
• GRAPHS
• LINEAR PROGRAMMING
• INTEGER PROGRAMMING
• THESES
• INPUT OUTPUT PROCESSING
• READ WRITE MEMORIES
• NODES
• HEURISTIC METHODS
• TABLES(DATA)
• READ ONLY MEMORIES

Subject Categories:

• Computer Programming and Software
• Computer Hardware
• Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE