首页> 外文期刊>Journal of network and computer applications >Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities
【24h】

Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities

机译:具有异构功能的WDM网络中具有延迟约束的组播路由和波长分配

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

摘要

Because optical wavelength division multiplexing (WDM) networks are expected to be realized for building up backbone in the near future, multicasting in WDM networks needs to be addressed for various network applications. This paper studies an extended multicast routing and wavelength assignment (RWA) problem called multicast routing and wavelength assignment with delay constraint (MRWA-DC) that incorporates delay constraints in WDM networks having heterogeneous light splitting capabilities. The objective is to find a light-forest whose multicast cost, defined as a weighted combination of communication cost and wavelength consumption, is minimum. An integer linear programming (ILP) model is proposed to formulate and solve the problem. Experimental results show that using CPLEX to solve the ILP formulation can optimally deal with small-scale networks. Therefore, we develop a heuristic, near-k-shortest-path heuristic (NKSPH), to solve the problem in large-scale networks. Numerical results indicate that the proposed heuristic algorithm can produce approximate solutions of good quality in an acceptable time.
机译:由于期望在不久的将来实现光波分复用(WDM)网络以建立骨干网,因此需要针对各种网络应用解决WDM网络中的多播问题。本文研究了扩展的组播路由和波长分配(RWA)问题,称为具有延迟约束的组播路由和波长分配(MRWA-DC),该问题在具有异构分光功能的WDM网络中纳入了延迟约束。目的是找到一种轻型林,其组播成本(定义为通信成本和波长消耗的加权组合)最小。提出了整数线性规划(ILP)模型来解决该问题。实验结果表明,使用CPLEX解决ILP公式可以最佳地处理小型网络。因此,我们开发了一种启发式,近k最短路径启发式(NKSPH),以解决大规模网络中的问题。数值结果表明,所提出的启发式算法可以在可接受的时间内产生高质量的近似解。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号