当前位置:主页 > 科技论文 > 信息工程论文 >

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

发布时间:2018-06-21 23:31

  本文选题:多源光组播 + 编码链路 ; 参考:《北京邮电大学学报》2017年05期


【摘要】:网络编码提高波分复用网络多源光组播带宽利用率时,导致光域中存储和运算开销增加,为此,设计了一种改进的自适应遗传算法可最少化光组播的网络编码光纤链路数目.该算法设计了自适应调整的交叉概率和差异最大化交叉操作,保证种群多样性,避免陷入局部最优;通过自适应调整交叉概率,保证种群在开始阶段可以很快实现多样性,使种群中的较优个体保持稳定.仿真结果表明,所提算法与对比算法相比收敛速度更快,可以用更短时间找到编码链路数目最少的方案.
[Abstract]:When network coding improves bandwidth utilization of multi-source optical multicast in wavelength division multiplexing (WDM) network, the storage and computing overhead in optical domain increases. Therefore, an improved adaptive genetic algorithm is designed to minimize the number of optical network coded optical links of optical multicast. The algorithm designs the crossover probability of adaptive adjustment and maximizes the crossover operation of difference to ensure the diversity of population and avoid falling into local optimum. By adjusting the crossover probability adaptively, the diversity of population can be realized quickly in the initial stage. Keep the better individuals in the population stable. Simulation results show that the proposed algorithm converges faster than the contrast algorithm and can find the scheme with the least number of coding links in a shorter time.
【作者单位】: 重庆邮电大学通信与信息工程学院;
【基金】:国家自然科学基金项目(61275077) 重庆市科委前沿与应用基础研究项目(2015jcyj A40024)
【分类号】:TN929.1


本文编号:2050509

资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2050509.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户59123***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com