CaRA : Congestion-aware Routing Algorithm for Data Center Network
The data center networks (DCN) leverage redundant physical links to overcome the bottleneck of traditional tree topology and achieve high bisection bandwidth and goodput for cloud computing platform, so how to use these redundancy links efficiently becomes the key factor for routing designer. This paper analyzes the large flow collision in modular data center network and propose simple experiments to validate the performance decreasing in the aggregated throughput. And then, a recursive congestion-aware routing algorithm (called CaRA) is proposed for decreasing flow collision. We simulate the CaRA with NS-2 simulator, and the results show that CaRA can improve one-to-one packet forward throughput and all-to-all throughput most time. The peak throughput values in these two situations are 50% and 20% respectively.
data center networks recursive routing flow collision
Xingyan Zhang Runze Wan Jinrong He
Huazhong University of Science & Technology, Wuhan, China;College of arts & sciences of jianghan uni Hubei University of Education, Wuhan, China College of information engineering, Northwest A&F University, Shanxi, China
国际会议
重庆
英文
492-495
2015-12-18（万方平台首次上网日期，不代表论文的发表时间）