Elephant Flow Detection in Datacenters Using OpenFlow-based Hierarchical Statistics Pulling
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
2269 | en_US |
dc.citation.spage |
2264 | en_US |
dc.citation.woscount |
3 | en_US |
dc.contributor.author |
Lin, Chun-Yu | en_US |
dc.contributor.author |
Chen, Chien | en_US |
dc.contributor.author |
Chang, Je-Wei | en_US |
dc.contributor.author |
Chu, Yu Huang | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
資訊技術服務中心 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.contributor.department |
Information Technology Services Center | en_US |
dc.date.accessioned |
2017-04-21T06:49:49Z | |
dc.date.available |
2017-04-21T06:49:49Z | |
dc.date.issued |
2014 | en_US |
dc.description.abstract |
This paper proposes an effective elephant flow detection in datacenters. Equal Cost MultiPath (ECMP) is a popular routing mechanism to achieve load balancing in datacenter networks. However, ECMP only considers equally distributing the flows over equal-length paths, but does not take the size of the flows into account. Previous studies show that detecting and rerouting elephant flows (flows that transfer significant amount of data) effectively can lead to a 113% improvement in aggregate throughput compared with the simple use of ECMP. A naive way to detect the elephant flows is to pull statistics from each flow independently. Since "the elephant and mouse phenomenon" suggests that there are only very few elephant flows in a datacenter network, it\'s not efficient to collect information from each flow. Therefore, we propose a Hierarchical Statistics Pulling (HSP) mechanism using OpenFlow protocol to save bandwidth consumption and processing time. In order to further improve the performance of HSP, two supplement functions called elephant store and range splitting are developed. Our approaches can detect elephant flows with only a small amount of network bandwidth consumption. We use Mininet emulator and mathematical analysis to verify our methods. Both of them confirm the benefits of our approaches. | en_US |
dc.identifier.isbn |
978-1-4799-3512-3 | en_US |
dc.identifier.issn |
1930-529X | en_US |
dc.identifier.journal |
2014 IEEE Global Communications Conference (GLOBECOM 2014) | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/136128 | |
dc.identifier.wosnumber |
WOS:000380919400086 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Elephant Flow Detection | en_US |
dc.subject |
Software Defined Networking | en_US |
dc.subject |
Traffic Engineering | en_US |
dc.subject |
Statistics Pulling | en_US |
dc.subject |
Elephant and Mice Phenomenon | en_US |
dc.title |
Elephant Flow Detection in Datacenters Using OpenFlow-based Hierarchical Statistics Pulling | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Lin, C.-Y., Chen, C., Chang, J.-W., & Chu, Y. H. (2014). Elephant Flow Detection in Datacenters Using OpenFlow-based Hierarchical Statistics Pulling. 2014 IEEE Global Communications Conference (GLOBECOM 2014), 2264–2269. https://ir.lib.nycu.edu.tw/handle/11536/136128
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/136128