A service response selection algorithm is proposed to maximize service provider's benefits(SPB)when service requests arrived exceed provider's capabilities. The nature of SPB is the embodiment of provider's value and the income is only a common form of SPB. The response effective degree(RED)is used to express the effective levels of service response and estimated based on historical similar requests. The response benefits degree(RBD)is used for expressing the effects of one response to SPB
and is obtained by using benefit targets decomposition and relationship mapping to foundation data of service environment. The experimental results show that the proposed approach improves the success rate of service response
reduces the failure rate and waiting timeout rate
and hence improves the overall SPB. The approach can not only be used to solve the response selection problem
but also provide much help to service designers to get better combination between service targets and execution environment
and to improve the cooperation level between requester and provider.
关键词
Keywords
references
PAPAZOGLOU M P, GEORGAKOPOULOS D. Service-oriented computing[J]. Communications of the ACM, 2003, 46(10): 25-28.
PAPAZOGLOU M P. Service-oriented computing: concepts, characteristics and directions[C]∥Proceedings of the Fourth International Conference on Web Information Systems Engineering. Washington, DC, USA: IEEE CS, 2003: 3-12.
DU L, DUAN C, LIU S, et al. Research on service bus for distributed real-time control systems[C]∥Proceedings of 2011 6th IEEE Joint International Information Technology and Artificial Intelligence Conference. Washington, DC, USA: IEEE CS, 2011: 401-405.
LI W, TORDSSON J E E. An aspect-oriented approach to consistency-preserving caching and compression of Web service response messages[C]∥Proceeding of 2010 IEEE Eighth International Conference on Web Services. Washington, DC, USA: IEEE CS, 2010: 526-533.
LI H. A queue theory based response time model for Web services chain[C]∥Proceeding of 2010 International Conference on Computational Intelligence and Software Engineering. Piscataway, NJ, USA: IEEE, 2010: 1-4.
NIE W, ZHANG J, LIN K J. Estimating real-time service process response time using server utilizations[C]∥Proceeding of 2010 IEEE International Conference on Service-Oriented Computing and Applications. Washington, DC, USA: IEEE CS, 2010: 1-8.
SCHARF M. On the response time of the large-scale composite Web services[EB/OL]. [2012-06-05]. http:∥www.ikr.uni-stuttgart.de/Content/Publications/Archive/Sf_ITC19_36420.pdf.
REIFF-MARGANIEC S, YU H, TILLY M. Service selection based on non-functional properties [J]. Lecture Notes in Computer Science, 2009, 4907: 128-138.
YU T, ZHANG Y, LIN K J. Efficient algorithms for Web services selection with end-to-end QoS constraints [J]. ACM Transactions on the Web, 2007, 1(1): 6.
ARDAGNA D, PERNICI B. Global and local QoS guarantee in web service selection[J]. Lecture Notes in Computer Science, 2006, 3812: 32-46.
WANG Xianzhi, XU Xiaofei, WANG Zhongjie. A profit optimization oriented service selection method for dynamic service composition[J]. Chinese Journal of Computers, 2010,33(11):2104-2115.
ZHANG Chengwen, SU Sen, CHEN Junliang. Genetic algorithm on Web services selection supporting QoS[J]. Chinese Journal of Computers, 2006, 29(7):1029-1037.
FAN Xiaoqin, JIANG Cangjun, FANG Xianwen, et al. Dynamic Web service selection based on discrete particle swarm optimization[J]. Journal of Computer Research and Development, 2010, 47(1): 147-156.
HU Jianqiang, LI Juanzi, LIAO Guiping. A multi-QoS based local optimal model of service selection[J]. Chinese Journal of Computers, 2010, 33(3):526-534.