D2ENDIST: Dynamic and disjoint ENDIST-based layer-2 routing algorithm for cloud datacenters

研究成果: Conference contribution

7 引文 斯高帕斯(Scopus)

摘要

This paper presents an improved layer-2 routing algorithm, called dynamic and disjoint edge node divided spanning tree (D2ENDIST), to overcome the issues of the single path route and unbalanced link utilization in cloud datacenters. D2ENDIST consists of two key schemes: (1) disjoint ENDIST routing and (2) reroute by dynamic reweights. The former scheme can provide multi-path routes, thereby reducing traffic congestion. The latter scheme can balance the traffic load and improve the link utilization. Our experimental results show that the proposed scheme can enhance system throughput by 25% subject to the constraint of very short failure recovery time compared to the existing ENDIST scheme.

原文English
主出版物標題2012 IEEE Global Communications Conference, GLOBECOM 2012
頁面1611-1616
頁數6
DOIs
出版狀態Published - 1 十二月 2012
事件2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA, United States
持續時間: 3 十二月 20127 十二月 2012

出版系列

名字GLOBECOM - IEEE Global Telecommunications Conference

Conference

Conference2012 IEEE Global Communications Conference, GLOBECOM 2012
國家United States
城市Anaheim, CA
期間3/12/127/12/12

指紋 深入研究「D<sup>2</sup>ENDIST: Dynamic and disjoint ENDIST-based layer-2 routing algorithm for cloud datacenters」主題。共同形成了獨特的指紋。

  • 引用此

    Liu, G. H., Wen, C. H. P., & Wang, L. C. (2012). D2ENDIST: Dynamic and disjoint ENDIST-based layer-2 routing algorithm for cloud datacenters. 於 2012 IEEE Global Communications Conference, GLOBECOM 2012 (頁 1611-1616). [6503344] (GLOBECOM - IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.2012.6503344