首页> 外文会议>IEEE Conference on Local Computer Networks >PAST-HOAS: Fast Setup of Per-Address Sink Routing Trees by Reverse Flooding
【24h】

PAST-HOAS: Fast Setup of Per-Address Sink Routing Trees by Reverse Flooding

机译:过去的HOAS:通过反向洪水快速设置每个地址槽路由树

获取原文

摘要

Scaling Ethernet switched networks to sizes of hundreds of thousands of hosts is a key requirement for data center networks. PAST is a simple and scalable OpenFlow-based layer-two architecture for data center Ethernet networks that outperforms Equal Cost Multipath Forwarding. PAST computes and configures one spanning tree for every MAC destination address. However, an important bottleneck of PAST is the time taken to perform the massive installation of rules at OpenFlow switches to set up the trees. PAST-HOAS aims to solve that obstacle, building trees instantly by path discovery, either triggered by the controller with a multicast probe frame from the edge destination switch or by the standard ARP Request frame; without flow installation and without tree computation. PASTHOAS is loop-free, and provides 100-400 times faster network initialization, lower forwarding delays and increased robustness and scalability.
机译:将以太网交换网络缩放到数十万个主机的大小是数据中心网络的关键要求。过去是一种简单且可扩展的OpenFlow的第2层,用于数据中心以太网网络,其优于同等的成本多径转发。过去计算并为每个MAC目的地地址配置一个生成树。然而,过去的一个重要瓶颈是在OpenFlow交换机上执行大规模安装规则的时间,以设置树木。过去的HOAS旨在解决这种障碍,通过路径发现立即建造树木,由控制器触发来自边缘目的地开关的组播探针帧或标准ARP请求帧;没有流动安装,没有树计算。 Pasthoas是无循环的,提供100-400倍的网络初始化,降低转发延迟以及增加的鲁棒性和可扩展性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号