Effective Web Service Composition in Diverse and Large-Scale Service Networks

IEEE Transactions on Services Computing

Volumn 1, Issue 1, 2008, Pages 15-32

  Oh, Seog Chan ^a   Lee, Dongwon ^b   Kumara, Soundar R T ^c  

^a GENERAL MOTORS CORPORATION   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c The Pennsylvania State University   (United States)

Author keywords

AI planning; benchmark; complex network; Web service composition

Indexed keywords

AI PLANNING; AUTOMATIC COMPOSITIONS; BENCHMARK; COMPLEX NETWORK; DISTRIBUTED APPLICATIONS; ERROR-PRONE; INTEGRAL PARTS; NETWORK ANALYSIS; NETWORK OPTIMIZATION PROBLEMS; RESEARCH FIELDS; SERVICE COMPOSITIONS; SERVICE NETWORKS; SERVICE-ORIENTED ARCHITECTURES; SOFTWARE COMPONENTS; WEB SERVICE COMPOSITION; WEB-SERVICE;

BENCHMARKING; ELECTRIC NETWORK ANALYSIS; HEURISTIC ALGORITHMS; INFORMATION DISSEMINATION; INFORMATION SERVICES; SILVER; WEB SERVICES; WIRELESS TELECOMMUNICATION SYSTEMS;

WORLD WIDE WEB;

EID: 70449419385     PISSN: 19391374     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSC.2008.1     Document Type: Article

References (34)

1. T. Berners-Lee, J. Hendler, and O. Lassila, “The Semantic Web,” Scientific Am., vol. 284, no. 5, pp. 34–43, 2001
2. M. Cantera, “IT Professional Services Forecast and Trends for Web Services,” Technical Report ITES-WW-MT-0116, Gartner, 2004
3. B. Medjahed, A. Bouguettaya, and A. Elmagarmid, “Composing Web Services on the Semantic Web,” The VLDB J., vol. 12, pp. 333–351, 2003
4. EEE05, http://www.comp.hkbu.edu.hk/eee05/contest/, Mar. 2005
5. ICEBE05, http://www.comp.hkbu.edu.hk/ctr/wschallenge/, May 2006
6. S.-C. Oh, H. Kil, D. Lee, and S. Kumara, “WSBen: A Web Services Discovery and Composition Benchmark,” Proc. Fourth Int'l IEEE Conf. Web Service (ICWS '06), pp. 239–246, 2006
7. S.-C. Oh, D. Lee, and S. Kumara, “WSPR: A Heuristic Algorithm for Web Service Composition,” Int'l J. Web Services Research (IJWSR '07), vol. 4, no. 1, 2007
8. N.J. Nilsson, Artificial Intelligence: A New Synthesis. Morgan Kaufmann, 2001
9. T. Bylander, “The Computational Complexity of Propositional Strips Planning,” Artificial Intelligence, vol. 69, nos. 1–2, pp. 165–204, 1994
10. B. Bonet and H. Geffner, “Planning as Heuristic Search,” Artificial Intelligence, vol. 129, nos. 1–2, pp. 5–33, 2001
11. P. Haslum and H. Geffner, “Admissible Heuristics for Optimal Planning,” Proc. Fifth Int'l Conf. Artificial Intelligence Planning and Scheduling Systems (AIPS '00), pp. 140–149, 2000
12. C. Kwok and D. Weld, “Planning to Gather Information,” Proc. 13th Nat'l Conf. Artificial Intelligence (AAAI '96), pp. 32–39, 1996
13. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach. Prentice-Hall, 2002
14. E. Sirin, B. Parsia, D. Wu, J. Hendler, and D. Nau, “HTN Planning for Web Service Composition Using SHOP2,” J. Web Semantics, vol. 1, no. 4, pp. 377–396, 2004
15. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. MIT Press and McGraw-Hill, 2001
16. J. Fan and S. Kambhampati, “A Snapshot of Public Web Services,” SIGMOD Record, vol. 34, no. 1, pp. 24–32, 2005
17. R. Albert and A. Barabasi, “Statistical Mechanics of Complex Networks,” Rev. Modern Physics, vol. 74, no. 1, pp. 47–95, 2002
18. P. Erdos, R. Graham, and J. Nesetril, The Mathematics of Paul Erdos. Springer-Verlag, 1996
19. D. Watts and S. Strogatz, “Collective Dynamics of 'Small-World' Networks,” Nature, vol. 393, no. 4, pp. 440–442, 1998
20. J. Delgado, “Emergence of Social Conventions in Complex Networks,” Artificial Intelligence, vol. 141, pp. 171–185, 2002
21. D. Watts, The Dynamics of Networks between Order and Randomness. Princeton Univ. Press, 1999
22. R. Albert and A.-L. Barabasi, “Topology of Evolving Networks,” Physical Rev. Letters, vol. 85, pp. 5234–5237, 2000
23. R. Albert, H. Jeong, and A.-L. Barabasi, “The Diameter of the World Wide Web,” Nature, vol. 401, pp. 130–131, 1999
24. D. McDermott, “A Heuristic Estimator for Means-Ends Analysis in Planning,” Proc. Third Int'l Conf. Artificial Intelligence Planning Systems (AIPS '96), pp. 142–149, 1996
25. A. Blum and M. Furst, “Fast Planning through Planning Graph Analysis,” Artificial Intelligence, vol. 90, pp. 281–300, 1997
26. J. Hoffmann and B. Nebel, “The FF Planning System: Fast Plan Generation through Heuristic Search,” J. Artificial Intelligence Research, vol. 14, pp. 253–302, 2001
27. B. Selman and H. Kautz, “Domain-Independent Extension to GSAT: Solving Large Structured Satisfiability Problems,” Proc. 13th Int'l Joint Conf. Artificial Intelligence (IJCAI '93), pp. 290–295, 1993
28. K. Sivashanmugam, K. Verma, A. Sheth, and J. Miller, “Adding Semantics to Web Services Standards,” Proc. First IEEE Int'l Conf. Web Services (ICWS '03), pp. 395–401, 2003
29. S. Ghandeharizadeh, C. Knoblock, C. Papadopoulos, C. Shahabi, E. Alwagait, J. Ambite, M. Cai, C.-C. Chen, P. Pol, R. Schmidt, and S. Saihong, “Proteus: A System for Dynamically Composing and Intelligently Executing Web Services,” Proc. First IEEE Int'l Conf. Web Services (ICWS '03), pp. 17–21, 2003
30. I. Altintas, E. Jaeger, K. Lin, B. Ludaescher, and A. Menon, “A Web Service Composition and Deployment Framework for Scientific Workflows,” Proc. Second IEEE Int'l Conf. Web Services (ICWS '04), pp. 814–815, 2004
31. H. Sun, X. Wang, B. Zhou, and P. Zou, “Research and Implementation of Dynamic Web Services Composition,” Lecture Notes in Computer Science, Sept. 2003
32. H. Kautz and B. Selman, “Unifying Sat-Based and Graph-Based Planning,” Proc. 16th Int'l Joint Conf. Artificial Intelligence (IJCAI '99), pp. 318–325, 1999
33. S.-C. Oh, D. Lee, and S. Kumara, “A Comparative Illustration of AI Planning-Based Web Services Composition,” ACM SIGecom Exchanges, vol. 5, no. 5, pp. 1–10, 2005
34. L. Zeng, B. Benatallah, M. Kalagnama, and Q.Z. Sheng, “Quality Driven Web Services Composition,” Proc. 12th Int'l Conf. World Wide Web (WWW '03), pp. 411–421, 2003