首页> 外文期刊>Mathematical Problems in Engineering >Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks
【24h】

Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks

机译:弹性和负载平衡以太网络中多生成树供应的建模和算法

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

摘要

We propose a multitree based fast failover scheme for Ethernet networks. In our system, only few spanning trees are used to carry working traffic in the normal state. As a failure happens, the nodes adjacent to the failure redirect traffic to the preplanned backup VLAN trees to realize fast failure recovery. In the proposed scheme, a new leaf constraint is enforced on the backup trees. It enables the network being able to provide 100% survivability against any single link and any single node failure. Besides fast failover, we also take load balancing into consideration. We model an Ethernet network as a twolayered graph and propose an Integer Linear Programming (ILP) formulation for the problem. We further propose a heuristic algorithm to provide solutions to large networks. The simulation results show that the proposed scheme can achieve high survivability while maintaining load balancing at the same time. In addition, we have implemented the proposed scheme in an FPGA system. The experimental results show that it takes only few.. sec to recover a network failure. This is far beyond the 50msec requirement used in telecommunication networks for network protection.
机译:我们为以太网提出了一种基于多树的快速故障转移方案。在我们的系统中,只有很少的生成树在正常状态下用于承载工作流量。当发生故障时,与故障相邻的节点将流量重定向到预先计划的备份VLAN树,以实现快速故障恢复。在提出的方案中,在备份树上强制采用新的叶子约束。它使网络能够针对任何单个链接和任何单个节点故障提供100%的生存能力。除了快速故障转移外,我们还考虑了负载平衡。我们将以太网建模为两层图,并针对该问题提出了整数线性规划(ILP)公式。我们进一步提出一种启发式算法来为大型网络提供解决方案。仿真结果表明,该方案在保持负载均衡的同时,具有较高的生存能力。另外,我们已经在FPGA系统中实现了所提出的方案。实验结果表明,恢复网络故障只需要几秒钟的时间。这远远超出了电信网络中用于网络保护的50毫秒要求。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号