請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/21921完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 周承復 | |
| dc.contributor.author | Kun-Chuan Hsieh | en |
| dc.contributor.author | 謝昆荃 | zh_TW |
| dc.date.accessioned | 2021-06-08T03:53:13Z | - |
| dc.date.copyright | 2018-08-21 | |
| dc.date.issued | 2018 | |
| dc.date.submitted | 2018-08-16 | |
| dc.identifier.citation | [1] J. Zhang, F. R. Yu, S. Wang, T. Huang, Z. Liu, and Y. Liu. Load balancing in data center networks: A survey. IEEE Communications Surveys Tutorials, pages 1–1, 2018.
[2] MohammadAlizadeh,TomEdsall,SarangDharmapurikar,RamananVaidyanathan, Kevin Chu, Andy Fingerhut, Vinh The Lam, Francis Matus, Rong Pan, Navindra Yadav, and George Varghese. Conga: Distributed congestion-aware load balancing for datacenters. SIGCOMM Comput. Commun. Rev., 44(4):503–514, August 2014. [3] Phillipa Gill, Navendu Jain, and Nachiappan Nagappan. Understanding network failures in data centers: Measurement, analysis, and implications. In Proceedings of the ACM SIGCOMM 2011 Conference, SIGCOMM ’11, pages 350–361, New York, NY, USA, 2011. ACM. [4] Sushant Jain, Alok Kumar, Subhasree Mandal, Joon Ong, Leon Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, Jon Zolla, Urs Hölzle, Stephen Stuart, and Amin Vahdat. B4: Experience with a globally-deployed software defined wan. In Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, SIGCOMM ’13, pages 3–14, New York, NY, USA, 2013. ACM. [5] Costin Raiciu, Sebastien Barre, Christopher Pluntke, Adam Greenhalgh, Damon Wischik, and Mark Handley. Improving datacenter performance and robustness with multipath tcp. In Proceedings of the ACM SIGCOMM 2011 Conference, SIGCOMM ’11, pages 266–277, New York, NY, USA, 2011. ACM. [6] D.ThalerandC.Hopps.Multipathissuesinunicastandmulticastnext-hopselection, 2000. [7] Naga Katta, Mukesh Hira, Changhoon Kim, Anirudh Sivaraman, and Jennifer Rex- ford. Hula: Scalable load balancing using programmable data planes. In Proceedings of the Symposium on SDN Research, SOSR ’16, pages 10:1–10:12, New York, NY, USA, 2016. ACM. [8] PatBosshart,GlenGibb,Hun-SeokKim,GeorgeVarghese,NickMcKeown,Martin Izzard, Fernando Mujica, and Mark Horowitz. Forwarding metamorphosis: Fast programmable match-action processing in hardware for sdn. In Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, SIGCOMM ’13, pages 99–110, New York, NY, USA, 2013. ACM. [9] EricoVanini,RongPan,MohammadAlizadeh,ParvinTaheri,andTomEdsall.Letit flow: Resilient asymmetric load balancing with flowlet switching. In 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17), pages 407–420, Boston, MA, 2017. USENIX Association. [10] Bob Lantz, Brandon Heller, and Nick McKeown. A network in a laptop: Rapid pro- totyping for software-defined networks. In Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks, Hotnets-IX, pages 19:1–19:6, New York, NY, USA, 2010. ACM. [11] Pat Bosshart, Dan Daly, Glen Gibb, Martin Izzard, Nick McKeown, Jennifer Rex- ford, Cole Schlesinger, Dan Talayco, Amin Vahdat, George Varghese, and David Walker. P4: Programming protocol-independent packet processors. SIGCOMM Comput. Commun. Rev., 44(3):87–95, July 2014. [12] The P4.org Architecture Working Group. P416 Portable Switch Architecture (PSA). , 2018. [13] Mohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan. Data center tcp (dctcp). In Proceedings of the ACM SIGCOMM 2010 Conference, SIGCOMM ’10, pages 63–74, New York, NY, USA, 2010. ACM. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/21921 | - |
| dc.description.abstract | 在資料中心網路通常會使用多根拓墣，能夠低成本的提供多條路徑，使點與點之間的頻寬增加。因有多條路徑，必須善用所有的可用路徑，並避免走壅塞路徑，故需要有良好的負載平衡機制來做路徑選擇。
目前常見的負載平衡機制都只考慮最短路徑集，在最短路徑集中選擇不壅塞的路徑或是盡可能將封包平均分配在各路徑。這些方法僅能在對稱的拓墣有良好的效果，一但出現複數個連線異常，會造成某些主機之間的最短路徑減少，進而造成某些主機之間不必要的頻寬縮減。 本論文提出了一個具有補償機制的負載平衡機制，能夠在網路出現複數個連線異常時，啟動補償機制。透過選擇最短路徑與非最短路徑，來補償因連線異常所造成的頻寬損失，進而增加點與點之間的頻寬與縮短流量傳輸完成時間。 | zh_TW |
| dc.description.abstract | In order to provide large bisection bandwidth, data center networks employ multi-rooted topologies (e.g., Leaf Spine, Fat Tree). There are multiple paths can be used between any two hosts. Therefore, data center needs a good load balancing mechanism to utilize the available bandwidth.
Recent state-of-art load balancing mechanisms only load balance traffic among all the shortest paths. These mechanisms only perform effectively when the topology is symmetric. If there are link failures occurred in the network, the number of shortest paths diminished. Using these mechanisms might cause unnecessary bandwidth reduced. This thesis presents CACOM, a congestion-aware load balancing with compensatory mechanism. The compensatory mechanism will be activated when there are link failures in the network. This mechanism increases the bandwidth by using both shortest path and non-shortest path. The compensatory mechanism can increase the bandwidth between switches and reduce the flow completion time of the flows in the network. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-08T03:53:13Z (GMT). No. of bitstreams: 1 ntu-107-R05922165-1.pdf: 4430711 bytes, checksum: 81f06c1e6f206af2a076550760accc2b (MD5) Previous issue date: 2018 | en |
| dc.description.tableofcontents | 口試委員會審定書 i
誌謝 ii 摘要 iii Abstract iv 1 Introduction 1 2 Related Work 6 3 Problem Formulation 8 4 Design 11 4.1 CACOMOverview ............................. 11 4.1.1 ProcessingProbes ......................... 12 4.1.2 MaintainingBestNextHop .................... 14 4.1.3 ProcessingData........................... 15 4.2 CACOMAlgorithm............................. 16 4.2.1 CACOMAlgorithmonLeafSwitch................ 17 4.2.2 CACOMAlgorithmonSpineSwitch ............... 19 4.2.3 CACOMAlgorithmonCoreSwitch................ 23 4.2.4 CACOMAlgorithmonController................. 25 5 Evaluation 26 5.1 Emulation.................................. 26 5.1.1 LeafSpineTopology ........................ 27 5.1.2 FatTreeTopology ......................... 28 5.2 Simulation.................................. 29 5.2.1 FCTwithDifferentThresholds................... 30 5.2.2 LeafSpineTopology ........................ 32 5.2.3 LeafSpineTopologywithLinkFailures . . . . . . . . . . . . . . 33 5.2.4 FatTreeTopology ......................... 35 5.2.5 FatTreeTopologywithLinkFailures . . . . . . . . . . . . . . . 36 5.2.6 Stability............................... 36 6 Conclusion 39 Bibliography 40 | |
| dc.language.iso | en | |
| dc.title | 具補償機制的壅塞感知負載平衡系統 | zh_TW |
| dc.title | Congestion-aware Load Balancing with Compensatory Mechanism | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 106-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 林俊宏,吳曉光,蔡子傑 | |
| dc.subject.keyword | 負載平衡,資料中心網路,補償機制, | zh_TW |
| dc.subject.keyword | Load balancing,Data center networks,Compensatory mechanism, | en |
| dc.relation.page | 42 | |
| dc.identifier.doi | 10.6342/NTU201803860 | |
| dc.rights.note | 未授權 | |
| dc.date.accepted | 2018-08-17 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位： | 資訊工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-107-1.pdf 未授權公開取用 | 4.33 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。