一种服务质量可信的按需服务组合方法

曹步清 1; 李兵 2; 刘建勋 1

doi:10.7652/xjtuxb201302022

您当前的位置：

首页 >

文章列表页 >

一种服务质量可信的按需服务组合方法

更新时间：2025-07-09

- 一种服务质量可信的按需服务组合方法
- An On-Demand Service Composition Method Based on Trustworthy Quality of Service
- 西安交通大学学报 2013年47卷第2期页码：131-138
- 作者机构：
  
  湖南科技大学知识处理与网络化制造湖南省重点实验室,湖南,湘潭,411201
- 作者简介：
- 基金信息：
  
  : 2012-07-02。作者简介: 曹步清(1979—),男,博士,讲师。基金项目: 国家自然科学基金资助项目(61272063);湖南省教育厅重点实验室开放基金资助项目(12K105);湖南省自然科学杰出青年基金资助项目(11JJ1011);湖南省自然科学青年人才培养联合基金一般资助项目(12JJB009)
- DOI：10.7652/xjtuxb201302022
  中图分类号： TP301
- 网络首发：2013-02-10，
  
  纸质出版：2013
- 稿件说明：
移动端阅览
曹步清 1, 李兵 2, 刘建勋 1. 一种服务质量可信的按需服务组合方法[J]. 西安交通大学学报, 2013,47(2):131-138.

An On-Demand Service Composition Method Based on Trustworthy Quality of Service[J]. 2013, 47(2): 131-138.
曹步清 1, 李兵 2, 刘建勋 1. 一种服务质量可信的按需服务组合方法[J]. 西安交通大学学报, 2013,47(2):131-138. DOI： 10.7652/xjtuxb201302022.

An On-Demand Service Composition Method Based on Trustworthy Quality of Service[J]. 2013, 47(2): 131-138. DOI： 10.7652/xjtuxb201302022.

摘要

为了解决开放、动态网络环境下的服务可信组合问题

特别是组合服务的可信度计算与评估

以及服务可信组合最优方案选择

提出一种服务质量(QoS)可信的按需服务组合方法。该方法根据单个服务的信任度值以及服务组合图的控制结构

构建基于QoS可信的服务组合信任模型

进行服务组合的信任合成与计算; 基于该模型设计多约束条件下QoS可信的按需服务组合方案

采用粒子群算法进行优化求解

以此选择出可信度高的服务执行计划。面向物流领域配送管理需求实例进行了实证和实验研究

结果表明所提方法在求解多约束的可信服务组合优化上是有效、适用的

能够提高服务组合的可信性和成功率。

Abstract

An on-demand service composition method based on reliable service quality is proposed to solve the service credible composition problem in open and dynamic network environment

especially the calculation and evaluation of the composite service credibility

and the optimal selection for credible service composition. The method bases on the trust value of a single service instance and the control structure of service composition diagram to build a service composition trust model based on credible quality of service

and to perform the calculation and synthesization of composition service credibility. Then

the model is used to design on-demand service composition plan with credible QoS under multiple constraints

and the particle swarm algorithm

is used to solve the optimization problem to obtain the service execution plan with the highest credibility. Experiments with an example of distribution management requirement of logistics domain show that the proposed method is effective and applicable to solve the constrained credible service composition optimization problem and can enhance the credibility and success rate of service composition.

关键词

Keywords

references

吴朝晖, 邓水光, 吴健. 服务计算与技术 [M]. 杭州: 浙江大学出版社, 2009.

岳昆, 王晓玲, 周傲英. Web服务核心支撑技术: 研究综述 [J]. 软件学报, 2004, 15(3): 428-442.

YUE Kun, WANG Xiaoling, ZHOU Aoying. Underlying techniques for Web services: a survey [J]. Journal of Software, 2004, 15(3): 428-442.

PAPAZOGLOU M P, GEORGAKOPOULOS D. Service-oriented computing [J]. Communications of the ACM, 2003, 46(10): 25-28.

喻坚, 韩燕波. 面向服务的计算:原理和应用 [M]. 北京: 清华大学出版社, 2006.

DUSTDAR S, SCHREINER W, SCHREINER W. A survey on web services composition [J]. International Journal of Web and Grid Service, 2005, 1(1): 1-30.

MILANOVIC N, MALEK M. Current solutions for Web services composition [J]. IEEE Internet Computing, 2004, 8(6): 51-59.

YANG S J H, HSIEH J S, LAN B C, et al. Composition and evaluation of trustworthy web services [J]. International Journal of Web Grid Service, 2006, 2(1): 5-24.

BILLHARDT H, HERMOSO R, OSSOWSKI S, et al. Trust-based service provider selection in open environments [C]∥Proceedings of the 2007 ACM Symposium on Applied Computing. Washington DC, USA: ACM, 2007: 1375-1380.

潘静, 徐锋, 吕建. 面向可信服务选取的基于声誉的推荐者发现方法 [J]. 软件学报, 2010, 21(2): 388-400.

PAN Jing, XU Feng, LÜ Jian. Reputation-based recommender discovery approach for service selection [J]. Journal of Software, 2010, 21(2): 388-400.

李研, 周明辉, 李瑞超, 等. 一种考虑QoS数据可信性的服务选择方法 [J]. 软件学报, 2008, 19(10): 2620-2627.

LI Yan, ZHOU Minghui, LI Ruichao, et al. Service selection approach considering the trustworthiness of QoS data [J]. Journal of Software, 2008, 19(10): 2620-2627.

RAJBHANDARI S, RANA O F, WOOTTEN I. A fuzzy model for calculating workflow trust using provenance data [C]∥Proceedings of the 15th ACM Mardi Gras Conference. Washington DC, USA: ACM, 2008: 18-24.

MILANOVIC N, MIROSLAW M. Current solutions for web service composition [J]. IEEE Internet Computing, 2004, 8(6): 51-59.

LI L, WANG Y. Trust evaluation in composite services selection and discovery [C]∥Proceedings of the 2009 IEEE International Conference on Services Computing. Alamitos, CA, USA: IEEE Computer Society, 2009: 482-485.

LI L, WANG Y. Trust-oriented composite services with QoS constraints [J]. Journal of Universal Computer Science, 2010, 16(13): 1720-1744.

LIU Guanfeng, WANG Yan, ORGUN M A. A heuristic algorithm for trust-oriented service provider selection in complex social networks [C]∥2010 IEEE International Conference on Services Computing. Piscataway, NJ, USA: IEEE, 2010: 130-137.

王勇, 代桂平, 侯亚荣. 信任感知的组合服务动态选择方法[J]. 计算机学报, 2009, 32(8): 1668-1675.

WANG Yong, DAI Guiping, HOU Yarong. Dynamic methods of trust-aware composite service selection [J]. Journal of Computers, 2009, 32(8): 1668-1675.

曾晋, 孙海龙, 刘旭东,等. 基于服务组合的可信软件动态演化机制 [J]. 软件学报, 2010, 21(2): 261-276.

ZENG Jin, SUN Hailong, LIU Xudong, et al. Dynamic evolution mechanism for trustworthy software based on service composition [J]. Journal of Software, 2010, 21(2): 261-276.

朱锐, 王怀民. 可信服务组合若干关键技术研究 [D]. 长沙: 国防科学技术大学, 2009.

蔡斯博, 谢冰. 一种支持软件资源可信评估的框架 [J]. 软件学报, 2010, 21(2): 359-372.

CAI Sibo, XIE Bing. Framework supporting software assets evaluation on trustworthiness [J]. Journal of Software, 2010, 21(2): 359-372.

胡春华, 吴敏. Web服务工作流中基于信任关系的QoS调度 [J]. 计算机学报, 2009, 32(1): 42-53.

HU Chunhua, WU Min. QoS scheduling based on trust relationship in web service workflow [J]. Chinese Journal of Computer, 2009, 32(1): 42-53.

WANG J, HE K, BING L, et al. RGPS: a unified requirements meta-modeling frame for networked software [C]∥The 30th International Conference on Software Engineering. Berlin, Germany: Springer, 2008: 29-35.

JIANG W, ZHANG C, HUANG Z, et al. Qsynth: a tool for QoS-aware automatic service composition [C]∥2010 IEEE International Conference on Web Services. Piscataway, NJ, USA: IEEE, 2010: 42-49.

BARTALOS P, BIELIKOVA M. Semantic web service composition framework based on parallel processing [C]∥Proceedings of the 11th IEEE Conference on Commerce and Enterprise Computing. Piscataway, NJ, USA: IEEE, 2009: 495-498.

YAN Y, XU B, GU Z, et al. A QoS-driven approach for semantic service composition [C]∥Proceedings of the 11th IEEE Conference on Commerce and Enterprise Computing. Piscataway, NJ, USA: IEEE, 2009: 523-526.

CEC2009. Web service challenge[EB/OL]. [2010-10-20]. http:∥ws-challenge.georgetown.edu/wsc09/.

刘波. 粒子群优化算法及其工程应用 [M]. 北京: 电子工业出版社, 2010.

刘书雷, 刘云翔, 张帆, 等. 一种服务聚合中QoS全局最优服务动态选择算法[J]. 软件学报, 2007, 18(3): 646-656.

LIU Shulei, LIU Yunxiang, ZHANG Fan, et al. A dynamic web services selection algorithm with QoS global optimal in web services composition [J]. Journal of Software, 2007, 18(3): 646-656.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

一种基于最小覆盖的复杂Web 服务组合方法

一种可演化网络的研究与实践

内容寻址网络的P2P语义Web服务组合系统架构

利用服务质量参数值预测的Web服务选择方法

面向物联网移动感知的服务节点发现算法