期刊文献+

基于QoS的Pareto最优的服务选择

Pareto optimal policy for QoS-based service selection
下载PDF
导出
摘要 随着越来越多的服务能够满足用户的功能需求,需要一种策略基于服务的多种QoS属性来帮助用户选择合适的服务。以XML描述服务的QoS属性,提出了一种基于QoS的Pareto最优的服务选择策略,选择出那些不在所有的QoS属性上劣于其它服务的服务。实验结果表明,与随机选择和偏好导向的选择策略相比,Pareto最优策略有独特的效果。 With a wide variety of services are offered that can satisfy the functional requirements, a policy is needed to support users in the eventual selection of appropriate services according to multiple QoS attributes. Service's QoS attributes in XML is described and a Pareto optimal policy for service selection is proposed, which can select appropriate services not worse than any other service on all QoS attributes. The experimental results indicate that the Pareto optimal policy proposed outperforms the random selection and preferenceoriented policy.
出处 《计算机工程与设计》 CSCD 北大核心 2009年第2期282-285,290,共5页 Computer Engineering and Design
基金 国家863高技术研究发展计划基金项目(2006AA01Z231) 国家自然科学基金项目(60673123)
关键词 服务质量 PARETO最优 Pareto算法 服务选择 服务发现 QoS Pareto optimal Pareto algorithm service selection service discovery
  • 相关文献

参考文献10

  • 1Michael Maximilien E,Munindar P Singh.A framework and ontology for dynamic web services selection [J]. IEEE Interact Computing,2004,8(5):84-93.
  • 2Michael Maximilien E.Toward autonomic web services trust and selection[C].Proceedings of the 2rid International Conference on Service Oriented Computing.NY USA:ACM Press,2004:212- 221.
  • 3Liu Yutu,Anne H Ngu,Liang Z Zeng.QoS computation and policing in dynamic web service selection[C].Proc of the 13th Internatioal World Wide Web Conference,2004:66-73.
  • 4Tong Hongxia, Zhang Shensheng.A fuzzy multi-attribute decision making algorithm for web services selection based on QoS [C].APSCC,2006.
  • 5Bentley J.Multidimensional divide-and-conquer[J].Communications of the ACM,1980,23(4):214-229.
  • 6Marc Geilen,Twan Basten.A calculator for pareto points[C].Proceedings of the Conference on DATE,2007.
  • 7郑彦兴,田菁,窦文华.基于Pareto最优的QoS路由算法[J].软件学报,2005,16(8):1484-1489. 被引量:9
  • 8Jia Zhou,Kendra Cooper.On the customization of components: A rule-based approach [J]. IEEE Trans Knowl Data Eng, 2007,19 (9):1262-1275.
  • 9DZG Garcia,MBF de Toledo.Semantics-enriched QoS policies for web service interactions [C]. Natal, RN, Brazil: WebMedia, 2006.
  • 10Cuddy S,Katchabaw M,Lutfiyya H.Context-aware service selection based on dynamic and static service attributes[C].WiMob, 2005:13 -20.

二级参考文献7

  • 1Orda A. Routing with end-to-end QoS guarantees in broadband networks. IEEE/ACM Trans. on Neworking, 1999,7(3):365-374.
  • 2Lorenz DH, Orda A, Raz D, Shavitt Y. Efficient QoS partition and routing of unicast and multicast. In: Proc. of the IEEE 8th In'd()Workshop on Quality of Service (IWQoS). 2000.75-83.
  • 3Juttner A, Szviatovszki B, Mecs I, Rajko Z. Lagrange relaxation based method for the QoS routing problem. In: Proc. of the INFOCOM 2001, Vol 2. 2001. 859-868.
  • 4van Mieghem P, De Neve H, Kuipers FA. Hop-by-Hop quality of service routing. Computer Network, 2001,37(3-4):407-423.
  • 5Korkmaz T, Krunz M. Multi-Constrained optimal path selection. IEEE INFOCOM, 2001. 834-843.
  • 6Cui Y, Xu K, Wu JP. Precomputation for multi-constrained QoS routing in high-speed networks. IEEE INFOCOM, 2003.
  • 7Van Mieghem P, Kuipers FA. Concepts of exact QoS routing algorithms.IEEE/ACM Trans. on Networking, 2004,12:851-864.

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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