| 满足原子事务与QoS端对端约束的服务优化选择方法 |
| |
| 引用本文： | 刘 海,张卫民,张瞩熹,贾 雄,廖 蔚.满足原子事务与QoS端对端约束的服务优化选择方法[J].通信学报,2011,32(7):80-92. |
| |
| 作者姓名： | 刘 海 张卫民 张瞩熹 贾 雄 廖 蔚 |
| |
| 作者单位： | 1. 国防科学技术大学计算机学院软件所,湖南长沙,410073
2. 总后科研所,北京,100071 |
| |
| 基金项目： | 国家高技术研究发展计划(“863”计划)基金资助项目(2006AA01A123,2010AA012404); 国家自然科学基金资助项目(60903042,60736013)~~ |
| |
| 摘 要： | 提出了一种基于层次服务候选图(SCG)模型优化选择方法,该方法首先利用提出的构造规则和规约规则来构造SCG模型,以建模候选服务之间的事务约束关系,并且该模型关于事务约束的正确性得以证明;其次,提出一种基于广度优先搜索(BFS)的全局QoS感知近优选择算法,该算法基于每个任务的事务属性进行放松剪枝,以控制算法的搜索规模在多项式时间内完成。最后,以网络在线发布的实际Web服务QoS数据和随机产生数据为测试集做模拟实验,结果表明本文提出方法在全局QoS效用和选择成功率方面优于其他相关方法,同时实验通过实现事务约束自动机从实践上也验证了该方法的正确性。
|
| 关 键 词： | 云计算 服务候选图 原子事务 QoS感知服务选择 BFS |
Optimal service selection approach considering both atomic transaction and end-to-end QoS constraints |
| |
| LIU Hai,ZHANG Wei-min,ZHANG Zhu-xi,JIA Xiong,LIAO Wei.Optimal service selection approach considering both atomic transaction and end-to-end QoS constraints[J].Journal on Communications,2011,32(7):80-92. |
| |
| Authors: | LIU Hai ZHANG Wei-min ZHANG Zhu-xi JIA Xiong LIAO Wei |
| |
| Affiliation: | LIU Hai1,ZHANG Wei-min1,ZHANG Zhu-xi2,JIA Xiong1,LIAO Wei1(1.Department of Software,School of Computer,National University of Defense Technology,Changsha 410073,China,2.General Logistics Research Institute,Beijing 100071,China) |
| |
| Abstract: | An actual SCG(service candidate graph) model-based optimal service selection approach was proposed.Firstly,the approach created transactional constraint relationships among candidates as an actual SCG model with several build-ing rules,whose correctness had been also proved;Then,an optimal QoS-aware service selection algorithm on the basis of BFS(breadth first search) was designed,where a relaxing and pruming method was applied to keep the computation scale in polynomial time.Finally,simulation experiments ... |
| |
| Keywords: | cloud computing service candidate graph atomic transaction QoS-aware service selection BFS |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
|
