This paper mentions a hierarchical clustered based routing K-Means algorithm. K-Means is a typical clustering algorithm that has been proved to use for clustering any undetermined dataset very effectively with some K is a predefined number of clusters, for example in image processing. | Research on applying hierarchical clustered based routing technique using fuzzy logic and artificial intelligence algorithms for service based routing