TY - GEN
T1 - Continuous query for QoS-aware automatic service composition
AU - Jiang, Wei
AU - Hu, Songlin
AU - Lee, Dongwon
AU - Gong, Shuai
AU - Liu, Zhiyong
PY - 2012
Y1 - 2012
N2 - Current QoS-aware automatic service composition queries over a network of Web services are often one-time innature. After a network of Web services is built, such queries are issued once, and answers are found from the scratch. The underlying assumption is that the participating Web services are rather static so that their functional and non-functional parameters seldom change. However, such an assumption is often baseless. New services come and go, service APIs change gradually, and QoS values fluctuate. Therefore, a support for efficiently handling "continuous" service composition queries is desired. In this paper, we propose an event driven continuous query algorithm for QoS-aware automatic service composition problem to cope with different types of dynamic services. Moreover, we integrated this algorithm in our service composition system, QSynth. Finally, we evaluate our proposal using both real QoS data and synthetic Web service data and show the superior performance of ours, compared to the state-of-the art solution which won the performance championship of Web Service Challenge in 2009 and 2010.
AB - Current QoS-aware automatic service composition queries over a network of Web services are often one-time innature. After a network of Web services is built, such queries are issued once, and answers are found from the scratch. The underlying assumption is that the participating Web services are rather static so that their functional and non-functional parameters seldom change. However, such an assumption is often baseless. New services come and go, service APIs change gradually, and QoS values fluctuate. Therefore, a support for efficiently handling "continuous" service composition queries is desired. In this paper, we propose an event driven continuous query algorithm for QoS-aware automatic service composition problem to cope with different types of dynamic services. Moreover, we integrated this algorithm in our service composition system, QSynth. Finally, we evaluate our proposal using both real QoS data and synthetic Web service data and show the superior performance of ours, compared to the state-of-the art solution which won the performance championship of Web Service Challenge in 2009 and 2010.
UR - http://www.scopus.com/inward/record.url?scp=84866381204&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84866381204&partnerID=8YFLogxK
U2 - 10.1109/ICWS.2012.44
DO - 10.1109/ICWS.2012.44
M3 - Conference contribution
AN - SCOPUS:84866381204
SN - 9780769547527
T3 - Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012
SP - 50
EP - 57
BT - Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012
T2 - 2012 IEEE 19th International Conference on Web Services, ICWS 2012
Y2 - 24 June 2012 through 29 June 2012
ER -