Efficient Dynamic Evolution of Service Composition

Current QoS-aware automatic service composition queries over a network of web services are often one-time in nature. After a network of web services is built, such queries are issued once, and answers are found from the scratch. The underlying assumption is that the participating web services are rather static, which means that their functional and non-functional parameters seldom change. However, such an assumption is often baseless. New services come and go, service APIs change gradually, and QoS values fluctuate in practice. Therefore, a support for efficiently adapting service composition is desired. In this paper, we propose an event driven continuous query algorithm to intelligently cope with different types of dynamic services, and thus enable evolution of service composition. Evaluation using both real QoS data and synthetic web service data shows its superior performance, compared with the state-of-the-art solution which won the performance championship of Web Service Challenge in 2009 and 2010. Moreover, we generalize a new graph problem: dynamic single-source optimal-Directed Acyclic Graphs (DAG) problem based on the above work. It is argued that API recommendation for framework evolution, as another typical application, could also be modeled and addressed efficiently using the proposed new graph approach.

[1]  Giuseppe F. Italiano,et al.  Fully dynamic all pairs shortest paths with real edge weights , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[2]  Koustuv Dasgupta,et al.  Adaptation inWeb Service Composition and Execution , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[3]  Fuyuki Ishikawa,et al.  QoS-Aware Automatic Service Composition by Applying Functional Clustering , 2011, 2011 IEEE International Conference on Web Services.

[4]  Hans-Arno Jacobsen,et al.  The PADRES Distributed Publish/Subscribe System , 2005, FIW.

[5]  Hans-Arno Jacobsen,et al.  Efficient event-based resource discovery , 2009, DEBS '09.

[6]  Yanlong Zhai,et al.  SOA Middleware Support for Service Process Reconfiguration with End-to-End QoS Constraints , 2009, 2009 IEEE International Conference on Web Services.

[7]  Amin Vahdat,et al.  Measuring and characterizing end-to-end Internet service performance , 2003, TOIT.

[8]  Wei Jiang,et al.  Continuous Query for QoS-Aware Automatic Service Composition , 2012, 2012 IEEE 19th International Conference on Web Services.

[9]  Liang Chen,et al.  CBBCM: Clustering Based Automatic Service Composition , 2011, 2011 IEEE International Conference on Services Computing.

[10]  Jennifer Widom,et al.  STREAM: The Stanford Stream Data Manager , 2003, IEEE Data Eng. Bull..

[11]  Eyhab Al-Masri,et al.  Investigating web services on the world wide web , 2008, WWW.

[12]  Danilo Ardagna,et al.  Adaptive Service Composition in Flexible Processes , 2007, IEEE Transactions on Software Engineering.

[13]  Annapaola Marconi,et al.  Synthesis and Composition of Web Services , 2009, SFM.

[14]  Shimon Even,et al.  Updating distances in dynamic graphs , 1985 .

[15]  Mária Bieliková,et al.  QoS Aware Semantic Web Service Composition Approach Considering Pre/Postconditions , 2010, 2010 IEEE International Conference on Web Services.

[16]  Mikkel Thorup,et al.  Speeding Up Dynamic Shortest-Path Algorithms , 2008, INFORMS J. Comput..

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  Pascal Poizat,et al.  Self-Adaptive Service Composition Through Graphplan Repair , 2010, 2010 IEEE International Conference on Web Services.

[19]  Hans Rohnert,et al.  A Dynamization of the All Pairs Least Cost Path Problem , 1985, STACS.

[20]  Amit P. Sheth,et al.  Optimal Adaptation in Web Processes with Coordination Constraints , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[21]  Wei Jiang,et al.  APISynth: a new graph-based API recommender system , 2014, ICSE Companion.

[22]  Tao Xie,et al.  Parseweb: a programmer assistant for reusing open source code on the web , 2007, ASE.

[23]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[24]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[25]  Wei Wu,et al.  AURA: a hybrid approach to identify framework evolution , 2010, 2010 ACM/IEEE 32nd International Conference on Software Engineering.

[26]  Rajeev Raman,et al.  Recent results on the single-source shortest paths problem , 1997, SIGA.

[27]  David J. DeWitt,et al.  NiagaraCQ: a scalable continuous query system for Internet databases , 2000, SIGMOD '00.

[28]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[29]  Eyhab Al-Masri,et al.  QoS-based Discovery and Ranking of Web Services , 2007, 2007 16th International Conference on Computer Communications and Networks.

[30]  Wei Jiang,et al.  QSynth: A Tool for QoS-aware Automatic Service Composition , 2010, 2010 IEEE International Conference on Web Services.

[31]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2004, JACM.

[32]  Tao Yu,et al.  Efficient algorithms for Web services selection with end-to-end QoS constraints , 2007, TWEB.

[33]  Pascal Poizat,et al.  Repair vs. Recomposition for Broken Service Compositions , 2010, ICSOC.

[34]  Rastislav Bodík,et al.  Jungloid mining: helping to navigate the API jungle , 2005, PLDI '05.

[35]  Valérie Issarny,et al.  QoS-Aware Service Composition in Dynamic Service Oriented Environments , 2009, Middleware.

[36]  Wei Jiang,et al.  QoS-Aware Automatic Service Composition: A Graph View , 2011, Journal of Computer Science and Technology.

[37]  Wolfgang Emmerich,et al.  Efficient online monitoring of web-service SLAs , 2008, SIGSOFT '08/FSE-16.

[38]  William B. Frakes,et al.  Software reuse research: status and future , 2005, IEEE Transactions on Software Engineering.

[39]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[40]  Mira Mezini,et al.  Ieee Transactions on Software Engineering 1 Automated Api Property Inference Techniques , 2022 .

[41]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[42]  Kajal T. Claypool,et al.  XSnippet: mining For sample code , 2006, OOPSLA '06.

[43]  Takahiro Kawamura,et al.  Semantic Matching of Web Services Capabilities , 2002, SEMWEB.

[44]  Dorothea Wagner,et al.  Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study , 2009, SEA.

[45]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[46]  Mohan Kumar,et al.  Dynamic Service Composition in Pervasive Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.