A scalable approach for QoS-based web service selection

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

External Research Organisations

  • Aalborg University
View graph of relations

Details

Original languageEnglish
Title of host publicationService-Oriented Computing
Subtitle of host publication ICSOC 2008 Workshops - ICSOC 2008 International Workshops, Revised Selected Papers
Pages190-199
Number of pages10
ISBN (electronic)978-3-642-01247-1
Publication statusPublished - 2009
EventInternational Conference on Service-Oriented Computing, ICSOC 2008 - Sydney, NSW, Australia
Duration: 1 Dec 20081 Dec 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5472 LNCS
ISSN (Print)0302-9743
ISSN (electronic)1611-3349

Abstract

QoS-based service selection aims at finding the best component services that satisfy the end-to-end quality requirements. The problem can be modeled as a multi-dimension multi-choice 0-1 knapsack problem, which is known as NP-hard. Recently published solutions propose using linear programming techniques to solve the problem. However, the poor scalability of linear program solving methods restricts their applicability to small-size problems and renders them inappropriate for dynamic applications with run-time requirements. In this paper, we address this problem and propose a scalable QoS computation approach based on a heuristic algorithm, which decomposes the optimization problem into small sub-problems that can be solved more efficiently than the original problem. Experimental evaluations show that near-to-optimal solutions can be found using our algorithm much faster than using linear programming methods.

ASJC Scopus subject areas

Cite this

A scalable approach for QoS-based web service selection. / Alrifai, Mohammad; Risse, Thomas; Dolog, Peter et al.
Service-Oriented Computing: ICSOC 2008 Workshops - ICSOC 2008 International Workshops, Revised Selected Papers. 2009. p. 190-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5472 LNCS).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Alrifai, M, Risse, T, Dolog, P & Nejdl, W 2009, A scalable approach for QoS-based web service selection. in Service-Oriented Computing: ICSOC 2008 Workshops - ICSOC 2008 International Workshops, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5472 LNCS, pp. 190-199, International Conference on Service-Oriented Computing, ICSOC 2008, Sydney, NSW, Australia, 1 Dec 2008. https://doi.org/10.1007/978-3-642-01247-1_20
Alrifai, M., Risse, T., Dolog, P., & Nejdl, W. (2009). A scalable approach for QoS-based web service selection. In Service-Oriented Computing: ICSOC 2008 Workshops - ICSOC 2008 International Workshops, Revised Selected Papers (pp. 190-199). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5472 LNCS). https://doi.org/10.1007/978-3-642-01247-1_20
Alrifai M, Risse T, Dolog P, Nejdl W. A scalable approach for QoS-based web service selection. In Service-Oriented Computing: ICSOC 2008 Workshops - ICSOC 2008 International Workshops, Revised Selected Papers. 2009. p. 190-199. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-01247-1_20
Alrifai, Mohammad ; Risse, Thomas ; Dolog, Peter et al. / A scalable approach for QoS-based web service selection. Service-Oriented Computing: ICSOC 2008 Workshops - ICSOC 2008 International Workshops, Revised Selected Papers. 2009. pp. 190-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Download
@inproceedings{6c2ab38c62bb419c8ce36d408801112a,
title = "A scalable approach for QoS-based web service selection",
abstract = "QoS-based service selection aims at finding the best component services that satisfy the end-to-end quality requirements. The problem can be modeled as a multi-dimension multi-choice 0-1 knapsack problem, which is known as NP-hard. Recently published solutions propose using linear programming techniques to solve the problem. However, the poor scalability of linear program solving methods restricts their applicability to small-size problems and renders them inappropriate for dynamic applications with run-time requirements. In this paper, we address this problem and propose a scalable QoS computation approach based on a heuristic algorithm, which decomposes the optimization problem into small sub-problems that can be solved more efficiently than the original problem. Experimental evaluations show that near-to-optimal solutions can be found using our algorithm much faster than using linear programming methods.",
author = "Mohammad Alrifai and Thomas Risse and Peter Dolog and Wolfgang Nejdl",
year = "2009",
doi = "10.1007/978-3-642-01247-1_20",
language = "English",
isbn = "978-3-642-01246-4",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "190--199",
booktitle = "Service-Oriented Computing",
note = "International Conference on Service-Oriented Computing, ICSOC 2008 ; Conference date: 01-12-2008 Through 01-12-2008",

}

Download

TY - GEN

T1 - A scalable approach for QoS-based web service selection

AU - Alrifai, Mohammad

AU - Risse, Thomas

AU - Dolog, Peter

AU - Nejdl, Wolfgang

PY - 2009

Y1 - 2009

N2 - QoS-based service selection aims at finding the best component services that satisfy the end-to-end quality requirements. The problem can be modeled as a multi-dimension multi-choice 0-1 knapsack problem, which is known as NP-hard. Recently published solutions propose using linear programming techniques to solve the problem. However, the poor scalability of linear program solving methods restricts their applicability to small-size problems and renders them inappropriate for dynamic applications with run-time requirements. In this paper, we address this problem and propose a scalable QoS computation approach based on a heuristic algorithm, which decomposes the optimization problem into small sub-problems that can be solved more efficiently than the original problem. Experimental evaluations show that near-to-optimal solutions can be found using our algorithm much faster than using linear programming methods.

AB - QoS-based service selection aims at finding the best component services that satisfy the end-to-end quality requirements. The problem can be modeled as a multi-dimension multi-choice 0-1 knapsack problem, which is known as NP-hard. Recently published solutions propose using linear programming techniques to solve the problem. However, the poor scalability of linear program solving methods restricts their applicability to small-size problems and renders them inappropriate for dynamic applications with run-time requirements. In this paper, we address this problem and propose a scalable QoS computation approach based on a heuristic algorithm, which decomposes the optimization problem into small sub-problems that can be solved more efficiently than the original problem. Experimental evaluations show that near-to-optimal solutions can be found using our algorithm much faster than using linear programming methods.

UR - http://www.scopus.com/inward/record.url?scp=70350623226&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-01247-1_20

DO - 10.1007/978-3-642-01247-1_20

M3 - Conference contribution

AN - SCOPUS:70350623226

SN - 978-3-642-01246-4

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

SP - 190

EP - 199

BT - Service-Oriented Computing

T2 - International Conference on Service-Oriented Computing, ICSOC 2008

Y2 - 1 December 2008 through 1 December 2008

ER -

By the same author(s)