Equitable coloring by spectral clustering in the distributed web networks

Abstract

The limited number of servers and more number of users in a distributed system is a great concern in load balancing. In this paper the efficient way of allocating tasks to available servers using equitable coloring of graphs is studied. For balancing the load, the complexity of graph is reduced by spectral clustering, which partitions the graph for further processes. The web model of graphs such as generalized structure of wheel and web graphs are investigated. The spectrum of these graphs are calculated for partitioning and then equitable coloring is applied. This approach results in the proper distribution of load in the web networks.