期刊文献+

兼顾成本效益的服务供需双方稳定匹配

Stable match for supplier and demander of service considering cost-effectiveness
下载PDF
导出
摘要 考虑服务资源的有限性和用户与服务供应商的双向偏好,提出一种云服务资源匹配方法,解决供需双方双向选择下的合作问题。依据供需双方偏好建立服务资源分配框架,利用聚类方法快速筛选用户需求及候选服务,结合Gale-Shapley算法提出两种需求服务匹配策略,考虑到用户满意度和服务提供商的成本效益,得到稳定的服务资源匹配方案,达到全局最优。通过实验验证了该算法的有效性。 Considering the limitation of service resources and the preference of both users and service providers,a method of resource allocation was proposed to solve the cooperation problem of two-way choice between supplier and demander.A service resource allocation framework was created based on the preference of supply and demand sides.Clustering was used to screen user’s requirements and candidate services quickly,two requirements service matching strategies were provided based on GaleShapley algorithm.The demander’s satisfactory on Web services and supplier’s cost-effectiveness of Web services were considered,a stable service resource matching scheme was obtained to achieve global optimum.The effectiveness of the proposed method was demonstrated in a simulation environment.
作者 徐俊 周行羽 陆佳炜 张元鸣 肖刚 XU Jun;ZHOU Hang-yu;LU Jia-wei;ZHANG Yuan-ming;XIAO Gang(College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China)
出处 《计算机工程与设计》 北大核心 2018年第5期1365-1371,共7页 Computer Engineering and Design
基金 浙江省重大科技专项基金项目(2014C01048) 浙江省公益性技术基金项目(2017C31014)
关键词 稳定匹配 多用户 服务质量 WEB服务 聚类算法 stable matching multi-user quality of service Web service clustering algorithm
  • 相关文献

参考文献5

二级参考文献38

  • 1胡鹤,刘大有,王生生.Web本体语言OWL[J].计算机工程,2004,30(12):1-2. 被引量:42
  • 2刘书雷,刘云翔,张帆,唐桂芬,景宁.一种服务聚合中QoS全局最优服务动态选择算法[J].软件学报,2007,18(3):646-656. 被引量:146
  • 3Ran Shu-ping. A model for Web services discovery with QoS [ J ]. ACM SIGecom Exchanges ,2003,4 ( 1 ) :1-10.
  • 4Boualem Benatallah, Marion Dumas, Quan Z, et al. Declarative com- position and peer-to-peer provisioning of dynamic Web services [C]. In Proceedings of 18th International Comference on Data En- gineering, IEEE, 2002 : 297 -308.
  • 5Liu Yu-tu, Anne H H Ngu, Zeng Liang-zhao. QoS computation and policing in dynamic Web service selection [ C ]. In Proceedings of International World Wide Web Conference ,ACM ,2004:66-73.
  • 6Tao Yu, Kwei-Jay Lin. Service selection algorithms for Web serv- ices with end-to-end QoS constraints [ J ]. Information Systems and E-Business Management,2005,3 (2) : 103-126.
  • 7Danilo Ardagna, Barbara Pernici. Global and local QoS guarantee in web service selection ~ C ]. In Proceedings of Third Internation Con- ference on Business Process Management, Springer,2006:32-46.
  • 8Yao Yu, Yue-zhang, Kwei-Jay Lin. Efficient algorithms for Web services selection with end-to-end QoS constraints[ J]. ACM Trans- actions on the Web (TWEB) ,2007,1 (1) :6-32.
  • 9Mohammad Alrifai, Thomass Risse. Combining global optimization with local selection for efficient QoS-aware service composition [ C~. In Proceedings of Proceedings of 16th International Confer- ence on World Wide Web, ACM,2009:881-890.
  • 10Qi Lian-yong, Tang Ying, Dou Wan-chun, et al. Combining local optimization and enumeration for QoS-aware Web service composi- tion [ C ]. In Proceedings of International Conference on Web Serv- ices, IEEE Computer Society,2010: 34 -41.

共引文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部