Optimal distribution of replicated data in computer networks

Abstract

The rapid development in computer networks has enabled the implementation of new methods of data distribution. There are however, no available tools for supportinq decision making and planning in this application area and operators have to rely on manual methods to design schedules for data and software distribution. This manual approach takes long and typically results 'In distribution projects that are both costly and slow. This article presents 'o new approach to the data distribution scheduling problem that produces schedules for implementation based on minimum distribution cost or minimum distribution time.

Die snelle ontwikkeling van rekenaarnetwerke het die implementering van nuwe metodes vir datadistribusie moontlik gemaak. Daar is ongelukkig geen beskikbare hulpmiddels om besluitneming en beplanning in hierdie toepassingsveld te ondersteun nie en gebruikers moet staat maak op handmetodes vir die opstel van data- en programmatuur verspreidingsskedules. Hierdie handmetodes neem lank en resulteer in verspreidingsprojekte wat beide tydsaam en duur is. Hierdie artikel stel 'n nuwe benadering tot die probleem voor wat skedules lewer vir implementering gebaseer op minimum verspredingskoste of minimum verspreidingstyd.