A Methodology for Easing the Congestion in Fat-trees Using Traffic Pattern Detection

Routing in fat-trees is composed of a routing function and a selection function. The selection function was shown to have a great impact on the performance. Different selection functions have different performance under certain traffic patterns. The Stage And Destination Priority (SADP) selection function was shown to have better performance in case of uniform traffic [2] while the Stage And Origin Priority (SAOP) selection function was shown to perform better in case of hot-spot traffic [9]. In this paper, we propose a management mechanism for fat-trees for selecting a certain selection function for certain traffic pattern. The mechanism has the ability to detect the current traffic pattern and switch to a certain selection function that is proved to give better performance under the detected traffic pattern. This would decrease congestion in the network. First, we analyze the hot-spot traffic in fat-trees if SADP function is used. We derive a condition for the existence of hot-spot traffic if SADP selection function is used. We give an implementation for detecting this condition. Once this condition is detected, the network is forced to switch to use the SAOP selection function. Then, we use the work in [9] to detect that a non hot-spot traffic exists in fat trees. We give an implementation for detecting this condition. In turn, we switch back to the SADP selection function. Finally, we use synthetic workloads to show the accuracy of the proposed mechanism for detecting the hot-spot traffic in the network.

[1]  Hatem M. El-Boghdadi,et al.  On the influence of selection function on the performance of fat-trees under hot-spot traffic , 2011, 2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA).

[2]  Zhen Yang,et al.  Hotspot Avoidance for P2P Streaming Distribution Application: A Game Theoretic Approach , 2009, IEEE Transactions on Parallel and Distributed Systems.

[3]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[4]  José Duato,et al.  A new scalable and cost-effective congestion management strategy for lossless multistage interconnection networks , 2005, 11th International Symposium on High-Performance Computer Architecture.

[5]  Pedro López,et al.  Deterministic versus Adaptive Routing in Fat-Trees , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[6]  José Duato,et al.  An Efficient Strategy for Reducing Head-of-Line Blocking in Fat-Trees , 2010, Euro-Par.

[7]  Youngsong Mun,et al.  Design and performance analysis of the Practical Fat Tree Network using a butterfly network , 1997, J. Syst. Archit..

[8]  Pedro López,et al.  On the Influence of the Selection Function on the Performance of Fat-Trees , 2006, Euro-Par.

[9]  Antonio Robles,et al.  A Scalable and Early Congestion Management Mechanism for MINs , 2010, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing.

[10]  André DeHon Fat-Tree Routing for Transit , 1990 .