摘要
在大规模的Web服务中自动搜索满足功能性需求并且QoS前k优的服务组合是一个具有挑战性的问题.为解决此问题,本文方法首先对服务组合进行建模,然后通过前向服务过滤算法缩小求解空间,最后利用贪婪算法进行QoS剪枝以加快Top-k服务组合的后向搜索.本文给出了该方法的系统结构设计,实验结果验证了此方法的可行性和高效性.
Generally,in the situation of vast amount of Web services,it is often a challenge to automatically searching for Top-k QoS-opfimal service composition plans. To address the challenge, service composition modeling is proposed firstly. Then, a forward service filtering algorithm is employed for reducing solution spaces. Lastly,a greedy-based pruning algorithm is designed for backward searching for Top-k QoS-optimal solutions efficiently. In addition, a plafform is designed for implementing the proposed method, and its experiment results validate the effectiveness and efficiency of the method.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2012年第7期1489-1491,共3页
Acta Electronica Sinica
基金
国家自然科学基金(No.61021062
No.61073032
No.60736015)
江苏省自然科学基金(No.BE2011171)
