摘要
提出一种动态Web服务环境下,并发请求时的服务组合方案KSC.该方案通过对QoS的建模和计算,从每个组件中选出效用值最优的前k个原子服务,然后进行组合去执行批量用户请求.接着,本文提出了当组合服务执行失败时的解决方案,即当组合服务中有原子服务不能满足要求时,根据前后组件各自选出的k个原子服务之间的输入输出功能关系,画出服务依赖图,进一步对出错的那个组件中的k个原子服务画出类聚图,最后利用A-KSC算法进行原子服务替换.最后,通过实验验证了本文中提出的模型与算法的可行性与有效性.
This paper presented an approach of service composition,named KSC,which is in a highly dynamic environment with many concurrent requests. By the modeling and calculation of QoS,this approach selects k atomic services with the optimal utility value for each service component,then combining them to perform bulk user requests. If a composite service fails,i. e.,there are atomic services of it which cannot meet requirements. Through the functional input and output relations between the two adjacent service components,a dependency graph can be drawn,then a clustering graph of the k atomic services of the component which failed,at last those failed atomic services are replaced by A-KSC algorithm. Finally,the viability and effectiveness of the models and algorithms are verified.
出处
《小型微型计算机系统》
CSCD
北大核心
2014年第7期1556-1560,共5页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(61273216
61272111
61100017
61100018)资助
武汉市科技攻关计划项目(201210621214)资助
江苏省电子商务重点实验室开放基金项目(JSEB2012-02)资助
关键词
并发请求
QOS
服务组合
原子服务
concurrent requests
quality of service
service composition
atomic services
