AN OPTIMAL COMPOSITION PLAN SELECTION USING MULTI OBJECTIVE PARTICLE SWARM OPTIMIZATION

Abstract

Domain-ontology based Particle Swarm Optimization (PSO)-inspired Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) and Improved Bipartite graph is an efficient web service composition approach. It composed a number of web services to achieve high customer satisfaction. It also improves the clustering quality and reduced the processing time of web service composition. The most verification problems are easily verified by using Petri Net in planning, verification and execution phase. In order to provide more efficient automatic web service composition, in this paper multiple Quality of Service (QoS) parameters like cost, accuracy, accessibility, robustness, scalability, modifiability and security are included in Petri net-based algebra approach. While adding a greater number of QoS parameters there will be multi-objective services composition optimization problem. It is solved by introducing a Multi-Objective Genetic Algorithm (MOGA) and Multi-Objective PSO (MOPSO) algorithm. It selects qualitative different services from multiple functionally identical web services which achieve the best reliability model. Thus, the automatic web service composition is performed for discovering the appropriate services by satisfying the customer requirements. Experimental results show that the proposed method performs better than the existing method.

Authors and Affiliations

PARIMALAM. T AND MEENAKSHI SUNDARAM. K,

Keywords

Related Articles

A COMPARATIVE STUDY ON GOOGLE APP ENGINE AMAZON WEB SERVICES AND MICROSOFT WINDOWS AZURE

In today Internet has grown to be persistent in daily livelihood furthermore Cloud computing is a rising model where computing resources offered over the Internet as scalable, on-demand (Web) services. An association d...

ACR: APPLICATION AWARE CACHE REPLACEMENT FOR SHARED CACHES IN MULTI-CORE SYSTEMS

Modern multi-core systems allow concurrent execution of different applications on a single chip. Such multicores handle the large bandwidth requirement from the processing cores by employing multiple levels of caches w...

THE MECHANISMS OF ADAPTING THE PEDAGOGICAL CONTENT TO THE LEARNER'S PROFILE IN A DYNAMIC CEHL ENVIRONMENT

Building quality educational resources with new technologies requires offering learners and teachers a simple computing environment that would be adapted and would allow it to use its pedagogy in respondent contents of...

A STUDY ON REGULARIZATION FUNCTIONS AND REGULATION PARAMETERS IN IMAGE RESTORATION

The aim of this paper is to apply the regularization functions namely TV norm, l1 norm and l0 norm and regularization parameters with these norms in image restoration. This class of problems results from combining a li...

IMPROVED PRE-COPY APPROACH FOR A SECURITY BASED LIVE VIRTUAL MACHINE MIGRATION IN CLOUD COMPUTING

In current time Cloud Computing is the most recent pattern where IT applications and foundations are provided as 'administrations' under a use based installment model to its end-clients. Normally two issues happen amid...

Download PDF file
  • EP ID EP46525
  • DOI 10.34218/IJCET.10.1.2019.024
  • Views 210
  • Downloads 0

How To Cite

PARIMALAM. T AND MEENAKSHI SUNDARAM. K, (2019). AN OPTIMAL COMPOSITION PLAN SELECTION USING MULTI OBJECTIVE PARTICLE SWARM OPTIMIZATION. International Journal of Computer Engineering & Technology (IJCET), 10(1), -. https://europub.co.uk/articles/-A-46525