[1]谢海军,齐连永,窦万春.基于Skyline和局部选择的启发式服务组合方法[J].东南大学学报(自然科学版),2011,41(3):449-452.[doi:10.3969/j.issn.1001-0505.2011.03.003]
 Xie Haijun,Qi Lianyong,Dou Wanchun.Combining Skyline and local selection for heuristic Web service composition[J].Journal of Southeast University (Natural Science Edition),2011,41(3):449-452.[doi:10.3969/j.issn.1001-0505.2011.03.003]
点击复制

基于Skyline和局部选择的启发式服务组合方法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
41
期数:
2011年第3期
页码:
449-452
栏目:
计算机科学与工程
出版日期:
2011-05-20

文章信息/Info

Title:
Combining Skyline and local selection for heuristic Web service composition
作者:
谢海军齐连永窦万春
(南京大学计算机软件新技术国家重点实验室,南京210093)(南京大学计算机科学与技术系,南京 210093)
Author(s):
Xie Haijun Qi LianyongDou Wanchun
(State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China)
(Department of Computer Science and Technology, Nanjing University, Nanjing 210093, China)
关键词:
服务组合启发式局部选择Skyline
Keywords:
service composition heuristic local selection Skyline
分类号:
TP311.5
DOI:
10.3969/j.issn.1001-0505.2011.03.003
摘要:
为了改善现有基于QoS的Web服务组合方法的效率,在已有服务组合算法的基础上提出了一种新颖的基于Skyline点和局部选择的启发式服务组合方法SLOMIP (Skyline local optimization mixed integer programming).该方法首先从候选服务集合中选出Skyline服务,可以证明如果存在最优服务组合方案,则其一定是由Skyline服务集中的服务组成的.然后,为了进一步缩小解空间,再从Skyline服务集中选取最优的K个服务进行最终服务组合方案的优化求解.与传统启发式服务组合方法的不同之处在于,该方法一旦获得解,必然是最优解而不是次优解.实验结果表明:在固定任务总数和固定候选服务个数的情况下,该方法的效率都远高于传统方法; K值越大,该方法的准确率越高.该方法可较大幅度地提高服务组合的效率,提升用户体验.
Abstract:
To improve the efficiency of existing QoS-aware Web service composition methods, a novel heuristic Web service composition method, named SLOMIP (Skyline local optimization mixed integer programming), is proposed. Based on existing Web service composition methods, SLOMIP combines Skyline point and local selection methods. First, for each service class, Skyline services are determined from the set of candidate services. It can be proved that each constituent service of the optimal service composition solution belongs to the Skyline services of the corresponding service class. Next, to further reduce the solution space, top K optimal services are selected from the Skyline services of each service class, for final service composition optimization. Unlike traditional heuristic service composition methods, the composition solution determined by using this method must be the optimal solution other than a near-to-optimal solution. Experimental results demonstrate that the SLOMIP method greatly improves the service composition efficiency if the number of tasks and the number of candidate services are fixed separately. The greater the K value, the higher the accuracy. This method can greatly improve the efficiency of Web service composition, and enhance the user experience.

参考文献/References:

[1] Zeng L,Benatallah B,Ngu A H H,et al.QoS-aware middleware for Web services composition[J].IEEE Transactions on Software Engineering,2004,30(5):311-327.
[2] Alrifai M,Risse T.Combining global optimization with local selection for efficient QoS-aware service composition[C]//Proceedings of the 18th International Conference on World Wide Web.Madrid,Spain,2009:881-890.
[3] Kritikos K,Plexousakis D.Mixed-integer programming for QoS-based Web service matchmaking[J].IEEE Transactions on Services Computing,2009,2(6):122-139.
[4] Yu T,Zhang Y,Lin K-J.Efficient algorithms for Web services selection with end-to-end QoS constraints[J].ACM Transactions on the Web,2007,1(1):6.
[5] Canfora G,Di P M,Esposito R,et al.A framework for QoS-aware binding and re-binding of composite Web services[J].Journal of Systems and Software,2008,81(10):1754-1769.
[6] Alrifai M,Skoutas D,Risse T.Selecting Skyline services for QoS-based Web service composition[C]//Proceedings of the 19th International Conference on World Wide Web.Raleigh,USA,2010:11-20.
[7] Papadias D,Tao Y F,Fu G,et al.Progressive Skyline computation in database systems[J].ACM Trans Database Syst,2005,30(1):41-82.
[8] Berkelaar K E M,Notebaert P.Open source (mixed-integer) linear programming system.Sourceforge[EB/OL].[2010-10-12].http://lpsolve.sourceforge.net/.

相似文献/References:

[1]孙学胜,曹玖新,刘波,等.基于多目标粒子群优化的服务选择算法[J].东南大学学报(自然科学版),2009,39(4):684.[doi:10.3969/j.issn.1001-0505.2009.04.007]
 Sun Xuesheng,Cao Jiuxin,Liu Bo,et al.Service selection algorithm based on multi-objective particle swarm optimization[J].Journal of Southeast University (Natural Science Edition),2009,39(3):684.[doi:10.3969/j.issn.1001-0505.2009.04.007]
[2]贺正求,吴礼发,李华波,等.请求驱动的服务组合访问控制[J].东南大学学报(自然科学版),2011,41(3):443.[doi:10.3969/j.issn.1001-0505.2011.03.002]
 He Zhengqiu,Wu Lifa,Li Huabo,et al.Request-driven access control for service composition[J].Journal of Southeast University (Natural Science Edition),2011,41(3):443.[doi:10.3969/j.issn.1001-0505.2011.03.002]

备注/Memo

备注/Memo:
作者简介:谢海军(1986—),男,硕士生;窦万春(联系人),男,博士,教授,博士生导师,douwc@nju.edu.cn.
基金项目:国家自然科学基金资助项目(60721002,61073032,60736015)、江苏省自然科学基金资助项目(BK2008017).
引文格式: 谢海军,齐连永,窦万春.基于Skyline和局部选择的启发式服务组合方法[J].东南大学学报:自然科学版,2011,41(3):449-452.[doi:10.3969/j.issn.1001-0505.2011.03.003]
更新日期/Last Update: 2011-05-20