Automated Web service quality component negotiation using NSGA-2

Web services are a popular choice for component oriented systems. Web services not only provide a platform independent architecture but also support dynamic compositions to facilitate on the fly creation of composite solutions. Automated negotiation among Web services provides an effective way for the services to bargain for their optimal customizations and allows the discovery of overlooked potential solutions. Dynamic and unique Quality of Service (QoS) requirements of diverse service consumers, pose challenges for effective approaches of service compositions with multiple QoS parameters. In this paper, we present a negotiation Web service that would be used by both the consumer and provider Web services for conducting negotiations for dependent QoS parameters. We use a genetic algorithm(GA) based approach for finding multiple Pareto optimal solutions in multi-party and multi-objective negotiation scenarios, that may satisfy user's requirements. Experimental results indicate the applicability of or our approach in facilitating the negotiations involved in a Web service composition process.

[1]  Athman Bouguettaya,et al.  Reputation Bootstrapping for Trust Establishment among Web Services , 2009, IEEE Internet Computing.

[2]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[3]  Gerhard J. Woeginger,et al.  Shelf Algorithms for On-Line Strip Packing , 1997, Inf. Process. Lett..

[4]  George Yee,et al.  Bilateral e-services negotiation under uncertainty , 2003, 2003 Symposium on Applications and the Internet, 2003. Proceedings..

[5]  Makoto Yokoo,et al.  An efficient approximate algorithm for winner determination in combinatorial auctions , 2000, EC '00.

[6]  M. Siddiqui,et al.  Grid Capacity Planning with Negotiation-based Advance Reservation for Optimized QoS , 2006, ACM/IEEE SC 2006 Conference (SC'06).

[7]  Michael Wooldridge,et al.  The complexity of contract negotiation , 2005, Artif. Intell..

[8]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[9]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[10]  Raymond Y. K. Lau.  Towards a web services and intelligent agents-based negotiation system for B2B eCommerce , 2007, Electron. Commer. Res. Appl..

[11]  James E. Baker,et al.  Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[12]  Athman Bouguettaya,et al.  Evaluating Rater Credibility for Reputation Assessment of Web Services , 2007, WISE.

[13]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[14]  Gustavo Alonso,et al.  Web Services: Concepts, Architectures and Applications , 2009 .

[15]  Jaime G. Carbonell,et al.  Mutli-agents systems and applications , 2001 .

[16]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[17]  Benjamin W. Wah,et al.  A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..

[18]  Koen V. Hindriks,et al.  Opponent modelling in automated multi-issue negotiation using Bayesian learning , 2008, AAMAS.

[19]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[20]  Hung-Wen Tung,et al.  Automated contract negotiation using a mediation service , 2005, Seventh IEEE International Conference on E-Commerce Technology (CEC'05).

[21]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[22]  Sarit Kraus,et al.  Automated Negotiation and Decision Making in Multiagent Environments , 2001, EASSS.

[23]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[24]  Benjamin W. Wah,et al.  A discrete Lagrangian-based global-search method for solving satisfiability problems , 1996, Satisfiability Problem: Theory and Applications.