Equitable coloring by spectral clustering in the distributed web networks

J. Veninstine Vivik, P. Xavier


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.

Full Text: PDF

Published: 2021-03-04

How to Cite this Article:

J. Veninstine Vivik, P. Xavier, Equitable coloring by spectral clustering in the distributed web networks, J. Math. Comput. Sci., 11 (2021), 1743-1752

Copyright © 2021 J. Veninstine Vivik, P. Xavier. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Copyright ©2024 JMCS