• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Optical fiber technology >Capacity-bounded lightpath routing in WDM optical networks
【24h】

Capacity-bounded lightpath routing in WDM optical networks

机译：WDM光网络中的容量限制光路路由

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

To meet the increasing user bandwidth demands, the ICT networks are constantly expanding. The optical fiber technology has completely revolutionized the bandwidth capacity of both the core networks and the access networks. In core networks, the optical links provide very high bandwidth connectivity over long distance. Thus, any link failure due to disastrous events like earthquake, flood, landslide etc. can lead to massive service outages and huge fiscal losses. Normally, optical fibers are laid in 1 + 1 configuration to route the traffic to the alternate path in such scenario. However, a natural disaster event may lead to simultaneous failure of multiple lightpaths. Therefore, routing algorithm, running on network nodes (routers or switches), are required in such case to establish new routes. Nevertheless, generally the routing schemes follow the least hop count and shortest distance approach to route the traffic to another backup path. Nonetheless, this approach may result in congestion on some links while other links may have unutilized capacity. This also makes it progressively tougher to fit more connection requests from the access network. Hence, implementation of more advanced path computation capabilities is required at the network nodes of the core network to ensure efficient routing of network traffic in disastrous scenario. This problem is referred to as capacity-bounded lightpath (CBL) problem. We proposed an exact algorithm which addresses this problem by considering the channel capacity of each link in addition to distances. The performance of the proposed algorithm is evaluated through simulation for three parameters: link capacity, connection requests and un-used links. It is revealed that existing shortest path algorithm improves the performance in terms of blocking probability of links and lightpaths at the cost of underutilization of the network capacity. Whereas, proposed algorithm regulates the capacity utilization by prioritizing link capacity over link length to establish more optimal shortest lightpath against connection requests.
机译：为了满足不断增长的用户带宽需求，ICT网络正在不断扩展。光纤技术彻底改变了核心网络和接入网络的带宽容量。在核心网络中，光链路可以在长距离上提供很高的带宽连接。因此，由于诸如地震，洪水，滑坡等灾难性事件而导致的任何链路故障都可能导致大量服务中断和巨大的财政损失。通常，在这种情况下，光纤以1 +1配置放置，以将流量路由到备用路径。但是，自然灾害事件可能导致多个光路同时发生故障。因此，在这种情况下，需要在网络节点（路由器或交换机）上运行的路由算法来建立新路由。然而，通常，路由选择方案遵循最小跳数和最短距离方法，以将流量路由到另一个备用路径。但是，此方法可能会导致某些链接出现拥塞，而其他链接可能具有未利用的容量。这也使得适应来自接入网的更多连接请求变得越来越困难。因此，在核心网络的网络节点处需要实现更高级的路径计算功能，以确保灾难性情况下网络流量的有效路由。此问题称为容量限制光路（CBL）问题。我们提出了一种精确的算法，该算法通过考虑距离以外的每个链路的信道容量来解决此问题。通过仿真对以下三个参数评估了所提出算法的性能：链接容量，连接请求和未使用的链接。结果表明，现有的最短路径算法以网络容量利用不足为代价，提高了链路和光路的阻塞概率，从而提高了性能。鉴于此，所提出的算法通过优先考虑链路容量而不是链路长度来调节容量利用率，以针对连接请求建立更优化的最短光路。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号