本文選題：數(shù)據(jù)中心 + 超額認(rèn)購�。� 參考：《西南大學(xué)》2017年碩士論文

【摘要】：傳統(tǒng)的數(shù)據(jù)中心大多采用一種被稱為Fat-tree的多根樹模型,這種模型利用豐富的多重路徑傳輸高對分帶寬,在它的根部部署了很多的核心交換機去實現(xiàn)功能和規(guī)模的擴展。Fat-tree數(shù)據(jù)中心網(wǎng)絡(luò)可以在任何兩個主機間提供多重的鏈路連接,進(jìn)而提供大的聚合帶寬,然而在Fat-tree中不均勻的流量分布可能引起低效率的傳輸,使系統(tǒng)的網(wǎng)絡(luò)帶寬不能得到充分的利用,這種情況也引起了網(wǎng)絡(luò)處理能力的衰減,導(dǎo)致了系統(tǒng)性能的不可預(yù)測。這種情況阻止了系統(tǒng)充分發(fā)揮并行鏈路的高性能特性,并且會引起很多不可預(yù)測的問題。為了解決以上的挑戰(zhàn),本文提出一種數(shù)據(jù)中心Fat-tree結(jié)構(gòu)中的多播數(shù)據(jù)修復(fù)策略(MRDC)。對于多播樹中的每一個接收者,MRDC給它分配一個數(shù)據(jù)備份系統(tǒng),系統(tǒng)根據(jù)服務(wù)器所處的位置進(jìn)行數(shù)據(jù)的恢復(fù)。因此,當(dāng)多播傳輸完成的時候,數(shù)據(jù)備份系統(tǒng)可以偵測到因服務(wù)器接收數(shù)據(jù)失敗而導(dǎo)致的數(shù)據(jù)包丟失;此時,與接收數(shù)據(jù)失敗的服務(wù)器跳數(shù)最少的鄰居服務(wù)器將向接收失敗的服務(wù)器傳輸數(shù)據(jù)包,直到接收成功。此外,在傳輸數(shù)據(jù)的過程中,MRDC將向多播管理者通報所有的接收服務(wù)器的信息,管理者將選擇最優(yōu)的數(shù)據(jù)恢復(fù)鏈路,進(jìn)而減少在數(shù)據(jù)恢復(fù)過程中可能產(chǎn)生的鏈路擁塞。另外,數(shù)據(jù)中心中的多播路由算法通過調(diào)整傳輸速率和接收速率可以有效地避免擁塞現(xiàn)象的出現(xiàn)。在數(shù)據(jù)中心網(wǎng)絡(luò)中,兩個設(shè)備之間有許多條鏈路連接,也就是說從一臺設(shè)備發(fā)送數(shù)據(jù)到另外一臺設(shè)備有多條路徑可以選擇,如果在大規(guī)模的數(shù)據(jù)傳輸?shù)臅r候不對鏈路加以選擇很容易引起超額認(rèn)購現(xiàn)象的發(fā)生,這種情況會造成數(shù)據(jù)傳輸?shù)氖?影響系統(tǒng)的性能,造成許多不可預(yù)測的現(xiàn)象,因此本文設(shè)計了一種鏈路狀態(tài)的計算算法,可以根據(jù)鏈路的歷史狀態(tài)和現(xiàn)行流量負(fù)載計算出它的超額認(rèn)購概率,進(jìn)而篩選出最優(yōu)的鏈路,優(yōu)化系統(tǒng)的整體性能。因此它很大程度上減少了帶寬的消費和傳輸?shù)难舆t,提高了網(wǎng)絡(luò)吞吐量。
[Abstract]:Traditional data centers mostly use a multi-root tree model called Fat-tree, which utilizes rich multipath transmission with high bandwidth. There are many core switches deployed at its root to enable functional and scalable. Fat-tree data center networks that provide multiple link connections between any two hosts, thus providing large aggregate bandwidth. However, the uneven traffic distribution in Fat-tree may lead to inefficient transmission, which makes the bandwidth of the system not be fully utilized, which also leads to the attenuation of the network processing capacity and the unpredictable performance of the system. This situation prevents the system from making full use of the high performance characteristics of parallel links and can cause many unpredictable problems. In order to solve the above challenges, this paper proposes a multicast data repair strategy in data center Fat-tree architecture. For each receiver in the multicast tree, MRDC assigns it a data backup system, which recovers the data according to the location of the server. Thus, when multicast transmission is complete, the data backup system can detect packet loss caused by the server's failure to receive data; at this time, The neighbor server that has the least number of hops with the server that failed to receive the data will transmit packets to the failed server until it is received successfully. In addition, during the transmission of data, the MRDC will inform the multicast manager of all the information of the receiving server, and the manager will select the optimal data recovery link, thereby reducing the possible link congestion during the data recovery process. In addition, multicast routing algorithm in data center can effectively avoid congestion by adjusting transmission rate and receiving rate. In a data center network, there are many links between two devices, that is, there are multiple paths to choose from one device to another. If the link is not selected during the large-scale data transmission, it is easy to cause oversubscription, which will result in the failure of the data transmission, affect the performance of the system, and cause many unpredictable phenomena. Therefore, this paper designs a link state calculation algorithm, which can calculate the oversubscription probability according to the historical state of the link and the current traffic load, and then select the optimal link and optimize the overall performance of the system. Therefore, it greatly reduces bandwidth consumption and transmission delay, and improves network throughput.
【學(xué)位授予單位】：西南大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP393.0

【參考文獻(xiàn)】

相關(guān)期刊論文 前7條

1 張占昭;王玉紅;;云計算在大數(shù)據(jù)中心建設(shè)的研究與應(yīng)用[J];承德石油高等�？茖W(xué)校學(xué)報;2016年05期

2 李丹;陳貴海;任豐原;蔣長林;徐明偉;;數(shù)據(jù)中心網(wǎng)絡(luò)的研究進(jìn)展與趨勢[J];計算機學(xué)報;2014年02期

3 魏祥麟;陳鳴;范建華;張國敏;盧紫毅;;數(shù)據(jù)中心網(wǎng)絡(luò)的體系結(jié)構(gòu)[J];軟件學(xué)報;2013年02期

4 劉曉茜;楊壽保;郭良敏;王淑玲;宋滸;;雪花結(jié)構(gòu):一種新型數(shù)據(jù)中心網(wǎng)絡(luò)結(jié)構(gòu)[J];計算機學(xué)報;2011年01期

5 周鐵成;;虛擬化技術(shù)在數(shù)據(jù)中心架構(gòu)中的應(yīng)用研究[J];現(xiàn)代計算機(專業(yè)版);2009年04期

6 王東;曾鋒;閔應(yīng)驊;;基于鏈路可共享性的多播路由算法[J];湖南大學(xué)學(xué)報(自然科學(xué)版);2006年04期

7 李臘元,李春林;動態(tài)QoS多播路由協(xié)議[J];電子學(xué)報;2003年09期

相關(guān)博士學(xué)位論文 前1條

1 劉曉茜;云計算數(shù)據(jù)中心結(jié)構(gòu)及其調(diào)度機制研究[D];中國科學(xué)技術(shù)大學(xué);2011年

，

本文編號：1790614