ABSTRACT 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 polynomial time. We designed and implemented both exact and heuristic (suboptimal) algorithms for the hard case, and carried out a preliminary experimental evaluation with interesting results.
Citations
| 7716 | Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 166 | P-Grid: A self-organizing access structure for p2p information systems – Aberer - 2001 |
| 144 | Greedy strikes back: Improved facility location algorithms – Guha, Khuller - 1999 |
| 64 | A new greedy approach for facility location problems – Jain, Mahdian, et al. - 2002 |
| 7 | An Extensible Directory Enabling Efficient Semantic Web Service Integration – Constantinescu, Binder, et al. - 2004 |
| 6 | A Quality of Service Management Framework Based on User Expectations – Deora, Shao, et al. - 2003 |
| 5 | Towards service description logics – Bonatti - 2002 |
| 5 | Type-based composition of information services in large scale environments – Constantinescu, Faltings, et al. - 2004 |
| 2 | Service discovery and orchestration for distributed service repositories – Fikouras, Freiter - 2003 |
