(DENDIST)-E-2: Dynamic and Disjoint ENDIST-based Layer-2 Routing Algorithm for Cloud Datacenters
| dc.citation.epage | 1616 | en_US |
| dc.citation.spage | 1611 | en_US |
| dc.contributor.author | Liu, Gen-Hen | en_US |
| dc.contributor.author | Wen, Charles H. -P | en_US |
| dc.contributor.author | Wang, Li-Chun | en_US |
| dc.contributor.department | 電機資訊學士班 | zh_TW |
| dc.contributor.department | Undergraduate Honors Program of Electrical Engineering and Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:32:44Z | |
| dc.date.available | 2014-12-08T15:32:44Z | |
| dc.date.issued | 2012 | en_US |
| dc.description.abstract | This paper presents an improved layer-2 routing algorithm, called dynamic and disjoint edge node divided spanning tree ((DENDIST)-E-2), to overcome the issues of the single path route and unbalanced link utilization in cloud datacenters. (DENDIST)-E-2 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. | en_US |
| dc.identifier.isbn | 978-1-4673-0921-9 | en_US |
| dc.identifier.issn | 1930-529X | en_US |
| dc.identifier.journal | 2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/22873 | |
| dc.identifier.wosnumber | WOS:000322375101157 | |
| dc.language.iso | en_US | en_US |
| dc.title | (DENDIST)-E-2: Dynamic and Disjoint ENDIST-based Layer-2 Routing Algorithm for Cloud Datacenters | en_US |
| dc.type | Proceedings Paper | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: