TY - GEN
T1 - Quality constraint driven local optimization for efficient service composition
AU - Jin, Jun
AU - Cao, Yuanda
AU - Zhang, Changyou
AU - Zhou, Ruitao
AU - Hu, Jingjing
PY - 2011
Y1 - 2011
N2 - Service composition can aggregate atomic Web services developed independently by their providers. However, with the increasing number of candidate services, the solutions based on global optimization and constraints cost much computation time, which make them inappropriate for real-time applications. In this paper, a heuristic service composition method, named LOEM-T (Local Optimization and Enumeration Method with Solution Tendency Estimation), is proposed. It aims to keep a small number of promising candidates for each task in service composition. As stringent constraints may lead to no feasible solutions, a notion of stringent degree, that can describe the influence of global constraints, is proposed. Then with the help of stringent degree, the candidates that are more excellent in the stringent constraints are prone to be preserved. The results of experimental evaluation shows that our approach is feasible and can achieve a near-optimal solution very efficiently.
AB - Service composition can aggregate atomic Web services developed independently by their providers. However, with the increasing number of candidate services, the solutions based on global optimization and constraints cost much computation time, which make them inappropriate for real-time applications. In this paper, a heuristic service composition method, named LOEM-T (Local Optimization and Enumeration Method with Solution Tendency Estimation), is proposed. It aims to keep a small number of promising candidates for each task in service composition. As stringent constraints may lead to no feasible solutions, a notion of stringent degree, that can describe the influence of global constraints, is proposed. Then with the help of stringent degree, the candidates that are more excellent in the stringent constraints are prone to be preserved. The results of experimental evaluation shows that our approach is feasible and can achieve a near-optimal solution very efficiently.
KW - QoS
KW - local optimization
KW - mixed integer programming
KW - service composition
KW - stringent degree
UR - https://www.scopus.com/pages/publications/84863127291
U2 - 10.1109/ICSSSM.2011.5959305
DO - 10.1109/ICSSSM.2011.5959305
M3 - Conference contribution
AN - SCOPUS:84863127291
SN - 9781612843094
T3 - 8th International Conference on Service Systems and Service Management - Proceedings of ICSSSM'11
BT - 8th International Conference on Service Systems and Service Management - Proceedings of ICSSSM'11
T2 - 8th International Conference on Service Systems and Service Management, ICSSSM'11
Y2 - 25 June 2011 through 27 June 2011
ER -