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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2012 IEEE Global Communications Conference, GLOBECOM 2012
Pages1611-1616
Number of pages6
DOIs
StatePublished - 1 Dec 2012
Event2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA, United States
Duration: 3 Dec 20127 Dec 2012

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Conference

Conference2012 IEEE Global Communications Conference, GLOBECOM 2012
CountryUnited States
CityAnaheim, CA
Period3/12/127/12/12

Fingerprint Dive into the research topics of 'D<sup>2</sup>ENDIST: Dynamic and disjoint ENDIST-based layer-2 routing algorithm for cloud datacenters'. Together they form a unique fingerprint.

  • Cite this

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