基于信任路径搜索的分布式虚拟化环境下可信服务组件选择方法——HA_OTPS

doi:10.3969/j.issn.0372-2112.2017.01.026

电子学报 ›› 2017, Vol. 45 ›› Issue (1): 192-199.DOI: 10.3969/j.issn.0372-2112.2017.01.026

基于信任路径搜索的分布式虚拟化环境下可信服务组件选择方法——HA_OTPS

王慧强, 邹世辰, 林俊宇, 吕宏武, 冯光升

哈尔滨工程大学计算机科学与技术学院, 黑龙江哈尔滨 150001

收稿日期:2015-05-11 修回日期:2015-09-22 出版日期:2017-01-25
- 通讯作者:
- 邹世辰
- 作者简介:
- 王慧强,男,1960年出生,博士,教授,博士生导师,研究方向为自律计算、可信计算、认知网络和未来网络.E-mail:wanghuiqiang@hrbeu.edu.cn;林俊宇,男,1981年出生,博士,助理研究员,研究方向为QoS、移动云计算;吕宏武,男,1983年出生,博士,讲师,研究方向为自律计算、博弈论、进程代数;冯光升,男,1980年出生,博士,讲师,研究方向为虚拟化、认知网络.
- 基金资助:
- 国家自然科学基金 (No.61370212，No.61402127，No.61502118）; 黑龙江省自然科学基金 (No.F2015029）; 博士点基金优先发展领域项目 (No.20122304130002）; 中央高校基本科研业务费专项资金 (No.HEUCF100601）

HA_OTPS: A Dependable Service Components Selection Method in Distributed Virtualized Environment Based on Trust Path Search

WANG Hui-qiang, ZOU Shi-chen, LIN Jun-yu, LÜ Hong-wu, FENG Guang-sheng

College of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang 150001, China

Received:2015-05-11 Revised:2015-09-22 Online:2017-01-25 Published:2017-01-25
- Supported by:
- National Natural Science Foundation of China (No.61370212, No.61402127, No.61502118); Natural Science Foundation of Heilongjiang Province, China (No.F2015029); Ph.D. Programs Foundation of Ministry of Education of China Priority Development Fields Program (No.20122304130002); Fundamental Research Funds for the Central Universities (No.HEUCF100601)

摘要/Abstract

摘要：

可信服务组件选择是实现分布式虚拟化环境下服务可信性保障的关键.将服务组件选择抽象为多限制优化路径问题后，可以通过搜索信任路径来选择服务组合所需组件，但现有的信任路径搜索算法计算复杂度过高、性能表现差，同时在建立可信服务组件选择模型时缺少从服务组件信任关系和证据传播的角度出发，对可信服务构建与组合过程中服务组件社会关系方面考虑.针对以上不足，本文提出可信质量QoD概念，引入组件亲和度等属性来对分布式虚拟化环境可信服务组件选择模型加以描述与限制，并设计一种基于QoD的启发式优化信任服务路径搜索算法HA_OTPS，选择优化信任服务路径上的服务组件来满足用户可信性需求.实验结果表明，与现有的信任路径搜索算法相比，HA_OTPS算法具有运行时间较短、搜索结果效用值较高等优势.

关键词: 分布式虚拟化环境, 可信性保障, 服务组合, 信任路径

Abstract:

Dependable service components selection is the key to implement dependability assurance in distributed virtualized environment.The service components selection can be modeled as Multi-Constrained Optimal Path(MCOP) problem,and service components will be selected by searching trust path.However,existing trust path search algorithms have disadvantages of high complexity and low performance.And the researches about modeling dependable service components selection lack the consideration of trust relationships and evidence spread among service components during service construction and composition.Therefore,we proposed the concept of QoD,the Quality of Dependability,introducing the attributes(e.g.componentintimacy) to describe and restrict the model of service components selection in distributed virtualized environment.We also designed a heuristic optimal trust service path search algorithm HA_OTPS,and chose service components on the optimal trust service path to satisfy users' demand for service dependability.The experimental results showed that HA_OTPS has shorter execution time and higher utility of search results than the existing trust path search algorithms.

Key words: distributed virtualized environment, dependability assurance, service composition, trust path

中图分类号:

TP311

. 基于信任路径搜索的分布式虚拟化环境下可信服务组件选择方法——HA_OTPS[J]. 电子学报, 2017, 45(1): 192-199.

. HA_OTPS: A Dependable Service Components Selection Method in Distributed Virtualized Environment Based on Trust Path Search[J]. Acta Electronica Sinica, 2017, 45(1): 192-199.

参考文献

[1] Voith T,Oberle K,Stein M.Quality of service provisioning for distributed data center inter-connectivity enabled by network virtualization[J].Future Generation Computer Systems,2012,28(3):554-562.
[2] 杨芙清,吕建,梅宏.网构软件技术体系:一种以体系结构为中心的途径[J].中国科学:信息科学,2008,38(6):818-828.
[3] Li H,Zhao H,Cai W,et al.A modular attachment mechanism for software network evolution[J].Physica A:Statistical Mechanics and its Applications,2013,392(9):2025-2037.
[4] Fujii K,Suda T.Semantics-based context-aware dynamic service composition[J].ACM Transactions on Autonomous and Adaptive Systems,2009,4(2):article 12:1-31.
[5] Zhou J,Gilman E,Palola J,et al.Context-aware pervasive service composition and its implementation[J].Personal and Ubiquitous Computing,2011,15(3):291-303.
[6] Zeng L Z,Banatallah B,Ngu A H H,et al.QoS-Aware middleware for web services composition[J].IEEE Trans on Software Engineering,2004,30(5):311-327.
[7] Upadhyaya B,Zou Y,Ng J,et al.Towards quality of experience driven service composition[A].2014 IEEE World Congress on Services (SERVICES)[C].Anchorage,USA,2014.18-20.
[8] 王怀民,尹刚,谢冰,等.基于网络的可信软件大规模协同开发与演化[J].中国科学:信息科学,2014,44(1):1-19.
[9] 刘书雷,刘云翔,张帆,等.一种服务聚合中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.
[10] Korkmaz T,Krunz M.Multi-constrained optimal path selection[A].Proceedings of INFOCOM 2001.Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies[C].Anchorage,USA:IEEE,2001.2:834-843.
[11] Liu L,Feng G.Simulated annealing based multi-constrained QoS routing in mobile ad hoc networks[J].Wireless Personal Communications,2007,41(3):393-405.
[12] 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 (TWEB),2007,1(1):6.
[13] 马跃勇,王海梅,廖建军.多约束最优路径算法比较研究[J].南京理工大学学报:自然科学版,2012,35(6):749-754. Ma Yueyong,Wang Haimei,Liao Jianjun.Comparative study of multi-constrained optimal path algorithms[J].Journal of Nanjing University of Science and Technology,2012,35(6):749-754.(in Chinese)
[14] 朱强,王慧强,吕宏武,等.VNE-AFS:基于人工鱼群的网络虚拟化映射算法[J].通信学报,2012(S1):170-177. Zhu Qiang,Wang Huiqiang,Lü Hongwu,et al.VNE-AFS:virtual network embedding based on artificial fish swarm[J].Journal on Communications,2012(S1):170-177.(in Chinese)
[15] 王怀民,刘旭东,郎波.软件可信分级规范[EB/OL].http://www.trustie.com/clinks/trustiecriterion.jsp,2009. Wang Huaimin,Liu Xudong,Lang Bo.Software Trustworthiness Classification Specification[EB/OL].http://www.trustie.com/clinks/trustiecriterion.jsp,2009. (in Chinese)
[16] 邹世辰,王慧强,冯光升,等.基于Moran过程的认知中继网络多策略信任演化模型[J].小型微型计算机系统,2014,35(10):2209-2214. Zou Shichen,Wang Huiqiang,Feng Guangsheng,et al.A multi-strategy trust evolution model for cognitive relay network based on Moran process[J].Journal of Chinese Computer Systems,2014,35(10):2209-2214.(in Chinese)
[17] R Miller,D Perlman.Intimate Relationships[M].McGraw Hill Higher Education,New York,USA,2012.
[18] Enron Email Dataset[EB/OL].http://www.cs.cmu.edu/~enron/,2015.
[19] Salama H F.Multicast Routing for Real-Time Communication of High-Speed Networks[M].North Carolina State University,Raleigh,USA,1996.
[20] Cormen T H.Introduction to Algorithms[M].MIT press,Cambridge,USA,2009.

基于信任路径搜索的分布式虚拟化环境下可信服务组件选择方法——HA_OTPS

HA_OTPS: A Dependable Service Components Selection Method in Distributed Virtualized Environment Based on Trust Path Search

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	杨震, 杨甜甜, 范科峰, 王勇. 基于信任合成的云服务动态组合机制研究[J]. 电子学报, 2018, 46(3): 614-620.
[2]	张以文, 崔光明, 郭星, 张燕平. 一种基于任务粒化的服务组合优化方法[J]. 电子学报, 2018, 46(1): 245-251.
[3]	叶恒舟, 李陶深, 关云慧. 基于时序约束分解的QoS感知的Web服务组合[J]. 电子学报, 2017, 45(5): 1150-1157.
[4]	张元鸣, 倪宽, 陆佳炜, 徐俊, 肖刚. 基于全局依赖网的Web服务组合自动演化方法研究[J]. 电子学报, 2017, 45(2): 267-277.
[5]	张涛, 马建峰, 习宁, 刘西蒙, 熊金波. 面向服务移动社交网络中基于信任的分布式服务组合方法[J]. 电子学报, 2016, 44(2): 258-267.
[6]	李庆新, 刘淑芬, 曲明. 基于本体的Web服务行为语义建模方法[J]. 电子学报, 2015, 43(3): 601-604.
[7]	杜玉越, 薛洁, 李彦成. 基于服务簇的服务组合替换与分析[J]. 电子学报, 2014, 42(11): 2231-2238.
[8]	吉顺慧, 李必信, 邱栋. 基于XCFG的BPEL数据流属性分析与验证[J]. 电子学报, 2013, 41(7): 1365-1370.
[9]	黄龙涛, 邓水光, 戴康, 李莹, 尹建伟. 基于MapReduce的并行Web服务自动组合[J]. 电子学报, 2012, 40(7): 1397-1403.
[10]	徐猛, 崔立真, 李庆忠. 基于扩展图规划的Top-K服务组合方法研究[J]. 电子学报, 2012, 40(7): 1404-1409.
[11]	杨汝涛, 张绍谦, 窦万春. 一种基于QoS剪枝的Top-k自动服务组合方法[J]. 电子学报, 2012, 40(7): 1489-1491.
[12]	龙军, 袁鑫攀, 桂卫华. 基于环境感知的可信QoS评价与服务选取策略[J]. 电子学报, 2012, 40(6): 1133-1140.
[13]	马环宇, 姜伟, 虎嵩林. QSynth-TopK:一个支持Top K查询的质量敏感的自动服务组合系统[J]. 电子学报, 2012, 40(10): 1933-1937.
[14]	张广泉;戎玫;朱雪阳;何亚丽;石慧娟. 基于XYZ/ADL的Web服务组合描述与验证[J]. 电子学报, 2011, 39(3A): 86-93.
[15]	毕敬;朱志良;范玉顺. Web服务组合中行为兼容性分析与优化控制策略[J]. 电子学报, 2011, 39(12): 2842-2849.