| 基于IOQ模型的Web服务组合算法 |
| |
| 引用本文： | 王创伟.基于IOQ模型的Web服务组合算法[J].计算机工程,2009,35(10):66-67. |
| |
| 作者姓名： | 王创伟 |
| |
| 作者单位： | 盐城师范学院信息科学与技术学院,盐城,224002 |
| |
| 摘 要： | 提出一种IOQ模型及在该模型下求解构成复杂服务的各个子服务的算法，将该类服务组合问题转化为简单问题，即在满足QoS约束的服务集合中，已知服务的输入集合和输出集合，利用输出集合倒序查找各子服务及其输入集合。针对该类服务组合问题，给出算法模型及求解问题算法的伪代码。
|
| 关 键 词： | Web服务 原子服务 服务组合 |
| 修稿时间： | |
Web Service Composition Algorithm Based on IOQ Model |
| |
| WANG Chuang-wei.Web Service Composition Algorithm Based on IOQ Model[J].Computer Engineering,2009,35(10):66-67. |
| |
| Authors: | WANG Chuang-wei |
| |
| Affiliation: | School of Information Science and Technology;Yancheng Teachers University;Yancheng 224002 |
| |
| Abstract: | This paper presents an IOQ model and the algorithm for a complex services from the various element services.The composition of such services is transformed into more simple question,which is reverse inquiry of element service and services discovery of input set from the input set and output set of known services,in the services set of meeting the quality of service constraints.Algorithm model and pseudo-code of the services composition are proposed which aims at the services composition. |
| |
| Keywords: | Web service element service service composition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
