基于负载均衡的逻辑承载网构建研究

doi:1000-436X(2012)09-0038-06

通信学报 ›› 2012, Vol. 33 ›› Issue (9): 38-43.doi: 1000-436X(2012)09-0038-06

基于负载均衡的逻辑承载网构建研究

王浩学¹,姜明²,付吉¹

¹ 解放军信息工程大学，河南郑州450001
² 杭州电子科技大学计算机学院，浙江杭州310018

出版日期:2012-09-25 发布日期:2017-07-20
基金资助:
国家重点基础研究发展计划（“973”计划）基金资助项目;浙江省自然科学基金资助项目;浙江省自然科学基金资助项目;浙江省科技计划基金资助项目

Research on load-balanced construction algorithm of logical carrying network

Hao-xue WANG¹,Ming JIANG²,Ji FU¹

¹ The PLA Information Engineering University,Zhengzhou 450001,China
² Computer Science College of Hangzhou Dianzi University,Hangzhou 310018,China

Online:2012-09-25 Published:2017-07-20
Supported by:
The National Basic Research Program of China(973 Program);The Natural Science Founda-tion of Zhejiang Province;The Natural Science Founda-tion of Zhejiang Province;Zhejiang Provincial Technical Plan Project

摘要/Abstract

摘要：

逻辑承载网构建将网络服务需求映射到物理网络，以增强网络服务的可扩展性。为解决构建效率问题，借鉴负载均衡思想，提出了对不同服务需求提供不同网络资源的按需承载策略，并基于可用资源和链路负载状态，用改进的多物质流模型进行优化计算。通过仿真实验，从构建成功率、构建平均收益等方面验证了算法具有更高的网络服务提供能力。

关键词: 逻辑承载网, 负载均衡, 服务提供, 多物质流模型

Abstract:

To improve the extensibility of network service,constructing algorithm of logical carrying network was pro-posed by mapping the demands of network service into substrate network.To solve the problem of construction efficiency,on-demand carrying strategy was introduced to provide different resources to meet different service requirements.Based on available resource and current link load,an improved multi-commodity flow model was proposed to compute the re-source allocation.Simulation results indicate this al ithm can improve network service capability from construction success rate and average construction profit.

Key words: logical carrying network, load balancing, service-providing, multi-commodity flow model

王浩学,姜明,付吉. 基于负载均衡的逻辑承载网构建研究[J]. 通信学报, 2012, 33(9): 38-43.

Hao-xue WANG,Ming JIANG,Ji FU. Research on load-balanced construction algorithm of logical carrying network[J]. Journal on Communications, 2012, 33(9): 38-43.

图/表 2

参考文献 11

[1]	汪斌强，邬江兴．下一代互联网的发展趋势及相应对策分析[J]．信息工程大学学报， 2009,10(1):1-10. WANG B Q , WU J X . Development trends and associated counter-measures analysis for NGN[J]. Journal of Information E gineering University, 2009,10(1):1-10.
[2]	王浩学，汪斌强，于婧等．一体化承载网络体系架构研究[J]．计算机学报， 2009,32(3):371-376. WANG H X , WANG B Q , YU J , et al. Research on architecture of universal carrying network[J]. Chinese Journal of Computers, 2009,32(3):371-376.
[3]	PETERSON L , SHENKER S , TURNER J . Overcoming the internet impasse through virtualization[J]. IEEE Computer, 2005,38(4): 34-41.
[4]	YU M , YI Y , REXFORD J . Rethinking Virtual Network Embedding:Substrate Support for Path Splitting and Migration[R]. Princeton University,Technical Report TR-788-07, 2007.
[5]	RICCI R . A solver for the network testbed mapping problem[J]. ACM Computer Communication Review, 2003,33(2): 65-81.
[6]	LU J , TURNER J . Efficient Mapping of Virtual Networks onto a Shared Substrate[R]. Washington University,Technical Report WUCSE-2006-35, 2006.
[7]	YU M , YI Y , JENNIFER R , et al. Rethinking virtual network embedding:substrate support for path splitting and migration[J]. ACM SIGCOMM Computer Communication Review, 2008,38(2): 17-29.
[8]	SZETO W , IRAQI Y , BOUTABA R . A multi-commodity flow based approach to virtual network resource allocation[A]. IEEE GLOBE-COM 2003[C]. San Francisca,USA, 2003. 3004-3008.
[9]	AHUJA R K , MAGNANTI T L , ORLIN J B . Network Flows:Theory,Algorithms,and Applications[M]. London: Prentice Hall, 1993.
[10]	KODIALAM M S , LAKSHMAN T V . Minimum interference routing with applications to MPLS traffic engineering[J]. Proc of IEEE IN-FOCOM, 2000,36(2): 884-893.
[11]	唐治果，李乐民，虞红芳．针对MPLS网络流量工程的链路关键性路由算法[J]．电子与信息学报， 2007,29(5):1187-1190. TANG Z G , LI L M , YU H F . Link criticality routing algorithm for MPLS traffic engineering[J]. Journal of Electronics ＆Information Technology, 2007,29(5):1187-1190.

[1]	沙宗轩, 霍如, 孙闯, 汪硕, 黄韬. 基于深度强化学习的转发效能感知流量调度算法[J]. 通信学报, 2022, 43(8): 30-40.
[2]	杨明川, 薛冠昌, 李清毅. 基于邻居卫星负载状态的低轨卫星分布式路由算法[J]. 通信学报, 2021, 42(8): 43-51.
[3]	孙爱晶, 李世昌, 张艺才. 基于PSO优化模糊C均值的WSN分簇路由算法[J]. 通信学报, 2021, 42(3): 91-99.
[4]	赖英旭,蒲叶玮,刘静. 基于最小代价路径的交换机迁移方法研究[J]. 通信学报, 2020, 41(2): 131-142.
[5]	陈伯文,符小东,雷雨. 频谱灵活光网络的故障概率与光纤链路负载均衡联合优化方法[J]. 通信学报, 2019, 40(9): 136-144.
[6]	李凤华,李丁焱,金伟,王竹,郭云川,耿魁. 面向海量电子凭据的分层可扩展存储架构[J]. 通信学报, 2019, 40(5): 79-87.
[7]	陈果,张潍丰. ELAB：基于端系统的新型拥塞感知负载均衡机制[J]. 通信学报, 2019, 40(3): 196-205.
[8]	李莉,史国振,耿魁,董秀则,李凤华. 基于负载均衡的随机作业流密码服务调度算法[J]. 通信学报, 2018, 39(6): 11-19.
[9]	朱晓荣,张倩. 面向多业务需求的NFV和SDN融合的资源优化算法[J]. 通信学报, 2018, 39(11): 54-62.
[10]	胡涛,张建辉,孔维功,杨森,曹路佳. SDN中基于双向匹配的多控制器动态部署算法[J]. 通信学报, 2018, 39(1): 159-169.
[11]	王雅慧,况鸿凤,朱立东. 中轨卫星星座系统容量分析[J]. 通信学报, 2017, 38(Z1): 193-199.
[12]	胡涛,张建辉,孔维功,杨森,曹路佳. SDN中基于过程忧化的交换机竞争迁移算法[J]. 通信学报, 2017, 38(8): 213-222.
[13]	胡涛,张建辉,马腾,赵伟. SDN中基于可靠性评估的多控制器均衡部署策略[J]. 通信学报, 2017, 38(11): 188-198.
[14]	曹傧,夏士超,何芳,李云. 无线网络虚拟化中的映射算法研究[J]. 通信学报, 2017, 38(1): 35-43.
[15]	史霄波,张引,赵杉,肖登明. 基于离散多目标优化粒子群算法的多移动代理协作规划[J]. 通信学报, 2016, 37(6): 29-37.

基于负载均衡的逻辑承载网构建研究

Research on load-balanced construction algorithm of logical carrying network

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 2

参考文献 11

相关文章 15

Metrics

推荐阅读 0