Abstract
The swift progress in the computing set up by providing services has caused the sudden increase in the amount of the services that are operationally similar. The dissimilarity in such services are observed based on the characteristics standards of their service quality. Consequently a thought-provoking issue in the perspective of the service-configuration is based on the choosing the accurate client services according to the user demands for which the acquired compound services guarantees the non-computational demands on the ground of comprehensive service quality constraints. The procedure carried out in the paper presents the novel algorithm for the service composition/configuration for enhancing the quality of service of the compound /composite computing services. The algorithm focusses in improve the service configuration feasibility and optimality and minimize the configuration time. The algorithm is totally based on the limits in the configuration strategies that relies on the Pareto-Dominance and the quality of service decomposition (PD-QOSD). The quantity of the service arrangements is expected to increase according to the service count and quality of service characteristics in case of PD and whereas the QOSD takes care of the feasibility of the arrangements during the high restrictions imposed by users on the constraints of the comprehensive quality of service. The validation outcomes prove that the novel algorithm developed function efficiently on the basis of the time required for composition, the optimality, as well as the search space.
Publisher
Inventive Research Organization