浏览全部资源
扫码关注微信
1. 南京大学计算机软件新技术国家重点实验室,江苏,南京,210093
2. 南京大学计算机科学与技术系,江苏,南京,210093
3. 南京大学计算机软件新技术国家重点实验室,江苏,南京,210093
4. 南京大学计算机科学与技术系,江苏,南京,210093
Published:2012
移动端阅览
A QoS Pruning-Based Top-k Automatic Service Composition Method[J]. Acta Electronica Sinica, 2012, 40(7): 1489-1491.
DOI:
A QoS Pruning-Based Top-k Automatic Service Composition Method[J]. Acta Electronica Sinica, 2012, 40(7): 1489-1491. DOI: 10.3969/j.issn.0372-2112.2012.07.033.
在大规模的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-optimal 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 platform is designed for implementing the proposed method
and its experiment results validate the effectiveness and efficiency of the method.
0
Views
1495
下载量
4
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution