An improved Particle Swarm Optimization Algorithm for QoS-aware Web Service Selection in Service Oriented Communication

نویسندگان

  • Wenbin Wang
  • Qibo Sun
  • Xinchao Zhao
  • Fangchun Yang
چکیده

QoS-aware Web Service Selection is a crucially important issue in Service Oriented Communication which enables communication by integrating communication web services over Internet. Because of the growing number of candidate web services that provide the same functionality but differ in Quality of Service (QoS), it brings more challenges to select a combination of composite services with optimal QoS performance, while satisfying users’ QoS constraints. Here, an improved Particle Swarm Optimization Algorithm (iPSOA) is proposed to solve this problem. In order to make the algorithm more suitable for QoS-aware Web Service Selection, firstly we redefine the parameters, such as position, velocity and updating operations. In addition, a Non-Uniform Mutation (NUM) strategy is applied to the global best particle to enhance the population diversity on the purpose of overcoming the prematurity of PSOA and a non-uniform mutation function is also designed. Furthermore, the other two contributions are the Adaptive Weight Adjustment (AWA) and Local Best First (LBF) strategies to improve the convergence speed in global and local level respectively. The efficacy of the proposed algorithm for QoS-aware Web Service Selection is illustrated and compared with a modified Genetic Algorithm (GA), QCDSS and PSOA, and the results of experimental evaluation indicate that our approach significantly outperforms the existing methods in execution time with better QoS performance while selecting combinations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective QoS-aware Web Service Selection Approach

Service computing provides the capability of binding each service invocation in a composition to a service selected among the same function attributes but different QoS attributes to achieve a QoS goal. Hence, service selection approach plays a very important role in service composition. However existing approaches little considered the computation time. In this study, we propose a effective Qo...

متن کامل

A Hybrid Clonal Selection Algorithm for Quality of Service-aware Web Service Selection Problem

It is imperative to provide service consumers with facilities for selecting required web services according to their Quality of Service (QoS). Several heuristics, which are local adaptation preemptive strategy, elitist perturbation guiding strategy and global tournament strategy for directed local fine-tuning, and a hybrid clonal selection algorithm (CSPLPT) are proposed for QoS-aware web servi...

متن کامل

Efficient QoS management for QoS-aware web service composition

In this paper, we propose an efficient QoS management approach for QoS-aware web service composition. In the approach, we classify web services according to theirs similarity and then design a QoS tree to manage the QoS the classified web services. Besides, by querying the managed QoS, we propose a QoS-aware web service composition via a particle swarm optimisation algorithm to perform fast web...

متن کامل

Semantic Constraint and QoS-Aware Large-Scale Web Service Composition

Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...

متن کامل

Memetic algorithms applied to the optimization of workflow compositions

The selection of services of a workflow based on Quality of Service (QoS) attributes is an important issue in service-oriented systems. QoS attributes allow for a better selection process based on non-functional quality criteria such as reliability, availability, and response time. Past research has mostly addressed this problem with optimal methods such as linear programming approaches. Given ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Computational Intelligence Systems

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2010