Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
A methodology for the design of distributed information systems
Communications of the ACM
Optimal program and data locations in computer networks
Communications of the ACM
Design considerations for a distributed data-access system.
Design considerations for a distributed data-access system.
The Design or Multipoint Linkages in a Teleprocessing Tree Network
IEEE Transactions on Computers
Optimal File Allocation in a Multiple Computer System
IEEE Transactions on Computers
Computer communication network design: experience with theory and practice
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Allocation of copies of a file in an information network
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Distributed information systems
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
A Task Allocation Model for Distributed Computing Systems
IEEE Transactions on Computers
The Isomorphism of Simple File Allocation
IEEE Transactions on Computers
Authentication hierarchy in distributed deductive databases
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Location of computers and multiple files in distributed computer systems
Mathematical and Computer Modelling: An International Journal
| Hi-index | 15.00 |
In this paper a model is developed for the optimization of distributed information systems. Compared with the previous work in this area, the model is more complete, since it considers simultaneously the distribution of processing power, the allocation of programs and databases, and the assignment of communication line capacities. It also considers the return flow of information, as well as the dependencies between programs and databases. In addition, an algorithm, based on the "bounded branch and bound" integer programming technique, has been developed to obtain the optimal solution of the model. The algorithm is more efficient than several existing general nonlinear integer programming algorithms. Also, it avoids some of the disadvantages of heuristic and decomposition algorithms which are used widely in the optimization of computer networks and distributed databases. The algorithm has been implemented in Fortran, and the computation times of the algorithm for several test problems have been found very reasonable.