About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE INFOCOM 1991
Conference paper
Clustering schemes for network management
Abstract
A Communication network management structure is considered which consists of regional management centers. These centers receive fault reports from individual nodes in their region and take appropriate action based on the information gathered. The regional centers may report their information to a central management center if required. The problem of partitioning a network into a given number of regions (or clusters) is considered such that there is one management center assigned to each region and the total distance from all the nodes to their assigned center is minimized. An efficient algorithm to solve this problem is presented. It is shown that the problem becomes NP-complete when there are two management centers per region with the regions being disjoint. Some heuristic solutions to this problem are also presented.