期刊文献+

一种服务聚合中QoS全局最优服务动态选择算法 被引量:146

A Dynamic Web Services Selection Algorithm with QoS Global Optimal in Web Services Composition
在线阅读 下载PDF
导出
摘要 Web服务作为一种新型的Web应用模式,近年来得到了迅速的发展.如何动态地把现存的各种Web服务整合起来以形成新的、满足不同用户需求的、增值的复杂服务已成为新的应用需求和研究热点.针对现有服务聚合中服务选择技术的不足,提出了一种解决服务聚合中服务动态选择QoS全局最优化问题的实现算法GODSS(global optimal of dynamic Web services selection).算法的主要思想是把服务动态选择全局最优化问题转化为一个带QoS约束的多目标服务组合优化问题,利用多目标遗传算法的智能优化原理,通过同时优化多个目标函数,最终产生一组满足约束条件的Pareto优化服务聚合流程集.理论分析和实验结果说明了算法的可行性和有效性. As a new Web pattern, Web service has been rapidly developed in recent years. How to dynamically integrate the existent Web services to form a newly value-added and complex service to meet the requirement of different users is a popular research area. This paper presents an algorithm GODSS (global optimal of dynamic Web services selection) to resolve dynamic Web services selection with QoS global optimal in Web services composition. The essence of the algorithm is that the problem of dynamic Web Service selection with QoS global optimal is transformed into a multi-objective services composition optimization with QoS constraints. The theory of intelligent optimization of multi-objective genetic algorithm is utilized to produce a set of optimal Pareto services composition process with constraint principle by means of optimizing various objective functions simultaneously. Theoretical analysis and experimental results indicate the feasibility and efficiency of this algorithm.
出处 《软件学报》 EI CSCD 北大核心 2007年第3期646-656,共11页 Journal of Software
基金 Supported by the National HighTech Research and Development Plan of China under Grant Nos.2002AA134010 2002AA134020 2003AA135110(国家高技术研究发展计划(863))
关键词 服务聚合 服务选择 QoS全局最优化 GODSS(global OPTIMAL of dynamic WEB SERVICES selection) 多目标遗传算法 Web services composition service selection QoS global optimal GODSS (global optimal of dynamic Web services selection) multi-objective genetic algorithm
  • 相关文献

参考文献3

二级参考文献40

  • 1S Chen, K Nahrstedt. An overview of quality-of-service routing for next-generation high-speed networks: Problems and solutions.IEEE Network, 1998, 12(6): 64~79
  • 2F Kuipers, P Van Mieghen, T Korkmaz, et al. An overview of constraint-based path selection algorithms for QoS routing. IEEE Communications Magazine, 2002, 40(12): 50~55
  • 3M R Garey, D S Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W H Freeman and Company, 1979
  • 4马振华.现代应用数学手册--运筹学与最优化理论卷.北京:清华大学出版社,1998(Ma Zhenhua. Modern Applying Mathermatics ManualOperational Research and Optimization Theory (in Chinese) .Beijng: Tsinghua University Press, 1998)
  • 5A Juttner, B Szviatovszki, I Mecs, et al. Lagrange relaxation based method for the QoS routing problem. INFOCOM 2001,Alaska, USA, 2001
  • 6Z Wang, J Crowcroft. Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications, 1996, 14(7): 1228~1234
  • 7M I Henig. The shortest path problem with two objective functions. European Journal of Operational Research, 1985, 25(2): 281~291
  • 8P Van Meghem, H De Neve, F A Kuipers. Hop-by-hop quality of service routing. Computer Networks, 2001, 37(3-4): 407~423
  • 9R Tapabrata. Constrained robust optimal design using a multiobjective evolutionary algorithm. In: Proc of Congress on Evolutionary Computation. New York: IEEE Computer Society Press, 2002. 419~424
  • 10D A Van Veldhuizen, G B Lamont. Evolutionary computation and convergence to a Pareto front. In: John R Koza ed. Late Breaking Papers at the Genetic Programming 1998 Conference. San Mateo,CA: Morgan Kaufmann Publishers, 1998. 221~228

共引文献72

同被引文献1217

引证文献146

二级引证文献645

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部