Cluster based approach for centralized routing

Routing in a network may involve a complex collection of functions that work more or less independently and yet support each other by exchanging services or information. The complexity arises due to maintaining coordination between all the nodes of the subnet, coping with link and node failures. Complexity of centralized routing control strategies may be reduced by partitioning a network into smaller subnetworks or clusters such that the routing functionality leads to efficient network performance. Hence, each cluster is having one network routing control center. Existing hierarchical and partitional clusters are based upon creating groups consisting of elements that are close to each other w.r.t. the distance or parameters considered in the application. But these algorithms are not adequate and appropriate. For designing and selecting an appropriate routing strategy for a network, a number of factors that influence the behavior of the strategy have to be considered such as traffic patterns, volumes, service requirements, feasibility and optimality of routes with respect to resource utilization etc. This paper presents an optimal approach for clustering a large network by first choosing appropriate nodes that can act as a Network Routing Control Centers.