编码链路最少的多源光组播路由

doi:10.13190/j.jbupt.2016-249

北京邮电大学学报 ›› 2017, Vol. 40 ›› Issue (5): 87-91.doi: 10.13190/j.jbupt.2016-249

编码链路最少的多源光组播路由

蔚承英, 吴兰, 刘焕淋, 陈勇

重庆邮电大学通信与信息工程学院, 重庆 400065

收稿日期:2016-09-30 出版日期:2017-10-28 发布日期:2017-11-21
作者简介:蔚承英(1973-),女,讲师,E-mail:weicy@cqupt.edu.cn.
基金资助:
国家自然科学基金项目（61275077）；重庆市科委前沿与应用基础研究项目（2015jcyjA40024）

Multi-Source Optical Multicast Routing with Least Number of Optical Network Coding Links

WEI Cheng-ying, WU Lan, LIU Huan-lin, CHEN Yong

School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China

Received:2016-09-30 Online:2017-10-28 Published:2017-11-21

摘要/Abstract

摘要： 网络编码提高波分复用网络多源光组播带宽利用率时，导致光域中存储和运算开销增加，为此，设计了一种改进的自适应遗传算法可最少化光组播的网络编码光纤链路数目.该算法设计了自适应调整的交叉概率和差异最大化交叉操作，保证种群多样性，避免陷入局部最优；通过自适应调整交叉概率，保证种群在开始阶段可以很快实现多样性，使种群中的较优个体保持稳定.仿真结果表明，所提算法与对比算法相比收敛速度更快，可以用更短时间找到编码链路数目最少的方案.

关键词: 多源光组播, 编码链路, 改进自适应遗传算法, 最大化差异性交叉, 自适应交叉概率

Abstract: Network coding can improve the bandwidth utilization for multi-source optical multicast, but it increases optical storage and computation overhead in wavelengeh division multi-plexing networks. An improved adaptive genetic algorithm (IAGA) is proposed to minimize the number of optical network coding links for multicast. By designing the maximization difference crossover operation, IAGA can guarantee the diversity of population and avoid from falling into a local optimal. By adaptive adjusting the crossover probability, IAGA makes the population diverse at the beginning stages and makes the excellent individuals remain in a stable condition. Compared with other algorithms, the simulation results show that the proposed algorithm has fastest convergence speed, which means that it takes the shortest time to find the minimum numbers of optical coding link solutions.

Key words: multi-source optical networks, coding link, improved adaptive genetic algorithm, maximizing differences crossover, adaptive crossover probability

中图分类号:

TN929

蔚承英, 吴兰, 刘焕淋, 陈勇. 编码链路最少的多源光组播路由[J]. 北京邮电大学学报, 2017, 40(5): 87-91.

WEI Cheng-ying, WU Lan, LIU Huan-lin, CHEN Yong. Multi-Source Optical Multicast Routing with Least Number of Optical Network Coding Links[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2017, 40(5): 87-91.

参考文献

[1] 黄胜, 王琰, 刘焕淋, 等. 基于网络编码的多源多核点光组播路由算法[J]. 重庆邮电大学学报(自然科学版), 2014, 26(2):143-149. Huang Sheng, Wang Yan, Liu Huanlin, et al. Multi-source routing algorithm based on network coding in optical multicast network[J]. Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition), 2014, 26(2):143-149.
[2] Zhou Hui, Mao Shiwen, AGRAWAL P. Optical power allocation for adaptive transmissions in wavelength-division multiplexing free space optical networks[J]. Digital Communications and Networks, 2015, 1(3):171-180.
[3] 陈勇, 籍慧琴, 刘焕淋, 等. 透明IP Over WDM网络中一种能效链路控制策略[J]. 北京邮电大学学报, 2015, 38(6):41-46. Chen Yong, Ji Huiqin, Liu Huanlin, et al. An energy-efficiency link control strategy for transparent IP over WDM networks[J]. Journal of Beijing University of Posts and Telecommunications, 2015, 38(6):41-46.
[4] Qu Zhijian, Zhang Xianwei, Shi Shaojian, et al. Network coding based all-optical multicast in WDM networks[J]. Journal of China Universities of Posts and Telecommunications, 2015, 22(1):89-94.
[5] Halloush R, Liu Hang, Dong Lijun, et al. Hop-by-hop content distribution with network coding in multihop wireless networks[J]. Digital Communications and Networks, 2017, 3(1):47-54.
[6] Xing Huanlai, Qu Rong, Bao Lin, et al. On minimizing coding operations in network coding based multicast:an evolutionary algorithm[J]. Applied Intelligence, 2014, 41(3):820-836.
[7] 郝琨, 金志刚. 一种最小化编码节点的网络编码优化算法[J]. 电子与信息学报, 2011, 33(2):260-265. Hao Kun, Jin Zhigang. An optimization algorithm of network coding for minimizing coding nodes[J]. Journal of Electronics & Information Technology, 2011, 33(2):260-265.
[8] 邵星, 王汝传, 黄海平, 等. 基于模拟退火遗传算法的网络编码优化研究[J]. 南京邮电大学学报(自然科学版), 2013, 33(2):80-85. Shao Xing, Wang Ruchuan, Huang Haiping, et al. Research of network coding optimization based on simulated annealing genetic algorithm[J]. Journal of Nanjing University of Posts and Telecommunications(Natural Science Edition), 2013, 23(2):80-85.
[9] Xing Huanlai, Qu Rong. A compact genetic algorithm for the network coding based resource minimization problem[J]. Applied Intelligence, 2012, 36(4):809-823.
[10] 刘焕淋, 秦亮, 向劲松, 等. 图压缩优化光组播最小网络编码路由[J]. 光电子·激光, 2013, 24(8):1472-1476. Liu Huanlin, Qin Liang, Xiang Jinsong, et al. An optimization algorithm of network coding for minimizing coding nodes[J]. Journal of Electronics & Information Technology, 2013, 24(8):1472-1476.

[1]	常琪卿王森金婧李逸潇龙航. OTFS系统信道参数迭代估计算法[J]. 北京邮电大学学报, 2023, 46(4): 52-57.
[2]	彭艺吴桐杨青青. 下行 RIS-NOMA 系统交替优化波束形成方法[J]. 北京邮电大学学报, 2023, 46(4): 64-69.
[3]	王璞刘超包建荣姜斌. 信息感知的分层加权干扰消除编码缓存[J]. 北京邮电大学学报, 2023, 46(4): 46-51.
[4]	杨青青, 陈剑, 彭艺. 基于DDPG的无人机轨迹规划及功率控制算法[J]. 北京邮电大学学报, 2023, 46(3): 43-48.
[5]	陈发堂, 韩才君, 张航, 李欣超. 一种时空混合的位置管理方案[J]. 北京邮电大学学报, 2023, 46(3): 67-72.
[6]	林德平, 王亚祺, 钱荣荣, 彭涛, 王文博. 领导-跟随协同飞行无人网络的通信容量分析[J]. 北京邮电大学学报, 2023, 46(3): 97-102.
[7]	杨丽花, 聂倩, 呼博, 江婷. 联合BP神经网络与基扩展模型的信道预测算法 [J]. 北京邮电大学学报, 2023, 46(3): 13-18.
[8]	贾科军王佳宁蔺莹曹明华王惠琴. 基于粗糙集理论改进的KNN级联均衡器设计与抑制LED非线性研究[J]. 北京邮电大学学报, 0, (): 0-0.
[9]	彭维平杨玉莹宋成阎俊豪. VEC中多边缘节点协作卸载与资源分配算法[J]. 北京邮电大学学报, 2023, 46(2): 78-83.
[10]	公雨魏翼飞. 一种集成学习辅助DDPG的资源优化算法[J]. 北京邮电大学学报, 2023, 46(2): 29-36.
[11]	彭维平王戈宋成阎俊豪. 面向高移动性车联网场景的预测卸载决策算法[J]. 北京邮电大学学报, 2023, 46(2): 43-49.
[12]	魏明亮耿绥燕赵雄文胡玮范静怡. 超密集网络中移动边缘计算的资源分配和任务卸载联合优化研究[J]. 北京邮电大学学报, 2023, 46(2): 50-56.
[13]	尹志宁刘文军. 面向多买家系统的频谱共享策略[J]. 北京邮电大学学报, 2023, 46(1): 1-5.
[14]	万鹏武魏健姚媛媛彭康李文杰. 非视距环境下基于时域测量的刚体位姿估计[J]. 北京邮电大学学报, 2023, 46(1): 115-120.
[15]	章晨宇温向明陈亚文. 蜂窝移动网络低成本高精度授时[J]. 北京邮电大学学报, 2023, 46(1): 103-108.

编码链路最少的多源光组播路由

Multi-Source Optical Multicast Routing with Least Number of Optical Network Coding Links

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价