Back close

A minimal cost design for a large hierarchically clustered computer communication network considering a desired index of service

Publication Type : Journal Article

Publisher : Elsevier

Source : Computer Communication, vol 20, no 6, pp 507-511, 25 July, ’97, UK

Url : https://www.sciencedirect.com/science/article/abs/pii/S0140366497000431

Campus : Amritapuri

School : School of Computing

Year : 1997

Abstract : The paper presents a method for designing a hierarchical network that maintains the desired index of service at different levels of the hierarchy, from a set of geographically distributed nodes. First, an optimization problem is proposed to obtain the optimum number of clusters and optimum number of nodes in the clusters. Next, the members of a cluster are identified and then clusters are formed by using a clustering algorithm, considering the geographical location of each node. The cost optimization procedure and the clustering algorithm are repeated until we obtain a network hierarchy. This is illustrated by a set of problems.

Cite this Research Publication : A. Mukherjee, A.K. Bandyopadhyay and B.B. Bhaumik, “A minimal cost design for a large hierarchically clustered computer communication network considering a desired index of service”, Computer Communication, vol 20, no 6, pp 507-511, 25 July, ’97, UK

Admissions Apply Now