2010 IEEE International Conference on Web Services 2010
DOI: 10.1109/icws.2010.90
|View full text |Cite
|
Sign up to set email alerts
|

QoS Aware Semantic Web Service Composition Approach Considering Pre/Postconditions

Abstract: Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability of service composition. During composition we consider QoS and pre-/post-conditions of single services to create a composite service satisfying the user needs the best. Regarding pre-/post-conditions we propose an approach to fast determination of which services produce results expected by the user, i.e. the post-condition of which services implicates the desired condition defined in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0
2

Year Published

2011
2011
2015
2015

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 43 publications
(27 citation statements)
references
References 14 publications
0
25
0
2
Order By: Relevance
“…Inspired by Dijkstra algorithm [19], we make use of a similar order to update the status of affected services. The distance changes 4 in Dijkstra algorithm are +∞ → X (0 < X < +∞). In our problem, for the first category of affected services whose allQoS got improved, we can handle it like Dijkstra algorithm; For the second category, we transform it into the first category by assigning the original allQoS of these services to +∞, while its new allQoS is not reassigned.…”
Section: B Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…Inspired by Dijkstra algorithm [19], we make use of a similar order to update the status of affected services. The distance changes 4 in Dijkstra algorithm are +∞ → X (0 < X < +∞). In our problem, for the first category of affected services whose allQoS got improved, we can handle it like Dijkstra algorithm; For the second category, we transform it into the first category by assigning the original allQoS of these services to +∞, while its new allQoS is not reassigned.…”
Section: B Algorithmmentioning
confidence: 99%
“…A final affected service means its allQoS is different from the original value after all affections are processed. 4 Let Vs be the start node, the distance of every node is the distance from Vs to it. Then, a forward search is conducted from Vs, all the reachable nodes are inserted into a priority queue with their distances.…”
Section: B Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…The majority of existing composition approaches can be considered as symbolic techniques that base on explicitly given information [5][6][7][8][9][10][11][12][13][14][15]. Alternatively, machine learning techniques are proposed to replace symbolic techniques (cf.…”
Section: Introductionmentioning
confidence: 99%