Dynamic and Disjoint Layer-2 Routing in Cloud Datacenters
碩士 === 國立交通大學 === 電信工程研究所 === 100 === This thesis presents an improved layer-2 routing algorithm, called dynamic and dis-joint 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 ke...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02269988606568758800 |
| Summary: | 碩士 === 國立交通大學 === 電信工程研究所 === 100 === This thesis presents an improved layer-2 routing algorithm, called dynamic and dis-joint 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 re-sults 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.
|
|---|