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

  • Authors:

  • A Mukherjee;B.B Bhaumik;A.K Bandyopadhyay

  • Affiliations:

  • Price Waterhouse Associates Pvt, Ltd., Salt Lake, Calcutta 700 091, India;Department of Computer Science and Engineering, Jadavpur University, Calcutta 700 032, India;Department of Electronics and Telecommunication Engineering, Jadavpur University, Calcutta 700 032, India

  • Venue:
  • Computer Communications
  • Year:
  • 1997

Quantified Score

Hi-index 0.24

Visualization

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.