| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊工程學系 | zh_TW |
| DC.creator | 黃詣然 | zh_TW |
| DC.creator | Yi-Ran Huang | en_US |
| dc.date.accessioned | 2016-8-3T07:39:07Z | |
| dc.date.available | 2016-8-3T07:39:07Z | |
| dc.date.issued | 2016 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=103522056 | |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 近年來，負載平衡被認為是評估資料中心一般效能以及計算資源利
用率的評估標準。現今的方法經常遭遇到路徑負載不平衡以及封包亂
序的問題。在本篇論文，我們提出一資料中心內部的負載平衡演算法，
在我們的方法中採用的是基於封包分派的策略，每個葉片交換器在做
決策的時候是不具備整個資料中心的全局觀，我們方法是利用每個葉
片交換器曾經轉送過的流量去估算路徑的壅塞程度，而且我們不會修
改到傳輸層協定。最後，我們利用OMNeT++ 這套模擬軟體去評估我
們與目前最新穎的方法的效能。 | zh_TW |
| dc.description.abstract | Load balancing is considered as a measurement to improve general performance
and computing resource utilization of two-tier data center networks
(i.e., spine tier and leaf tier). Existing load balancing schemes usually suffer
from uneven load balancing or packet reordering problem. In this paper,
we introduce a load balancing algorithm for data center networks. In our
scheme, every leaf switch makes load balancing decisions without the global
view about path congestion levels. Each leaf switch leverages traffic volume
that it has ever sent to calculate the paths’ congestion levels and do not
require any modification of transport protocol (e.g., packet header modification).
Final, we use OMNeT++ to evaluate our performance along with the
state-of-the-art. | en_US |
| DC.subject | 資料中心 | zh_TW |
| DC.subject | 負載平衡 | zh_TW |
| DC.subject | 分散式 | zh_TW |
| DC.subject | Data center network | en_US |
| DC.subject | Load balancing | en_US |
| DC.subject | Distributed | en_US |
| DC.title | 資料中心內部路徑之負載平衡 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Distributed Packet-Based Load-Balancing for Datacenters | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |