首页> 外文期刊>Computer Communications >Multicast routing algorithms for sparse splitting optical networks
【24h】

Multicast routing algorithms for sparse splitting optical networks

机译:稀疏分裂光网络的组播路由算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

This work proposes novel routing approaches for transparent optical networks where only a fraction of the network nodes are multicast capable (MC) and can split the optical power from a single input to multiple output ports. The remaining, multicast-incapable (MI) nodes, can have either Drop-or-Continue (DoC) or Drop and-Continue (DaC) capabilities. For the case of DaCs, if a MI node is a destination of the multicast group, it can drop a fraction of the incoming signal locally and transmit the rest to the next node. The current paper presents an Integer Linear Programming (ILP) formulation as well as novel heuristic multicast routing algorithms under the sparse-splitting constraint, for networks with or without DaC nodes. Performance results show that the proposed algorithms achieve an important decrease of the average cost of the derived solutions, compared to existing relevant techniques, and attain results very close to the lower bound provided by the ILP. (C) 2015 Elsevier B.V. All rights reserved.
机译:这项工作为透明光网络提出了新颖的路由方法,其中只有一小部分网络节点具有多播功能(MC),并且可以将光功率从单个输入端口分配到多个输出端口。其余的无法进行多播(MI)的节点可以具有丢弃或继续(DoC)或丢弃并继续(DaC)功能。对于DaC,如果MI节点是多播组的目标,则它可以在本地丢弃一部分输入信号,并将其余部分传输到下一个节点。本文针对具有或不具有DaC节点的网络,提出了在稀疏分解约束下的整数线性规划(ILP)公式以及新颖的启发式组播路由算法。性能结果表明,与现有的相关技术相比,所提出的算法大大降低了派生解决方案的平均成本,并且获得的结果非常接近ILP提供的下限。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号