Name
Abstract | ||
|---|---|---|
Service composition has been recognized as a flexible way for resource sharing and application integration. Quality of service (QoS) is an important issue for composite services. In this paper, we address the issue of component services selection to ensures their composition satisfy given QoS constraints. We propose the concept of reduction tree as a general scheme to aggregate multi-dimensional quality. And then a heuristic algorithm MCSC_HEU is presented to find execution plans satisfying multiple QoS constrains, with the main idea of evaluating partial plans by a heuristic function during the course of reduction. The time complexity of MCSC_HEU is of polynomial level. Extensive evaluations show that MCSC_HEU succeeds in finding feasible plans with very high probability but demands much less time than exhausting search. So it is an efficient solution for QoS aware service selection with multiple constrains. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11577188_17 | NPC |
Keywords | Field | DocType |
composite service,qos aware service selection,multiple quality constraint,important issue,heuristic function,multiple qos,qos aware service composition,aggregate multi-dimensional quality,qos constraint,heuristic algorithm,service composition,component services selection,satisfiability,resource sharing,exhaustive search,time complexity,quality of service | Information system,Polynomial,Service quality,Heuristic (computer science),Parallel algorithm,Computer science,Quality of service,Shared resource,Time complexity,Distributed computing | Conference |
Volume | ISSN | ISBN |
3779 | 0302-9743 | 3-540-29810-X |
Citations | PageRank | References |
3 | 0.45 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bixin Liu | 1 | 9 | 3.04 |
| Quanyuan Wu | 2 | 153 | 26.73 |
| Yan Jia | 3 | 3 | 0.45 |
| Bin Zhou | 4 | 27 | 4.88 |