首页> 外文会议>2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications >An OpenFlow-Based Dynamic Path Adjustment Algorithm for Multicast Spanning Trees
【24h】

An OpenFlow-Based Dynamic Path Adjustment Algorithm for Multicast Spanning Trees

机译:基于OpenFlow的组播生成树动态路径调整算法

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

摘要

Multicast transmission can effectively reduce the cost of network resources in delivering packets to a group of receivers. However, it is difficult to adjust the path of the generated multicast spanning tree (MST) if the multicast source and group members are unchanged. OpenFlow has been a key technology to realize the software defined networking and makes the flow control feasible. This paper presents an OpenFlow-based solution to dynamically adjust the path of MST by configuring the paths according to the requirements of the network loads and specific conditions. In addition, we propose a distributed MST strategy to satisfy the requirements of inter-domain multicast transmissions. Experimental results show that the proposed solution can effectively adjust the paths of MST and facilitate the generation of MST by parallel computation in the construction of distributed MST.
机译:组播传输可以有效地减少将数据包传递到一组接收器时的网络资源成本。但是,如果组播源和组成员不变,则很难调整生成的组播生成树(MST)的路径。 OpenFlow是实现软件定义的网络并使流量控制可行的关键技术。本文提出了一种基于OpenFlow的解决方案,通过根据网络负载的要求和特定条件配置路径来动态调整MST的路径。此外,我们提出了一种分布式MST策略,以满足域间多播传输的要求。实验结果表明,所提出的解决方案可以有效地调整MST的路径,并在分布式MST的构造中通过并行计算促进MST的生成。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号