【24h】

Computing Delay and Survivability Constrained Paths in WDM Optical Networks

机译:在WDM光网络中计算延迟和可生存性约束路径

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

摘要

The advances in technologies has enabled the design of Wavelength Division Multiplexing (WDM) all-optical transport networks providing tera-bits/s bit rates. Critical to the high data rate that the optical network provides are the network survivabilities. A significant portion of communication applications require Quality of Services (QoSs) demanding connections with low communication delays and high network survivabilities. In this paper, we consider the problem of fiding and providing a sequence of lightpaths (i.e., routes in optical layers) to the client layer control plane in such a way that the propagation delay from source to destination is no more than the given delay bound and the survivabil-ity of the provided path is guaranteed to be at lesat the given probability bound. The complexity result is presented and an efficient suboptimal algorithm is developed for source routing applications.
机译:技术的进步使得能够设计提供兆比特/秒比特率的波分复用(WDM)全光传输网络。对于光网络提供的高数据速率,至关重要的是网络的生存能力。通信应用程序中很大一部分需要服务质量(QoS)要求的连接,这些连接具有较低的通信延迟和较高的网络生存能力。在本文中,我们考虑以下问题:以从源到目的地的传播延迟不超过给定的延迟范围的方式,找到并提供一系列光路(即光学层中的路由)到客户端层控制平面并确保所提供路径的生存能力处于给定概率范围内。给出了复杂度结果,并为源路由应用开发了一种有效的次优算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号