A scalable approach for QoS-based web service selection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5472 LNCS, Issue , 2009, Pages 190-199

  Alrifai, Mohammad ^a   Risse, Thomas ^a   Dolog, Peter ^b   Nejdl, Wolfgang ^a  

^a L3S RESEARCH CENTER   (Germany)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

0-1 KNAPSACK PROBLEM; DYNAMIC APPLICATIONS; EXPERIMENTAL EVALUATION; LINEAR PROGRAMMING TECHNIQUES; LINEAR PROGRAMS; NP-HARD; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; QUALITY REQUIREMENTS; RUNTIMES; SCALABLE APPROACH; SERVICE SELECTION; SOLVING METHOD; SUB-PROBLEMS; WEB SERVICE SELECTION;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; COMPUTER SCIENCE; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION; QUALITY OF SERVICE; TECHNICAL PRESENTATIONS;

PROBLEM SOLVING;

EID: 70350623226     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01247-1_20     Document Type: Conference Paper

References (12)

1. OASIS: Web services business process execution language (April 2007), http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf
2. Pisinger, D.: Algorithms for Knapsack Problems. PhD thesis, University of Copenhagen, Dept. of Computer Science (1995)
3. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)
4. Zeng, L., Benatallah, B., Dumas, M., Kalagnanam, J., Sheng, Q.Z.: Quality driven web services composition. In: WWW, pp. 411-421 (2003)
5. Ardagna, D., Pernici, B.: Adaptive service composition in flexible processes. IEEE Trans. Software Eng. 33(6), 369-384 (2007)
6. Liu, Y., Ngu, A.H.H., Zeng, L.: Qos computation and policing in dynamic web service selection. In: WWW, pp. 66-73 (2004)
7. Yu, T., Zhang, Y., Lin, K.J.: Efficient algorithms for web services selection with end-to-end qos constraints. ACM Trans. Web 1(1), 6 (2007)
8. Maros, I.: Computational Techniques of the Simplex Method. Springer, Heidelberg (2003)
9. Li, F., Yang, F., Shuang, K., Su, S.: Q-peer: A decentralized QOS registry architecture for web services. In: Krämer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 145-156. Springer, Heidelberg (2007)
10. Yoon, K.P., Hwang, C.L.: Multiple Attribute Decision Making: An Introduction (Quantitative Applications in the Social Sciences). Sage Publications, Thousand Oaks (1995)
11. Berkelaar, M., Kjell Eikland, P.N.: Open source (mixed-integer) linear programming system. Sourceforge, http://lpsolve.sourceforge.net/
12. Al-Masri, E., Mahmoud, Q.H.: Investigating web services on the world wide web. In: WWW (2008)