TY - JOUR
T1 - Policy-aware service composition
T2 - Predicting parallel execution performance of composite services
AU - Trang, Mai Xuan
AU - Murakami, Yohei
AU - Ishida, Toru
N1 - Funding Information:
This research was partly supported by a Grant-in-Aid for Scientific Research (S) (24220002, 2012-2016) from Japan Society for Promotion of Science (JSPS).
Publisher Copyright:
ß 2015 IEEE.
PY - 2018
Y1 - 2018
N2 - With the increasing volume of data to be analysed, one of the challenges in Service Oriented Architecture (SOA) is to make web services efficient in processing large-scale data. Parallel execution and cloud technologies are the keys to speed-up the service invocation. In SOA, service providers typically employ policies to limit parallel execution of the services based on arbitrary decisions. In order to attain optimal performance improvement, users need to adapt to the services policies. A composite service is a combination of several atomic services provided by various providers. To use parallel execution for greater composite service efficiency, the degree of parallelism (DOP) of the composite services need to be optimized by considering the policies of all atomic services. We propose a model that embeds service policies into formulae to calculate composite service performance. From the calculation, we predict the optimal DOP for the composite service, where it attains the best performance. Extensive experiments are conducted on real-world translation services. We use several measures such as mean prediction error (MPE), mean absolute deviation (MAD) and tracking signal (TS) to evaluate our model. The analysis results show that our proposed model has good prediction accuracy in identifying optimal DOPs for composite services.
AB - With the increasing volume of data to be analysed, one of the challenges in Service Oriented Architecture (SOA) is to make web services efficient in processing large-scale data. Parallel execution and cloud technologies are the keys to speed-up the service invocation. In SOA, service providers typically employ policies to limit parallel execution of the services based on arbitrary decisions. In order to attain optimal performance improvement, users need to adapt to the services policies. A composite service is a combination of several atomic services provided by various providers. To use parallel execution for greater composite service efficiency, the degree of parallelism (DOP) of the composite services need to be optimized by considering the policies of all atomic services. We propose a model that embeds service policies into formulae to calculate composite service performance. From the calculation, we predict the optimal DOP for the composite service, where it attains the best performance. Extensive experiments are conducted on real-world translation services. We use several measures such as mean prediction error (MPE), mean absolute deviation (MAD) and tracking signal (TS) to evaluate our model. The analysis results show that our proposed model has good prediction accuracy in identifying optimal DOPs for composite services.
KW - Degree of parallelism
KW - Parallel execution
KW - Performance prediction
KW - Service composition
KW - Service policy
UR - http://www.scopus.com/inward/record.url?scp=85043379983&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85043379983&partnerID=8YFLogxK
U2 - 10.1109/TSC.2015.2467330
DO - 10.1109/TSC.2015.2467330
M3 - Article
AN - SCOPUS:85043379983
SN - 1939-1374
VL - 11
SP - 602
EP - 615
JO - IEEE Transactions on Services Computing
JF - IEEE Transactions on Services Computing
IS - 4
ER -