HyperFatTree: A Large-Scale Tree-Based Network with Low-Radix Switches
详细信息    查看全文
文摘
To lower the large-scale network cost and energy consumption, we proposed a hierarchical topology with low-radix switches. The hierarchical topology HyperFatTree is designed by combining Fat Tree topology and complete graph topology. Theory analysis of topology characteristic shows that the proposed topology can achieve high cost performance and high scalability. According to the characteristic of HyperFatTree, we designed a minimum path routing algorithm and a load balanced non-minimum path random routing algorithm for the WorstCase traffic. Evaluation shows that the saturated throughput of HyperFatTree is nearly 68.5 % at the scale of 83,232 nodes under Uniform Random traffic, which is higher than both Fat Tree and Dragonfly. It is also important that the throughput reduces only 5 % while the scale has increased 80 times, which shows good smooth scalability. Evaluation on energy efficiency shows that HyperFatTree performs better than Fat Tree and can achieve 3–7 times higher energy efficiency than Dragonfly.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700