CaRA : Congestion-aware Routing Algorithm for Data Center Network
- 10.2991/jimet-15.2015.92How to use a DOI?
- data center networks, recursive routing, flow collision
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.
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Xingyan Zhang AU - Runze Wan AU - Jinrong He PY - 2015/12 DA - 2015/12 TI - CaRA : Congestion-aware Routing Algorithm for Data Center Network BT - Proceedings of the 2015 Joint International Mechanical, Electronic and Information Technology Conference PB - Atlantis Press SP - 492 EP - 495 SN - 2352-538X UR - https://doi.org/10.2991/jimet-15.2015.92 DO - 10.2991/jimet-15.2015.92 ID - Zhang2015/12 ER -