QoS-driven optimisation of composite web services: an approach based on GRASP and analytical models

Development of applications based on the composition of web services is growing for a large range of domains. Due to the concurrency and synchronisation characteristics of some applications, analytical modelling is helpful for planning and predicting the quality-of-service QoS measures of the composite services. This study proposes an optimisation method adapted from the greedy randomised adaptive search procedure GRASP and integrated with analytical model solving to find service providers, which will leverage the performance and reliability of a composite web service. The proposed approach finds solutions close to the best-known configurations and is computationally efficient, enabling the fast discovery of a high-quality assignment of providers even for large scenarios with thousands of possible combinations.

[1]  Zibin Zheng,et al.  Collaborative Web Service QoS Prediction via Neighborhood Integrated Matrix Factorization , 2013, IEEE Transactions on Services Computing.

[2]  Schahram Dustdar,et al.  Cost-Based Optimization of Service Compositions , 2013, IEEE Transactions on Services Computing.

[3]  António Caetano,et al.  Avaliação de Desempenho , 2013 .

[4]  I-Ling Yen,et al.  QoS-Driven Service Composition with Reconfigurable Services , 2013, IEEE Transactions on Services Computing.

[5]  Colin J. Fidge,et al.  Resource Allocation and Scheduling of Multiple Composite Web Services in Cloud Computing Using Cooperative Coevolution Genetic Algorithm , 2011, ICONIP.

[6]  Mauricio G. C. Resende,et al.  GRASP with path-relinking for the generalized quadratic assignment problem , 2011, J. Heuristics.

[7]  John Zimmerman,et al.  I'm the mayor of my house: examining why people use foursquare - a social-driven location sharing application , 2011, CHI.

[8]  Raphaël Troncy,et al.  Linking events with media , 2010, I-SEMANTICS '10.

[9]  Ioannis Konstas,et al.  On social networks and collaborative recommendation , 2009, SIGIR.

[10]  Daoxu Chen,et al.  Reliability Prediction of Web Service Composition Based on DTMC , 2009, 2009 Third IEEE International Conference on Secure Software Integration and Reliability Improvement.

[11]  Michael J. Muller,et al.  Make new friends, but keep the old: recommending people on social networking sites , 2009, CHI.

[12]  Kishor S. Trivedi,et al.  SHARPE at the age of twenty two , 2009, PERV.

[13]  Jun Fang,et al.  A Context-Aware Services Mash-Up System , 2008, 2008 Seventh International Conference on Grid and Cooperative Computing.

[14]  Celso C. Ribeiro,et al.  TTT plots: a perl program to create time-to-target plots , 2007, Optim. Lett..

[15]  Kishor S. Trivedi,et al.  Stochastic Modeling of Composite Web Services for Closed-Form Analysis of Their Performance and Reliability Bottlenecks , 2007, ICSOC.

[16]  Pierre L'Ecuyer,et al.  TestU01: A C library for empirical testing of random number generators , 2006, TOMS.

[17]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[18]  Piero A. Bonatti,et al.  On optimal service selection , 2005, WWW '05.

[19]  Mike P. Papazoglou,et al.  Service-oriented computing: concepts, characteristics and directions , 2003, Proceedings of the Fourth International Conference on Web Information Systems Engineering, 2003. WISE 2003..

[20]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[21]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[22]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[23]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .