Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (5): 143-145.

• 网络、通信与安全 • Previous Articles     Next Articles

Study on composition of Web service based on distributed awareness

CAI Hong1,SUN Hong-bin2   

  1. 1.Shanghai Xingjian College,Shanghai 200072,China
    2.College of Information Sciences and Technology,Donghua University,Shanghai 201620,China
  • Received:2007-05-31 Revised:2007-07-30 Online:2008-02-11 Published:2008-02-11
  • Contact: CAI Hong

基于分布感知的Web服务组合方法研究

蔡 红1,孙宏彬2   

  1. 1.上海行健职业学院,上海 200072
    2.东华大学 信息科学与技术学院,上海 201620
  • 通讯作者: 蔡 红

Abstract: A distributed awareness method of Web service composition is proposed.The mobile agent represents Web service and constitutes an autonomic unit.The Web service composition is achieved by the evolution of the mobile agent based on the semantic negotiation.Genetic composition algorithm has the limitation of dealing with complex route and the definition of penalty function.Thus,with relation matrix that can express the relation of Web services and QoS matrix,the optimization of the Web service composition is translated into a constrained optimization problem.A new nonparametric penalty function for evolutionary optimization is introduced to solve the problem.The simulation results show the enhancement of the performance and fitness.

Key words: mobile agent, constrained optimization, Web service, composition

摘要: 提出了一种分布感知的Web 服务组合方法。移动Agent代理Web 服务,构成一个自治的感知单元,移动Agent通过语义的协商确认匹配关系,Web 服务组合可以通过移动Agent的演化完成。常见的遗传组合算法存在着复杂路径表示和罚函数难于确定的局限性,采用感知基础上的服务关系矩阵和服务相对质量的矩阵,最优服务组合的建立转化为带约束的最优化问题,并给出不带参数的罚函数动态演化算法解决方案,仿真表明这种方法可以提高适应度和性能。

关键词: 移动agent, 约束优化, Web服务, 组合