增强Web服务可信性的服务选择方法

doi:1000-436X(2011)01-0037-09

通信学报 ›› 2011, Vol. 32 ›› Issue (1): 37-45.doi: 1000-436X(2011)01-0037-09

增强Web服务可信性的服务选择方法

赵生慧^1,^2,³,吴国新^1,²,陈桂林³,陈海宝³

¹ 东南大学计算机科学与工程学院，江苏南京 210096
² 东南大学计算机网络和信息集成教育部重点实验室，江苏南京 210096
³ 滁州学院计算机科学与技术系，安徽滁州 239012

出版日期:2011-01-25 发布日期:2017-06-19
基金资助:
国家高技术研究发展计划（“863”计划）基金资助项目;安徽省高校自然科学研究重点基金资助项目;安徽省自然科学基金资助项目

Service selection approach for enhancing trustworthiness of Web service

Sheng-hui ZHAO^1,^2,³,Guo-xin WU^1,²,Gui-lin CHEN³,Hai-bao CHEN³

¹ School of Computer Science and Engineering,Southeast iversity,Nanjing 210096,China
² Key Laboratory of Computer Network and Information Integration,Ministry of Education Southeast University,Nanjing 210096,China
³ Department of Computer Science and Technology,Chuzhou University,Chuzhou 239012,China

Online:2011-01-25 Published:2017-06-19
Supported by:
The National High Technology Research and Development of China (863 Program);The Anhui Educational Department Natural Sciences Project;The Natural Science Foundation of Anhui Province

摘要/Abstract

摘要：

应用博弈论方法，建立了基于纳什讨价还价解的服务选择模型，提出了一种增强Web服务可信性的服务选择方法。设计了完全理性的服务双方的讨价还价算法，对服务的价格进行调整，以达到服务请求者与服务提供者双方效用最大化，从而提高交易的成功率和服务的可信性。实验结果表明，在服务提供者与请求者之间就服务质量、信誉、安全等属性进行博弈的基础上作服务选择，能够促进可信服务计算环境的建立，增强服务的可信性。

关键词: 博弈论, 服务选择, 服务可信性, 纳什讨价还价解

Abstract:

Making use of the game theory,a model of service selection based on Nash bargaining solution was build,and an approach for enhancing Web service trustworthiness was proposed.A bargaining algorithm is designed between service sides of both complete rationality,through adjusting service price,to achieve maximum utility for both service requestor and provider,and increase the success rate of transactions and service trustworthiness.Results of experiments show that,on the basis of the game that according to ity of service,reputation and security between service provider and requestor,the service selection can promote the establishment of trustable service computing environment and enhance credibility of the service.

Key words: game theory, service selection, service trustworthiness, Nash bargaining solution

赵生慧,吴国新,陈桂林,陈海宝. 增强Web服务可信性的服务选择方法[J]. 通信学报, 2011, 32(1): 37-45.

Sheng-hui ZHAO,Guo-xin WU,Gui-lin CHEN,Hai-bao CHEN. Service selection approach for enhancing trustworthiness of Web service[J]. Journal on Communications, 2011, 32(1): 37-45.

图/表 6

图1

图2

表1

图3

图4

表2

参考文献 23

[1]	LUO Z W , LI J S , ZHANG J . A Web services community model for services provisioning[A]. Proc of IEEE 2005 International Conference on Services Systems and Services Management[C]. Chongqiing,China, 2005. 560-565.
[2]	WANG Y , VASSILEVA J . A review on trust and reputation Web service selection[A]. Proc of the 27th International Conference on Distributed Computing Systems Workshops[C]. Toronto,Canada, 2007. 25-32.
[3]	SERHANI M A , DSSOULI R , HAFID A ,et al. A QoS broker based architecture for efficient Web services selection[A]. Proc of the 2005 International Conference on Web Services[C]. Orlando,Florida, 2005. 113-120.
[4]	ZENG L Z , BENATALLSH B , AHH N ,et al. QoS-aware middleware for Web services composition[J]. IEEE Transaction on Software Engineering, 2004,30(5): 311-327.
[5]	MAXIMILIEN E M , MUNINDAR P S . Toward autonomic Web services trust and selection[A]. Proc of the 2nd International Conference on Service Oriented Computing[C]. New York, 2004. 212-221.
[6]	VU L H , HAUSWIRTH M , ABERER K . QoS-based service selection and ranking with trust and reputation management[A]. On the Move to Meaningful Internet Systems 2005:CoopIS,DOA,and ODB SE Agia Napa,Cyprus[C]. 2005. 466-483.
[7]	李海华, 杜小勇, 田萱 . 一种能力属性增强的 Web 服务信任评估模型[J]. 计算机学报, 2008,31(8): 1471-1477. LI H H , DU X Y , TIAN X . A capability enhanced trust evaluation model for Web services[J]. Chinese Journal of Computers, 2008,31(8): 1471-1477.
[8]	蒋哲远, 韩江洪, 王钊 . 动态的QoS感知Web服务选择和组合优化模型[J]. 计算机学报, 2009,32(5): 1014-1025. JIANG Z Y , HAN J H , WANG Z . An optimization model for dynamic QoS-aware Web services selection and composition[J]. Chinese Journal of Computers, 2009,32(5): 1014-1025.
[9]	ZHAO S H , WU G X , LI Y M ,et al. A framework for trustworthy Web service management[A]. Proc of 2009 Second International Symposium on Electronic Commerce and Security[C]. Nanchang,China, 2009. 479-482.
[10]	XIAO L J , ZHU Y M , NI L M ,et al. Incentive-based scheduling for market-like computational grids[J]. IEEE Transactions on Parallel and Distributed Systems, 2008,19(7): 903-913.
[11]	JOSEPH Y . Computer science and game theory:a brief survey[EB/OL]. .
[12]	黄丽亚, 刘臣, 王锁萍 . 改进的认知无线电频谱共享博弈模型[J]. 通信学报, 2010,31(2): 136-140. HUANG L Y , LIU C , WANG S P . Improved spectrum sharing in cognitive radios based on game theory[J]. Journal on Communications, 2010,31(2): 136-140.
[13]	李茂胜, 杨寿保, 付前飞 ,等. 基于赔偿的网格资源交易模型[J]. 软件学报, 2006,17(3): 472-480. LI M S , YANG S B , FU Q F ,et al. A grid resource transaction model based on compensation[J]. Journal of Software, 2006,17(3): 472-480.
[14]	饶翔, 张顺颐, 孙雁飞 ,等. 基于预判与合作博弈的下一代网络资源优化分配方法[J]. 通信学报, 2009,30(4): 60-65. RAO X , ZHANG S Y , SUN Y F ,et al. Next generation network resource allocation method based on cooperative game and decision-making in advance[J]. Journal on Communications, 2009,30(4): 60-65.
[15]	MARTIN S , HOLGER B . Nash bargaining and proportional fairness for log-convex utility sets[A]. Proc of 2008 International Conference on Acoustics,Speech,and Signal[C]. Las Vegas,USA, 2008. 3157-3160.
[16]	NASH J F . The bargaining problem[J]. Econometrica, 1950,18: 155-162.
[17]	NASH J F . Two-person cooperative games[J]. Econometrica, 1953,21: 128-140.
[18]	SUN P C , HUANG C L , CHAO K M ,et al. Core-based agent for service-oriented market[A]. Proc of 2006 IEEE International Conference on Systems,Man,and Cybernetics[C]. Taipei,Taiwan,China, 2006. 2970-2975.
[19]	TIBERIU S P , VEMON R . WS-auction:mechanism design for a Web services market[A]. Proc of the 26th IEEE International Conference on Distributed Computing Systems WorkshopsLisboa,Portugal[C]. 2006. 41-46.
[20]	SHAHRAM E , KATE L . Service allocation for composite Web services based on quality attributes[A]. Proc of Seventh IEEE International Conference on E-Commerce Technology Workshops[C]. Munich,Germany, 2005. 71-79.
[21]	SHEN Y M , FAN Y S . Cooperative mixed strategy for service selection in service oriented architecture[A]. Proc of IEEE International Conference on Systems,Man and Cybernetics[C]. Montréal,Canada, 2007. 1452-1457.
[22]	WALTER B , HANS P . Multi-attribute decision-making in individual and social choice[J]. Mathematical Social Sciences, 2000,40(3): 327-339(13).
[23]	WEISSTEIN E W . Sigmoid function from wolfram mathWorld-a wolfram Web resource[EB/OL]. , 2008.

交易轮数		平均增加的QoS
交易轮数	x=0.3	x=0.35	x=0.4
1	0.027	0.028	0.034
2	0.003 8	0.0045	0.005
3	0.002 1	0.0022	0.002 4
4	0.001 7	0.002	0.001 6
5	0.001 2	0.0013	0.001 5
6	0.000 91	0.00093	0.001 1
7	0.000 8	0.00087	0.000 9
8	0.000 7	0.00071	0.000 84
9	0.000 64	0.00065	0.000 69
10	0.000 52	0.0006	0.000 61

不诚实WSP占总的WSP比例	10%	15%	20%
不诚实WSP占总的WSP比例	平均成功率，平均可信性	平均成功率，平均可信性	平均成功率，平均可信性
第1轮	0.75,0.309	0.5,0.276	0.625,0.309
第2轮	0.25,0.250	0.167,0.274	0.125,0.263
第3轮	没有参与，没有参与	0,0	0.125,0.246
第4轮	没有参与，没有参与	没有参与，没有参与	没有参与，没有参与

增强Web服务可信性的服务选择方法

Service selection approach for enhancing trustworthiness of Web service

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 6

参考文献 23

相关文章 15

Metrics

推荐阅读 0

[1]	冯智斌, 徐煜华, 杜智勇, 刘鑫, 李文, 韩昊, 张晓博. 对抗智能干扰的主动防御技术[J]. 通信学报, 2022, 43(10): 42-54.
[2]	张红斌, 尹彦, 赵冬梅, 刘滨. 基于威胁情报的网络安全态势感知模型[J]. 通信学报, 2021, 42(6): 182-194.
[3]	赵临东,庄文芹,陈建新,周亮. 异构蜂窝网络中分层任务卸载：建模与优化[J]. 通信学报, 2020, 41(4): 34-44.
[4]	李沓,田有亮,向康,高鸿峰. 委托计算下基于区块链的公平支付方案[J]. 通信学报, 2020, 41(3): 80-90.
[5]	曾锋,王润华,彭佳,陈志刚. 口碑参与模式下移动众包网络的用户博弈研究[J]. 通信学报, 2019, 40(3): 125-138.
[6]	单芳芳,李晖,朱辉. 基于博弈论的社交网络转发控制机制[J]. 通信学报, 2018, 39(3): 172-180.
[7]	曹傧,梁裕丞,罗雷,唐述. ad hoc云环境中分布式博弈卸载策略[J]. 通信学报, 2017, 38(11): 24-34.
[8]	贾亚男,岳殿武. 认知小蜂窝网络中基于能效的下行资源分配算法[J]. 通信学报, 2016, 37(4): 116-127.
[9]	曹傧,郎文强,陈卓,李云. 无线网络虚拟化中资源共享的功率分配算法[J]. 通信学报, 2016, 37(2): 64-72.
[10]	田有亮,王雪梅,刘琳芳. 基于马尔可夫决策的理性秘密共享方案[J]. 通信学报, 2015, 36(9): 222-229.
[11]	胡松华,张建军,陆阳,刘斌,韩江洪. 基于博弈论功率控制的串行干扰消除算法[J]. 通信学报, 2015, 36(9): 215-221.
[12]	王洁,蔡永泉,田有亮. 基于博弈论的门限签名体制分析与构造[J]. 通信学报, 2015, 36(5): 148-155.
[13]	郭晶晶，马建峰，李琦，万涛，高聪，张亮. 基于博弈论的移动自组织网络的信任管理方法[J]. 通信学报, 2014, 35(11): 6-49.
[14]	郭晶晶,马建峰,李琦,万涛,高聪,张亮. 基于博弈论的移动自组织网络的信任管理方法[J]. 通信学报, 2014, 35(11): 50-58.
[15]	杨卫东1,2，何云华2,3，孙利民2,3. 车载自组网节点轨迹隐私攻防博弈模型[J]. 通信学报, 2013, 34(Z1): 32-245.