首页 | 本学科首页   官方微博 | 高级检索  
     

基于Dijkstra算法的Web服务合成选择策略研究
引用本文:刘祾頠,夏元友,姜建华.基于Dijkstra算法的Web服务合成选择策略研究[J].微机发展,2008,18(2):104-107.
作者姓名:刘祾頠  夏元友  姜建华
作者单位:武汉理工大学计算机科学与技术学院 湖北武汉430070
基金项目:国家自然科学重点基金项目(E055033502)
摘    要:Web服务合成中操作的选择是一个关键问题,这直接影响到用户对合成的复合服务的满意度、解决该问题的关键是对候选Web服务的输入输出数据关系进行建模,以及有效利用这些已有的数据依赖关系实现服务合成的请求。通过从Web服务规范语言中提取Web服务的语义信息.掏建Web服务的有向图,并分析Diikstra算法用于Web服务合成的问题。提出了相应的船决办法,给出了一个基于Diikstra算法的Web服务合成选择策略的算法。该算法能在合成中选择最恰当的操作组合.产生最终的复合服务。

关 键 词:Web服务  Web服务合成  依赖图  选择策略
文章编号:1673-629X(2008)02-0104-04
修稿时间:2007年5月22日

Dijkstra Algorithm- Based Selection Strategy in Web Services Composition
LIU Ling-wei,XIA Yuan-you,JIANG Jian-hua.Dijkstra Algorithm- Based Selection Strategy in Web Services Composition[J].Microcomputer Development,2008,18(2):104-107.
Authors:LIU Ling-wei  XIA Yuan-you  JIANG Jian-hua
Affiliation:LIU Ling-wei, XIA Yuan-you,J IANG Jian-hua (College of Computer Science. and Technology, Wuhan University of Technology,Wuhan 430070, China)
Abstract:The choice of operation is a key problem in the Web services composition.It influences customer's satisfaction to the quality of the Web service composition directly.The key which solve this problem is to construct a model for input and output data dependency relationships of candidate Web services and realize the Web service composition request by using this available data dependency relationships.Using the semantic information which is abstracted from Web services specification languages,a so-called dependency graph is constructed,and analyze the problem which turn out when Dijkstra algorithm used in the Web services composition.Then an algorithm based on Dijkstra algorithm for the choice strategy in Web services composition is designed.This algorithm can choose the most fitting operation in the Web services composition and compound the end complex service.
Keywords:Web services  Web services composition  dependency graph  selection strategy
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号