期刊文献+

基于粒子群优化的负载均衡的虚拟网络映射 被引量:15

Load-balancing Based on Particle Swarm Optimization in Virtual Network Mapping
下载PDF
导出
摘要 虚拟网络映射忽略通信路径上中间节点的资源消耗,以底层物理网络资源消耗最小或路径最短为目标,导致最优路径上中间节点资源不足而出现瓶颈,影响整个底层网络的性能及后续虚拟网络请求成功率。该文针对这一问题考虑物理路径上中间节点资源消耗,以节点负载和链路负载同时达到均衡为目标,将路径跳数限制作为约束,建立虚拟网络映射的数学模型,并采用多目标负载均衡粒子群优化算法求解,记作LB-PSO。实验证明该算法有效地消除了资源瓶颈,为后续虚拟网络请求提供一个更为均衡的底层物理网络,从而提高了虚拟网络构建成功率、网络资源利用率以及基础设施提供商的收益。 Virtual networking mapping aims at minimal resource consumption or shortest path at substrate network,but ignores the resource demanded by the hidden hops,making bottlenecks due to the resource shortage at the hidden hops,and finally influences the performance of the entire substrate network and the request success rate of the consequential virtual network.Pointing at above problem and taking into account the resource demanded by the hidden hops,this paper aims at the simultaneous loading balance of the substrate node and the substrate link,mathematically formulate the virtual networking mapping problem constrained by hops,and solves it using multi-objective Load-Balancing Particle Swarm Optimization(LB-PSO) algorithm.This algorithm eliminates resource bottleneck efficiently,provides a more balanced substrate network for the request of the consequential virtual network request,thus improving the constructing success rate of virtual network,the availability of network resources and the profits of the infrastructure providers.
出处 《电子与信息学报》 EI CSCD 北大核心 2013年第7期1753-1759,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金(2009CB320406) 国家863计划项目(2011AA01A102) 国家创新研究群体科学基金(60821001)资助课题
关键词 云计算 虚拟网映射 节点资源 负载均衡粒子群优化 Cloud computing Virtual network mapping Resource of hidden hops Load-Balancing Particle Swarm Optimization(LB-PSO)
  • 相关文献

参考文献12

  • 1Chowdhury N M M K, Rahman M R, and Boutaba R. Virtual network embedding with coordinated node and link mapping[C]. Proceedings of IEEE INFOCOM, Rio deJaneiro, Brazil, 2009: 783-79l.
  • 2Zhang M, Wu C,Jiang M, et al.. Mapping multicast service-oriented virtual networks with delay and delay variation constraints[C]. Proceedings of the IEEE Conference on Global Telecommunications, Miami, Florida, USA, 2010: 1-5.
  • 3Zhang S and Qiu X. A novel virtual network mapping algorithm for cost minimizing[J].Journal of Selected Areas in Telecommunications, 2011, 29(1): 1-9.
  • 4Sun G, Yu H, Li L, et al.. Efficient algorithms for survivable virtual network embedding[C]. Proceedings of the Asia Communications and Photonics Conference and Exhibition (ACP), Shanghai, China, 2010: 531-532.
  • 5FaJ Jari I, Aitsaadi N, Pujolle G, et al .. VNE-AC: virtual network embedding algorithm based on ant colony metaheuristic[C] . Proceedings of the IEEE International Conference on Communications (ICC), Kyoto,Japan, 2011: 1-6.
  • 6Zhu Y and Ammar M. Algorithms for assigning substrate network resources to virtual network components[C]. Proceedings of IEEE INFOCOM, Barcelona, Catalunya, Spain, 2006: 1-12.
  • 7Yu M, Yi Y, RexfordJ, et al .. Rethinking virtual network embedding: substrate support for path splitting and migration[J]. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 17-29.
  • 8BoteroJ F, Hesselbach X, Fischer A, et al .. Optimal mapping of virtual networks with hidden hops[J]. Telecommunication Systems, 2012, 51(4): 273-282.
  • 9姜明,王保进,吴春明,孔祥庆,闵啸,张旻.网络虚拟化与虚拟网映射算法研究[J].电子学报,2011,39(6):1315-1320. 被引量:25
  • 10齐宁,王保进,汪斌强,张栋.均衡虚拟网构建算法研究[J].电子与信息学报,2011,33(6):1301-1306. 被引量:14

二级参考文献27

  • 1杨鹏,刘业.新型网络体系结构描述语言及其在分布式流媒体服务规约中的应用[J].电子学报,2007,35(1):165-169. 被引量:2
  • 2Turner J and Taylor D. Diversifying the internet[C]. Proceedings of the IEEE Conference on Global Telecommunications. St. Louis, USA, 2005: 755-760.
  • 3Mosharaf Kablr Chowdhury N M and Raouf Boutaba. Network virtualization: state of the art and research challenges[J]. IEEE Communication Magazine, 2009, 47(7): 20-26.
  • 4Gupta A, Kleinberg J, Kumar A, Rastogi R, and Yener B. Provisioning a virtual private network: a network design problem for multicommodity flow[C]. Proceedings of ACM Symposium on Theory Of Computing (STOC), Heraklion, Crete, Greece, 2001: 389-398.
  • 5Lu J and Turner J. Efficient mapping of virtual networks onto a shared substrate [R]. Washington University, Technical Report WUCSE-2006-35, 2006.
  • 6Mosharaf N M, Rahman Muntasir Raihan, and Boutaba Raouf. Virtual network embedding with coordinated node and link mapping[C]. Proceedings of the 28th Conference on Computer Communications, Rio de Janeiro, USA, IEEE,2009: 783-791.
  • 7Yu Minlan, Yi Yung, Rexford J, and Chiang M. Rethinking virtual network embedding: substrate support for path splitting and migration[C1. Proceedings of ACM SIGCOMM on Computer Communication, Seattle, WA, USA, 2008: 17-29.
  • 8Jens L and Holger K. A virtual network mapping algorithm based on subgraph isomorphism detection[C]. Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures. Barcelona, Spain, 2009: 81-88.
  • 9Capone A, Elias J, and Martignon F. Routing and resource optimization in service overlay networks [J]. Elsevier Computer Networks, 2009, 53(2): 180-190.
  • 10Zhu Y and Ammar M. Algorithms for assigning substrate network resources to virtual network components[C]. Proceedings of IEEE INFOCOM, Barcelona, Catalunya, Spain, 2006: 1-12.

共引文献32

同被引文献140

引证文献15

二级引证文献68

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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