QoS-aware service evaluation and selection

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 1101-1112

  Tsesmetzis, Dimitrios ^a   Roussaki, Ioanna ^a   Sykas, Efstathios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Integer programming; Profit maximisation; QoS aware service selection; Selective multiple choice knapsack problem

Indexed keywords

ALGORITHMS; BANDWIDTH; CONSTRAINT THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

PROFIT MAXIMIZATION; QOS-AWARE SERVICE SELECTION; SELECTIVE MULTIPLE CHOICE KNAPSACK PROBLEM;

QUALITY OF SERVICE;

EID: 44649155633     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.07.015     Document Type: Article

References (29)

1. Aalst (van der) W.M.P., Hofstede (ter) A.H.M., Kiepuszewski B., and Barros A.P. Workflow patterns. Distributed and Parallel Databases 14 (2003) 5-51
2. Amigo-D3.3, 2006. Amigo Consortium, Deliverable D3.3: Amigo Middleware Core Enhanced: Prototype Implementation & Documentation.
3. Balas E., and Zemel E. An algorithm for large zero-one knapsack problems. Operations Research 28 (1980) 1130-1154
4. Bonatti, P.A., Festa, P., 2005. On optimal service selection. In: Proceedings of the 14th International World Wide Web Conference (WWW'05), Chiba, Japan.
5. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), McGraw-Hill, New York
6. Dantzig G.B. Discrete variable extremum problems. Operations Research 5 (1957) 266-277
7. Davis E.W., and Patterson J.H. A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Science 21 (1975) 944-955
8. Dembo R.S., and Hammer P.L. A reduction algorithm for knapsack problems. Methods of Operations Research 36 (1980) 49-60
9. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
10. Gruber T.R. Toward principles for the design of ontologies used for knowledge sharing. International Journal of Human - Computer Studies 43 (1995) 907-928
11. Heckbert, P., Garland, M., 1995. Survey of Surface Approximation Algorithms. Technical Report CMU-CS-95-194, Computer Science Department, Carnegie Mellon University.
12. Hoare C.A.R. Quicksort. Computer Journal 5 (1962) 10-15
13. Horowitz E., and Sahni S. Computing partitions with applications to the knapsack problem. Journal of ACM 21 (1974) 277-292
14. Hwang C.L., and Yoon K. Multiple Attribute Decision Making (1981), Springer-Verlag
15. Jaeger, M.C., Muhl, G., Golze, S. 2005. QoS-aware composition of web services: a look at selection algorithms. In: Proceedings of the IEEE International Conference on Web Services (ICWS'05), Orlando, FL, USA.
16. Korkmaz, T., Krunz, M. 2001. Multi-constrained optimal path selection. In: Proceedings of the 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'01), Alaska, USA.
17. Kucera L. The greedy coloring is a bad probabilistic algorithm. Journal of Algorithms 12 (1991) 674-684
18. Liu, Y., Ngu, A.H.H., Zeng, L., 2004. QoS computation and policing in dynamic web service selection. In: Proceedings of the 13th International World Wide Web Conference (WWW'04), New York, USA.
19. Matlab. http://www.mathworks.com/products/matlab/ (last accessed April 2007).
20. Martello S., and Toth P. Algorithms for knapsack problems. Annals of Discrete Mathematics 31 (1987) 70-79
21. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementation (1990), John Wiley & Sons Inc
22. Menascé D.A. QoS issues in web services. IEEE Internet Computing 6 (2002) 72-75
23. Paolucci, M., Kawamura, T., Payne, T.R., Sycara, K., 2002. Semantic matching of web services capabilities. In: Proceedings of the First International Semantic Web Conference (ISWC'02), Sardinia, Italy.
24. Papaioannou, I., Tsesmetzis, D., Roussaki, I., Anagnostou, M., 2006. A QoS ontology language for web-services. In: Proceedings of the IEEE 20th International Conference on Advanced Information Networking and Applications (AINA'06), Vienna, Austria.
25. Pisinger, D. 1995. Algorithms for Knapsack Problems, PhD Thesis, Department. of Computer Science, University of Copenhagen, Denmark.
26. Sinha A., and Zoltners A.A. The multiple-choice knapsack problem. Operations Research 2 (1979) 503-515
27. Taher, L., Khatib, H.E., Basha, R., 2005. A framework and QoS matchmaking algorithm for dynamic web services selection. In: Proceedings of the Second International Conference on Innovations in Information Technology (IIT'05), Dubai, United Arab Emirates.
28. Vu, L.H., Hauswirth, M., Aberer, K., 2005. QoS-based service selection and ranking with trust and reputation management. In: Proceedings of the International Conference on Cooperative Information Systems (CoopIS'05), Agia Napa, Cyprus.
29. Yu, T., Lin, K.J., 2005. Service selection algorithms for composing complex services with multiple QoS constraints. In: Proceedings of the Third International Conference on Service Oriented Computing (ICSOC'05), Amsterdam, Netherlands.