This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1980 (vol. 29 no. 12)
pp. 1068-1080
P.P.-S. Chen, Graduate School of Management, University of California
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.
Index Terms:
system design, Branch and bound methods, distributed database, distributed information systems, distributed processing, integer programming, mathematical programming
Citation:
P.P.-S. Chen, J. Akoka, "Optimal Design of Distributed Information Systems," IEEE Transactions on Computers, vol. 29, no. 12, pp. 1068-1080, Dec. 1980, doi:10.1109/TC.1980.1675512
Usage of this product signifies your acceptance of the Terms of Use.