Web服务组合中基于可信联盟的服务选择研究

Chunhua Hu, Xiaohong Chen, Jianxun Liu, Jibo Liu
{"title":"Web服务组合中基于可信联盟的服务选择研究","authors":"Chunhua Hu, Xiaohong Chen, Jianxun Liu, Jibo Liu","doi":"10.1109/ISPA.2009.63","DOIUrl":null,"url":null,"abstract":"In the Internet, there are a mass of malicious, fraudulent services in addition to the dynamics change and differences in service of quality. As a result, it is difficult for a client to fastly get high- quality services. In this paper, a service-composition framework based on the trust evolution and alliance has been proposed. It is different from traditional service workflow model. The trust relationship will be built after the trust evolution between services requester and provider. The trust services requester and provider are going to form an alliance through the relationship, so the malicious, fraudulent services will be excluded from the system and the service-composition will be carried out in a trust environment. On this basis, a strategy measuring the trust relationship among the services based on information entropy has been proposed, which can avoid the deficiencies of multi-dimensional trust indicators simply weighted in the previous studies. Theoretical analysis and experimental result show that the method proposed in this paper is more superior in credibility and security, comparing to the traditional services selection methods.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Services Selection Based on Credible Alliance in Web Services Combination\",\"authors\":\"Chunhua Hu, Xiaohong Chen, Jianxun Liu, Jibo Liu\",\"doi\":\"10.1109/ISPA.2009.63\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the Internet, there are a mass of malicious, fraudulent services in addition to the dynamics change and differences in service of quality. As a result, it is difficult for a client to fastly get high- quality services. In this paper, a service-composition framework based on the trust evolution and alliance has been proposed. It is different from traditional service workflow model. The trust relationship will be built after the trust evolution between services requester and provider. The trust services requester and provider are going to form an alliance through the relationship, so the malicious, fraudulent services will be excluded from the system and the service-composition will be carried out in a trust environment. On this basis, a strategy measuring the trust relationship among the services based on information entropy has been proposed, which can avoid the deficiencies of multi-dimensional trust indicators simply weighted in the previous studies. Theoretical analysis and experimental result show that the method proposed in this paper is more superior in credibility and security, comparing to the traditional services selection methods.\",\"PeriodicalId\":346815,\"journal\":{\"name\":\"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPA.2009.63\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2009.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在互联网上,除了服务质量的动态变化和差异外,还存在大量的恶意、欺诈性服务。因此,客户很难快速获得高质量的服务。本文提出了一种基于信任演化和联盟的服务组合框架。它不同于传统的服务工作流模型。信任关系将在服务请求者和提供者之间的信任演变之后建立。信任服务的请求者和提供者将通过这种关系结成联盟,从而将恶意、欺诈性的服务排除在系统之外,使服务组合在信任的环境中进行。在此基础上,提出了一种基于信息熵的服务间信任关系度量策略,避免了以往研究中多维信任指标简单加权的不足。理论分析和实验结果表明,与传统的服务选择方法相比,本文提出的方法具有更高的可信度和安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Services Selection Based on Credible Alliance in Web Services Combination
In the Internet, there are a mass of malicious, fraudulent services in addition to the dynamics change and differences in service of quality. As a result, it is difficult for a client to fastly get high- quality services. In this paper, a service-composition framework based on the trust evolution and alliance has been proposed. It is different from traditional service workflow model. The trust relationship will be built after the trust evolution between services requester and provider. The trust services requester and provider are going to form an alliance through the relationship, so the malicious, fraudulent services will be excluded from the system and the service-composition will be carried out in a trust environment. On this basis, a strategy measuring the trust relationship among the services based on information entropy has been proposed, which can avoid the deficiencies of multi-dimensional trust indicators simply weighted in the previous studies. Theoretical analysis and experimental result show that the method proposed in this paper is more superior in credibility and security, comparing to the traditional services selection methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信