全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

QoS感知的全局最优快速服务选择

Keywords: Web服务组合,关键路径,整数规划,并行服务选择

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对已有的服务选择算法往往按业务流程中任务的执行顺序依次选择服务,使服务选择时间随着任务数和候选服务集规模的增大而变长,难以让用户接受,而且算法也并未考虑包含关键路径的组合结构QoS优化这一问题,设计了对等网络服务覆盖网,利用服务社区和任务代理,根据组合结构和关键路径将全局QoS约束分解为局部约束,支持并行化的服务选择.实验结果表明,该方法可以迅速有效地找到接近最优的服务组合方案.

References

[1]  Yu T, Zhang Y, Lin K J. Efficient algorithms for web services selection with end-to-end QoS constraints[J]. ACM Transaction on Web, 2007,1(1):6-32.
[2]  Zeng L Z, Boualem B. Quality driven web services composition[C]∥Proceedings of 12th International World Wide Web Conference. Budapest, Hungary:ACM Press, 2003:411-421.
[3]  Zhu Hongning, Zhang Bin, Gao Xianwen. A service selection method of non-critical task in parallel structure[C]∥Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining. Moscow, Russia:IEEE Computer Society, 2009:846-850.
[4]  Pinedo M. Scheduling:theory, algorithms, and systems[M]. 2nd ed. Upper Saddle River, USA:Prentice Hall, 2001.
[5]  Karloff H. Linear programming[M]. Boston, USA:Birkhauser,1991.
[6]  Yoon K,Hwang C. Multiple attribute decision making:an introduction[M]. Thousand Oaks, USA:Sage Publications, 1995.
[7]  PeerSim-Pastry. PeerSim-based Pastry protocol module implementation [EB/OL]. [2009-10-15]. http://code. google. com/p/peersim-pastry/.
[8]  Berkelaar M, Eikland K, Notebaert P. Open source (mixed-integer) linear programming system[EB/OL]. [2010-02-25]. http://lpsolve. sourceforge. net/.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133