【24h】

A Multi-Objective Multipath Routing Algorithm for Multicast Flows

机译:组播流的多目标多路径路由算法

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

摘要

In this paper, we propose a multi-objective traffic engineering scheme using different distribution trees to multicast several flows. The aim is to combine into a single aggregated metric, the following weighting objectives: the maximum link utilization, the hop count, the total bandwidth consumption, and the total end-to-end delay. Moreover, our proposal solves the traffic split ratio for multiple trees. We formulate this multi-objective function as one with Non Linear programming with discontinuous derivatives (DNLP). Results obtained using the SNOPT solver show that several weighting objectives are decreased and the maximum link utilization is minimized. The problem is NP-hard, therefore, a novel SPT algorithm is proposed for optimizing the different objectives. The behavior we get using this algorithm is similar to what we get with SNOPT solver. The proposed approach can be applied in MPLS networks by allowing the establishment of explicit routes in multicast events. The main contributions of this paper are the optimization model and the formulation of the multi-objective function; and that the algorithm proposed shows polynomial complexity.
机译:在本文中,我们提出了一种多目标流量工程方案,该方案使用不同的分发树来多播多个流。目的是将以下加权目标组合为一个聚合度量:最大链路利用率,跳数,总带宽消耗以及总的端到端延迟。此外,我们的建议解决了多棵树的流量分配比率。我们将这种多目标函数公式化为带有不连续导数的非线性规划(DNLP)的函数。使用SNOPT求解器获得的结果表明,减少了几个加权目标,并且最大程度地降低了链路利用率。该问题是NP难的,因此,提出了一种用于优化不同目标的新颖的SPT算法。我们使用此算法获得的行为类似于使用SNOPT求解器获得的行为。通过允许在多播事件中建立显式路由,可以将所提出的方法应用于MPLS网络。本文的主要贡献是优化模型和多目标函数的表述。所提出的算法具有多项式复杂度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号