Proceedings of the 14th International Conference on World Wide Web - WWW '05 2005
DOI: 10.1145/1060745.1060823
|View full text |Cite
|
Sign up to set email alerts
|

On optimal service selection

Abstract: While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet been extensively studied. In this paper we formalize three kinds of optimal service selection problems, based on different criteria. Then we study their complexity and implement solutions. We prove that one-time costs make the optimal selection problem computationally hard; in the absence of these costs the problem can be solved in pol… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
59
0

Year Published

2006
2006
2015
2015

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 102 publications
(59 citation statements)
references
References 28 publications
(27 reference statements)
0
59
0
Order By: Relevance
“…the set of service providers to 13 invoke that meet user constraints and optimizes the QoS 14 according to some QoS criteria. This problem, named 15 QoS-aware Service Composition (QoSWSC) (Strunk, 16 2010), is NP-hard (Bonatti and Festa, 2005;Ardagna 17 and Pernici, 2005), and has been identified as a main 18 research problem in the SOC field (Papazoglou et al, 19 2007).…”
mentioning
confidence: 99%
“…the set of service providers to 13 invoke that meet user constraints and optimizes the QoS 14 according to some QoS criteria. This problem, named 15 QoS-aware Service Composition (QoSWSC) (Strunk, 16 2010), is NP-hard (Bonatti and Festa, 2005;Ardagna 17 and Pernici, 2005), and has been identified as a main 18 research problem in the SOC field (Papazoglou et al, 19 2007).…”
mentioning
confidence: 99%
“…In [6], the algorithm are heuristic in nature and gives more efficient rather the best or exact composition. There are approaches based on the service QoS parameters, have been proposed for service selection [8][9], which identifies optimal service from a set of functionally similar candidate services. Other similar approaches which proposed the dynamic service selection [5], skyline service selection [1], heuristic service selection [7].The work [10,11] suggested a rankingoriented collaborative filtering approach to rank movies books in digital libraries.…”
Section: Related Workmentioning
confidence: 99%
“…Second generation techniques are based on the solution of NP-hard optimization problems. In [63], the complexity of some variants of the global process optimization problem is analyzed, while an overview of heuristic techniques can be found in [62]. Global approaches have been proposed for the first time in [4], where the process optimization problem has been formalized as a MILP problem, solved by integer linear programming solvers.…”
Section: Related Workmentioning
confidence: 99%