依赖知识的服务组合算法

鲍军鹏; 宋楠; 陶斌

doi:10.7652/xjtuxb201308001

您当前的位置：

首页 >

文章列表页 >

依赖知识的服务组合算法

更新时间：2025-05-08

- 依赖知识的服务组合算法
- A Knowledge-Based Service Composition Algorithm
- 西安交通大学学报 2013年47卷第8期页码：1-6+67
- 作者机构：
  
  西安交通大学计算机科学与技术系,西安,710049
- 作者简介：
- 基金信息：
  
  : 2012-10-29。作者简介: 鲍军鹏(1974—),男,副教授。基金项目: 国家自然科学基金资助项目(60903123);百度大规模机器学习与数据挖掘研究计划资助项目
- DOI：10.7652/xjtuxb201308001
  中图分类号： TP311
- 网络首发：2013-08-10，
  
  纸质出版：2013
- 稿件说明：
移动端阅览
鲍军鹏, 宋楠, 陶斌. 依赖知识的服务组合算法[J]. 西安交通大学学报, 2013,47(8):1-6+67.

A Knowledge-Based Service Composition Algorithm[J]. 2013, 47(8): 1-6+67.
鲍军鹏, 宋楠, 陶斌. 依赖知识的服务组合算法[J]. 西安交通大学学报, 2013,47(8):1-6+67. DOI： 10.7652/xjtuxb201308001.

A Knowledge-Based Service Composition Algorithm[J]. 2013, 47(8): 1-6+67. DOI： 10.7652/xjtuxb201308001.

摘要

针对面向服务的体系结构中Web服务和服务组合技术在下一代互联网和云计算领域中的应用问题

提出了一种依据知识对原子服务进行组合的3步服务组合算法

分为相邻节点连接匹配、断枝节点清理和原子服务组合3个步骤。相邻节点连接匹配就是完成相邻的服务节点之间连接匹配

将所有允许的连接都存入弧的连接链表中。通过断枝节点清理

删除所有没有连接的候选原子服务

因为在候选队列中会存在许多断枝服务节点。通过原子服务组合

从清理过断枝节点之后的剩余候选服务中整理出服务组合实例。实验表明:算法可以实现服务的自动化装配

不需要用户参与服务调用过程

通过原子服务间的可连接性以及知识模型生成服务组合实例

从而实现原子服务数量和检测范围的有效控制。

Abstract

A knowledge-based service composition algorithm is proposed to apply the techniques of service-oriented architecture including Web service and service composition in the area of the next generation Internet and the cloud computing. The algorithm consists of three key steps

i.e. connection matching between adjacent nodes

deleting broken nodes

and building service composition instance. All possible links between candidate primary service nodes are found and stored in an arc list at the first step. Then

the candidate primary service nodes that can not make a legal path are deleted in the second step. A service composition instance is built from the rest candidates in the step 3. The algorithm automatically assembles services without user's intervention during the service procedure

and builds the service composition instance in terms of a knowledge model and the connectivity between primary services. Test results show that the number of primary services and detection ranges can be effectively controlled.

关键词

Keywords

references

PAPAZOGLOU M, HEUVEL W J. Service oriented architectures: approaches,technologies and research issues [J]. The VLDB Journal, 2007,16(3):389-415.

STAAB S, AALST W, BENJAMINS V R, et al. Web services:been there,done that? [J]. IEEE Intelligent Systems, 2003,18(1):72-85.

BAO J P, TAO B, SU J, et al. Data mining service architecture:an exploration on self-organizing software [C]∥Proceedings of the 7th ICSOFT. Rome, Italy: SciTePress, 2012:463-467.

KHALAF R, MUKHI N, WEERAWARANA S. Service-oriented composition in BPEL4WS [C]∥Proceedings of the WWW2003. New York, USA: ACM, 2003:680-687.

TANG X, JIANG C, ZHOU M. Automatic Web service composition based on Horn clauses and Petri nets [J]. Expert Systems with Applications, 2011,38(10):13024-13031.

HUANGFU X, SHU Z, CHEN H H, et al. Research on dynamic service composition based on object Petri net for the networked information system [C]∥Proceedings of the Fifth International Joint Conference on INC,IMS and IDC. Piscataway, NJ, USA: IEEE, 2009:1075-1080.

廖军,谭浩,刘锦德. 基于Pi-演算的Web服务组合的描述和验证 [J]. 计算机学报, 2005,28(4):635-643.

LIAO Jun, TAN Hao, LIU Jinde. Describing and ver-ifying Web service using Pi-calculus [J]. Chinese Journal of Computers, 2005,28(4):635-643.

DING W, WANG J, HAN Y. ViPen: a model supporting knowledge provenance for exploratory service composition [C]∥Proceedings of the IEEE ICSC 2010. Piscataway, NJ, USA: IEEE, 2010:265-272.

MILLER G, EVANS A, JACOBSON I, et al. Model driven architecture: how far have we come, how far can we go? [C]∥Proceedings of the OOPSLA'03 Companion of the 18th Annual ACM SIGPLAN Conference on Object-oriented Programming,Systems,Languages, and Applications. New York, USA: ACM, 2003:273-274.

FUJII K, SUDA T. Semantics-based context-aware dynamic service composition [J]. ACM Transactions on Autonomous and Adaptive Systems, 2009,4(2):1-31.

CHABEB Y, TATA S, OZANNE A. YASA-M: a semantic web service matchmaker [C]∥Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications. Piscataway, NJ, USA: IEEE, 2010:966-973.

SHENG Q Z, BENATALLAH B, DUMAS M, et al. SELF-SERV: a platform for rapid composition of web services in a peer-to-peer environment [C]∥Proceedings of the 28th International Conference on Very Large Databases. Hong Kong, China: Morgan Kaufmann, 2002:1051-1054.

EZENWOYE O, SADJADI S M, CARY A, et al. Grid service composition in BPEL for scientific applications [M]∥Lecture Notes in Computer Science: Vol.4804. Berlin, Germany: Springer-Verlag, 2002:1304-1312.

ZHEN L, PARASHAR M. An infrastructure for dynamic composition of grid services [C]∥Proceedings of the IEEE GCC 2006. Piscataway, NJ, USA: IEEE, 2006:315-316.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

一种基于最小覆盖的复杂Web 服务组合方法

内容寻址网络的P2P语义Web服务组合系统架构

面向投影时序逻辑的Web服务模型检测

面向服务级别协议的核实与规划服务质量系统框架研究

一种服务质量可信的按需服务组合方法