1. 山东大学计算机科学与技术学院,济南,250100
2. 济南大学信息科学与工程学院,济南,250022
3. 山东省网络环境智能计算技术重点实验室,济南,250022
网络首发:2012-11-10,
纸质出版:2012
移动端阅览
杜立新 1, 2, 3, 等. 基于服务提供者获益的服务响应选择方法[J]. 西安交通大学学报, 2012,46(11):112-119.
A Service Response Selection Algorithm Based on Service Provider Benefits[J]. 2012, 46(11): 112-119.
针对当服务请求超出服务提供者能力的时候
服务提供者如何响应才能满足自身获益最大化问题进行了研究
指出服务提供者获益本质是其自身价值的体现
价格收益只是一种常见的获益形式.提出用响应有效度来表达服务响应的有效程度
并给出了基于历史相似服务请求的有效度估算方法; 同时采用响应获益度来表达一次响应对于服务提供者获益的影响
并详细说明了通过将获益目标分解和关系映射
最终使用服务环境基础数据项进行表达的方法.实验结果表明
通过历史相似服务请求对服务响应结果进行预估并据此进行响应选择
能够较好地提高服务响应的成功率
降低失败率和等待超时率
进而提高整体服务提供者获益水平.所提方法不仅适用于服务响应问题的解决
同时有助于服务设计者在设计时更好地将服务目标与服务环境相结合
以提高服务请求者与提供者的协作水平.
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.
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.
王显志,徐晓飞,王忠杰. 面向组合服务收益优化的动态服务选择方法[J].计算机学报,2010,33(11): 2104-2115.
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.
朱锐,王怀民,冯大为. 基于偏好推荐的可信服务选择[J].软件学报, 2011, 22(5): 852-864.
ZHU Rui, WANG Huaimin, FENG Dawei. Trustworthy services selection based on preference recommendation[J]. Journal of Software, 2011, 22(5):852-864.
张成文,苏森,陈俊亮.基于遗传算法的QoS感知的Web服务选择[J].计算机学报, 2006, 29(7): 1029-1037.
ZHANG Chengwen, SU Sen, CHEN Junliang. Genetic algorithm on Web services selection supporting QoS[J]. Chinese Journal of Computers, 2006, 29(7):1029-1037.
范小芹,蒋昌俊,方贤文,等.基于离散微粒群算法的动态Web服务选择[J].计算机研究与发展,2010, 47(1): 147-156.
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.
胡建强,李涓子,廖桂平.一种基于多维服务质量的局部最优服务选择模型[J].计算机学报, 2010, 33(3): 526-534.
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.
0
浏览量
4
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621