File allocation for distributed computer communication networks
Laurence Joseph Laning · 1979
This research represents advancements in methods to allocate file copies of multiple distinct files within a distributed computer communication network. The developed file allocation algorithm allows the evaluation of networks using adaptive routing techniques. Previous algorithms assume fixed path routing techniques. The problem formulation provides for network performance constraints of average delay by message class, which allows strict control and monitoring of delay performance. The solution methodology is recursive in that it integrates a mathematical programming formulation with a discrete event simulator. This integration obtains results not possible from either method alone. Heuristic rules are developed to resolve any message class delay infeasibilities by altering file placements. These rules use analytical methods to obtain surrogate simulation results so that only a small number of file placements require evaluation by computer simulation. In summary, this work presents the development of an analytical method to allocate files in distributed networks of realistic size and complexity that is computationally practical.