| 刘焕淋,周邦陶,张盛峰,向劲松,陈英.基于共享路径和网络编码的光组播容量优化[J].光电子激光,2014,(10):1906~1911 |
| 基于共享路径和网络编码的光组播容量优化 |
| Optimization of optical multicast capacity based on shared link and network coding |
| 投稿时间：2014-06-03 |
| DOI： |
| 中文关键词: WDM网络 网络编码 组播容量 链路共享度 编码代价 |
| 英文关键词:wavelength division multiplexing (WDM) network network coding multicast capacity link shared degree network coding cost |
| 基金项目:国家自然科学基金(61275077,6)、国家“973”重点基础研究发展规划(2012CB315803)、重庆市基础与前沿研究计划项目(cstc2013jcyjA40052)和重庆市教委(KJ1400421)资助项目 (重庆邮电大学 通信与信息工程学院,重庆市光纤通信技术重点实验室,重庆 400065) |
| 作者 | 单位 | | 刘焕淋 | 重庆邮电大学 通信与信息工程学院,重庆市光纤通信技术重点实验室,重庆 400065 | | 周邦陶 | 重庆邮电大学 通信与信息工程学院,重庆市光纤通信技术重点实验室,重庆 400065 | | 张盛峰 | 重庆邮电大学 通信与信息工程学院,重庆市光纤通信技术重点实验室,重庆 400065 | | 向劲松 | 重庆邮电大学 通信与信息工程学院,重庆市光纤通信技术重点实验室,重庆 400065 | | 陈英 | 重庆邮电大学 通信与信息工程学院,重庆市光纤通信技术重点实验室,重庆 400065 |
|
| 摘要点击次数: 1471 |
| 全文下载次数: 92 |
| 中文摘要: |
| 为了降低光组播路由 的光域网络编码代价和提高达到理论最大光组播容量的 概率,提出一种基于共享链路和网络编 码的优化光组播容量方法。首先设计一种从多条源－ 宿最短路径中选择能达到最大光组播容量的最短路径簇,然后在 最短路径簇中计算路径的共享度,选择共享度高的组播路径传输网络编码信息,构造网络编 码次数最少的光组播编码子图, 解决传统的网络编码组 播路由和最大共享度链路组播路由中存在的网络编码次数过多和达到最大光组播容量概率过 低的问 题。仿真结果表明:本文提出的方法具有最低的网络编码代价,能以最大的概率达到光组播 理论最大容量。 |
| 英文摘要: |
| For reducing the network coding cost in optical field and improving the probability of realizing optical multicast theoretical maximum capacity in optical multicast routing, a multicast method based on shared links and network coding is proposed to optimize the optical multicast capacity in this paper.In the proposed method,a strategy is designed firstly to choose t he multiple shortest path s from source node to each destination node,respectively . These shortest paths make up the shorte st path cluster for the multicast . Then, the link shared degree of each path is calculated in the shortest path cluster. T he paths with high link shared degree are selected to transmit the encoded multicast information .The multicast sub - graph is construc ted by the link needing few est number of network coding operations to optimize network coding cost .The proposed method can solve two routing problems:one is too many times of network coding operations in the traditional network coding multicast routing,an d the other is too low probability of reach multicast maximal capacity for the multicast routing based on maximal shared degree links.Compared with the above two multicast routing methods,the simulation results show that the proposed multicast routing metho d can get the lowest network coding cost, the maximum probability of achieving optical multicast theoretical maximum capacity and appropriate multicast average routing cost. |
| 查看全文 下载PDF阅读器 |
| 关闭 |
|
|
|
|
|