DocumentCode :
1975074
Title :
D2ENDIST: Dynamic and disjoint ENDIST-based layer-2 routing algorithm for cloud datacenters
Author :
Gen-Hen Liu ; Wen, Charles H.-P ; Li-Chun Wang
Author_Institution :
Dept. of Electr. & Comput. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear :
2012
fDate :
3-7 Dec. 2012
Firstpage :
1611
Lastpage :
1616
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.
Keywords :
cloud computing; computer centres; computer network reliability; resource allocation; telecommunication congestion control; telecommunication network routing; telecommunication traffic; trees (mathematics); D2ENDIST; cloud datacenters; dynamic and disjoint ENDIST-based layer-2 routing algorithm; dynamic and disjoint edge node divided spanning tree; dynamic reweights; failure recovery time; improved layer-2 routing algorithm; link utilization improvement; multipath routes; single path route issues; traffic congestion reduction; traffic load balancing; unbalanced link utilization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Communications Conference (GLOBECOM), 2012 IEEE
Conference_Location :
Anaheim, CA
ISSN :
1930-529X
Print_ISBN :
978-1-4673-0920-2
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2012.6503344
Filename :
6503344
Link To Document :
بازگشت