...
【24h】

Routing and wavelength assignment algorithms for translucent optical networks

机译:半透明光网络的路由和波长分配算法

获取原文
获取原文并翻译 | 示例
           

摘要

Due to transmission impairments, optical regeneration is needed to extend the length of a lightpath beyond its transparent length. Spare transmitter (Tx) and receiver (Rx) modules in an optical network node can be used for optical regeneration. A Max-spare algorithm for locating the regeneration nodes for a lightpath is proposed and compared with a Greedy algorithm in conjunction with two routing algorithms, namely, wavelength weighted (WW) and length weighted (LW) routing algorithms. Through simulation we find that significant number of lightpaths that cannot be established due to the violation of transparent length can be established if the regeneration algorithm is used to select transit nodes that have spare Tx and Rx for 3R regeneration. The translucent optical network with limited number of transceivers can still perform close to a transparent optical network with full set of transceivers. We find that for the same routing algorithm, the Max-spare algorithm yields better results than the Greedy algorithm. In addition; for the same regeneration nodes selection algorithm, the WW algorithm has better performance than the LW algorithm.
机译:由于传输障碍,需要光学再生以将光路的长度扩展到其透明长度之外。光网络节点中的备用发射机(Tx)和接收机(Rx)模块可用于光再生。提出了一种用于定位光路再生节点的最大备用算法,并将其与Greedy算法结合两个路由算法进行比较,这两个路由算法分别是波长加权(WW)和长度加权(LW)路由算法。通过仿真,我们发现,如果使用再生算法来选择具有备用Tx和Rx的3R再生节点,则可以建立由于违反透明长度而无法建立的大量光路。收发器数量有限的半透明光网络仍然可以接近具有全套收发器的透明光网络。我们发现,对于相同的路由算法,最大备用算法比贪婪算法产生更好的结果。此外;对于相同的再生节点选择算法,WW算法的性能优于LW算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号