电子学报

• 学术论文 • 上一篇    下一篇

基于扩展图规划的Top-K服务组合方法研究

徐猛, 崔立真, 李庆忠   

  1. 山东大学计算机科学与技术学院, 山东济南 250101
  • 收稿日期:2010-12-15 修回日期:2011-07-10 出版日期:2012-07-25
    • 通讯作者:
    • 李庆忠
    • 作者简介:
    • 徐 猛 男,1978年10月出生于青海格尔木.博士研究生,研究方向为软件与数据工程. E-mail:xumeng_wf@163.com 崔立真 男,1976年生,博士,副教授,主要研究方向为软件与数据工程、服务计算. E-mail:clz@sdu.edu.cn 李庆忠 男,1965年生,博士,教授,博士生导师,研究领域是大规模网络数据管理、数据集成等. E-mail:lqz@sdu.edu.cn
    • 基金资助:
    • 国家自然科学基金 (No.61003253); 国家科技支撑计划 (No.2009BAH44B02); 山东省自然科学基金 (No.ZR2010FQ010,No.ZR2010FM031); 山东省科技发展计划 (No.2009GG10001002); 高等学校博士学科点专项科研基金 (No.200804221031); 山东大学自主创新基金 (No.2009TS030)

An Extended Graph-Planning Based Top-K Service Composition Method

XU Meng, CUI Li-zhen, LI Qing-zhong   

  1. School of Computer Science and Technology, Shandong University, Jinan, Shandong 250101, China
  • Received:2010-12-15 Revised:2011-07-10 Online:2012-07-25 Published:2012-07-25
    • Supported by:
    • National Natural Science Foundation of China (No.61003253); National Key Technology Research and Development Program of the Ministry of Science and Technology (No.2009BAH44B02); Natural Science Foundation of Shandong Province (No.ZR2010FQ010, No.ZR2010FM031); Science and Technology Development Program of Shandong Province (No.2009GG10001002); Research Fund for the Doctoral Program of Higher Education of China (No.200804221031); Independent Innovation Fund of Shandong University (No.2009TS030)

摘要: 自动服务组合是目前云计算中的关键技术与研究热点.为大规模用户提供多个满足个性化需求的组合服务是当前云环境下自动服务组合中急需解决的问题.提出了基于扩展图规划的Top-K服务组合方法,借助服务索引和增加图规划中的辅助节点,使得经过一次规划搜索即可找到Top-K个满足用户QoS要求的组合服务.实验表明,该方法能够有效提高服务组合的效率,并保证服务组合结果的正确性,更加适用于云计算环境下海量网络服务及大规模用户个性化需求的自动服务组合问题.

关键词: 服务组合, Top-K, 扩展图规划, 辅助节点

Abstract: ASC (Automatic Service Composition) is the key issue in cloud computing.It is an urgent problem of ASC in cloud computing to provide multiple composition service which can satisfy the personalized requirements for large-scale users.An extended graph-planning based Top-K service composition method is proposed in this paper.By using service indexes and the auxiliary nodes in extended planning graph,Top-K composition service can be found through one search.The approach can improve the efficiency of service composition and ensure the correctness of the result.It applies to the ASC problem in cloud which has a large number of services and the users' requirements are personalized.

Key words: service composition, Top-K, extended graph-planning, auxiliary node

中图分类号: