LEARNING-BASED WEB SERVICE COMPOSITION IN UNCERTAIN ENVIRONMENTS
Keywords:
Web service composition, optimal policy, success rate of service compositionAbstract
Web service composition has two kinds of uncertain factors, including uncertain invocation results and uncertain quality of services. These uncertain factors affect success rate of service composition. The web service composition problem should be considered as an uncertain planning problem. This paper used Partially Observable Markov Decision Process to deal with the uncertain planning problem for service composition. According to the uncertain model, we propose a fast learning method, which is an uncertainty planning method, to compose web services. The method views invocations of web service as uncertain actions, and views service quality as partially observable variables. The method does not need to know complete information, instead uses an estimated value function to approach a real function and to obtain a composite service. Simulation experiments verify the validity of the algorithm, and the results also show that our method improves the success rate of the service composition and reduces computing time.
Downloads
References
P. DOSHI, R. GOODWIN, R. AKKIRAJU, and K. VERMA. Dynamic workflow composition
using Markov decision processes[J]. International Journal of Web Services Research, 2005, 2(1):
-17.
LUO YuanSheng, YANG Kun, TANG Qiang, ZHANG Jianmin, and XIONG Bin. A multi-criteria
network-aware service composition algorithm in wireless environments[J]. Computer
Communications, 2012, 35(15): 1882-1892.
C. RAPHAEL and G. SHANI. The Skyline algorithm for POMDP value function pruning[J].
Annals of mathematics and artificial intelligence, 2012, 65(1): 61-77.
L. AGUSSURJA and H. C. LAU. A POMDP Model for Guiding Taxi Cruising in a Congested
Urban City[M]. Lecture Notes in Artificial Intelligence, 2011, 7094: 415-428.
K. A. Yau, P. KOMISARCZUK. Reinforcement learning for context awareness and intelligence in
wireless networks: Review, new features and open issues[J]. Journal of Network and Computer
Applications, 2012, 35(1): 253-267.
WU Bin, DENG Shuiguang, LI Ying, WU Jian, and YIN Jianwei. AWSP: An Automatic Web
Service Planner Based on Heuristic State Space Search [C] // Proceedings of IEEE International
Conference on Web Services, USA: IEEE, 2011: 403-410.
P. RODRIGUEZ-MIER, M. MUCIENTES and M. LAMA. Automatic web service composition
with a heuristic-based search algorithm [C] // Proceedings of IEEE International Conference on
Web Services, ICWS, Washington, DC, USA: IEEE, 2011: 81-88.
FENG Yuzhang, A. VEERAMANI and R. KANAGASABAI. Automatic DAG-based service
composition: A model checking approach [C] // Proceedings of IEEE International Conference on
Web Services, ICWS, Honolulu, HI, USA: IEEE, 2012: 674-675.
JIANG Wei, HU Songlin, D. Lee, GONG Shuai, and LIU Zhiyong. Continuous Query for QoSAware
Automatic Service Composition [C] // Proceedings of IEEE International Conference on
Web Services, (ICWS), USA: IEEE, 2012: 50-57.
YAN Yuyong, CHEN Min and YANG Yubin. Anytime QoS optimization over the PlanGraph for
web service composition [C] // Proceedings of Annual ACM Symposium on Applied Computing,
Trento, Italy, USA: ACM, 2012:1968-1975.
GAO Aiqiang, YANG Dongqing, TANG Shiwei, and ZHANG Ming. Web service composition
using markov decision processes [C] // Proceedings of International Conference on Advances in
Web-Age Information Management, WAIM, Hangzhou, China, USA: IEEE, 2005: 308-319.
ZHAO Haibo and P. DOSHI. Composing nested Web processes using hierarchical semi-Markov
decision processes [C] // Proceedings of AAAI, Boston, MA, United states, USA: IEEE, 2006: 75-
,.
HARNEY J, DOSHI P. Risk sensitive value of changed information for selective querying of web
services [C] // Proceedings of 8th International Conference on Service Oriented Computing,
ICSOC, December 7-10, 2010, San Francisco, CA, United states, United states: Springer Verlag,
: 77-91.
CHEN Kun, XU Jiuyun and S. Reiff-Marganiec. Markov-HTN planning approach to enhance
flexibility of automatic Web services composition [C] // Proceedings of IEEE International
Conference on Web Services, ICWS, Los Angeles, CA, USA: IEEE, 2009: 9-16.
WANG Hongbing, XUAN Zhouy, ZHOU Xiang, Liu Weihong, and Li Wenya. Adaptive and
dynamic service composition using Q-learning [C] // Proceedings of International Conference on
Tools with Artificial Intelligence, ICTAI, Arras, France, USA: IEEE, 2010:145-152.
WANG Hongbing and GUO Xiaohui. An Adaptive Solution for Web Service Composition [C] //
Proceedings of World Congress on Services (SERVICES-1), USA: IEEE, 2010: 503-510,.
LI Lixing, JIN Zhi, LI Ge, ZHENG Liwei, and WEI Qiang. Modeling and Analyzing the
Reliability and Cost of Service Composition in the IoT: A Probabilistic Approach [C] //
Proceedings of IEEE International Conference on Web Services (ICWS), USA: IEEE, 2012: 584-
FAN Xiaoqin, JIANG Changjun, WANG Junli, and PANG Shanchen. Random-QoS-aware
reliable web service composition[J]. Ruan Jian Xue Bao/Journal of Software, 20, 2009:546-556.
WU Qing, LI Zenbang, YIN Yuyu, et al. Adaptive Service Selection Method in Mobile Cloud
Computing[J]. China Communications, 2012, 9(12): 46-55.
SUN Liang, YANG Dong, QIN Yajuan, et al. Energy-Aware Service Selection Method Based on
Sharing Routes in Wireless Sensor Networks[J]. China Communications, 2011, 8(8): 25-33.
SUN Qibo, WANG Wenbin, ZOU Hua, et al. A Service Selection Approach Based on
Availability-Aware in Mobile Ad Hoc Networks[J]. China Communications, 2011, 8(1SI): 87-94.
M. ALRIFAI, T. RISSE and W. NEJDL. A hybrid approach for efficient web service composition
with end-to-end QoS constraints[J]. ACM Transactions on the Web, United States,2012, 6.
A. R. CASSANDRA. Exact and approximate algorithms for partially observable markov decision
processes[D]. Brown University, 1998:447.
H. YANG and S. FONG, Optimizing dynamic supply chain formation in supply mesh using
CSET model[J], Information Systems Frontiers, 2012:1-20.
