Network cost analysis for planning configuration change in distributed systems

Abstract

A Distributed Processing Network (DPN) can assume many different physical topologies. However, when a network is viewed as a group of logical connections, only a few distinct topologies are possible. They are centralized, star, and fully connected. A fourth 'hybrid' topology which combines features of two or more of these is also possible. Each of these topolo gies, or structures, may have a unique cost to the firm as well as unique benefits.

This paper presents a network cost function for each of the possible logical network structures. These functions provide the basis for an interactive model which can be used to develop cost estimates. These estimates can then be used with a sep arate analysis of benefits to aid in network design or can be used to assist in budget preparation when configuration changes are planned. A bank case study is provided to illustrate the use of the model based on these cost functions.

Get full access to this article

View all access options for this article.

References

R.G. Casey , Allocation of copies of a file in an information network, Proc. Spring Joint Computer Confer., 1972, pp. 617-625.

R.G. Casey , Design of tree networks for distributed data , Proc. National Computer Confer., 1973, pp. 251-257.

G.A. Champine et al., Distributed Computer Systems: Impact. on Management, Design, and Analysis (North-Holland, New York, 1980).

W.W. Chu , Optimal file allocation in a multiple computer system, IEE. Trans. Comput. C-18 (10) (1969) 885-889.

W.W. Chu , Performance of file directory systems for data bases in a star and distributed networks, Proc. National Computer Confer., 1976, pp. 577-587.

R.A. Davenport , The state of the art of distributed databases , Information & Management 2 (1979) 231-247.

N. Deo , Graph Theory With Applications to Engineering and Computer Science (Prentice-Hall, Englewood Cliffs, NJ, 2nd ed. 1974).

L. Franz , A. Sen and T.R. Rakes , The evolution of a distributed processing network, Information and Management 7 (1984) 263-272.

E. Hansler , E.K. Mcauliffe and R.S. Wilkov , Exact calculations of computer network reliability, Proc. AFIPS 1972 FJCC 41, Part 1 (AFIPS Press, Montvale, NJ) 49-54.

10.

S. Mahmound and J.S. Riordon , Optimal allocation of resources in distributed information networks, ACM Trans. Database Syst. 1 (1) (1976) 66-78.

11.

M. Miller , A survey of distributed data base management , Information and Management 1 (1978) 243-264.

12.

H.L. Morgan and K. Dan Levin , Optimal program and data locations in computer networks, Comm. A CM 20 (5) (1977) 315-322.

13.

J.B. Rothnie and N. Goodman , A survey of research and development in distributed database management, Proc. Third Internat. Confer. Very Large Data Bases, 1977, pp. 30-44.

14.

D.N. Streeter , Centralization or dispersion of computing facilities , IBM Systems Journal 12 (3) (1973) 283-301.