本文選題：數(shù)據(jù)中心　切入點(diǎn)：網(wǎng)絡(luò)結(jié)構(gòu)HRN　出處：《浙江理工大學(xué)》2017年碩士論文

【摘要】：為了適應(yīng)新興應(yīng)用模式的發(fā)展和需求,數(shù)據(jù)中心網(wǎng)絡(luò)正發(fā)生著深刻的變革,不僅表現(xiàn)在規(guī)模擴(kuò)展性的提升和成本控制上,還體現(xiàn)在資源調(diào)度策略等方面。網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)和資源調(diào)度算法是現(xiàn)代數(shù)據(jù)中心的研究重點(diǎn),現(xiàn)有的網(wǎng)絡(luò)結(jié)構(gòu)雖然具有較好的擴(kuò)展性和容錯(cuò)性,但存在擴(kuò)展規(guī)模受限于服務(wù)器網(wǎng)絡(luò)端口數(shù)的問題,不能同時(shí)兼顧性能和經(jīng)濟(jì)成本。其次,隨著數(shù)據(jù)中心規(guī)模和用戶數(shù)量的急劇增大,當(dāng)前資源調(diào)度算法在面對用戶多類別請求時(shí)不能有效的平衡執(zhí)行效率和負(fù)載均衡。針對上述問題,本文具體研究以下內(nèi)容:(1)針對當(dāng)前數(shù)據(jù)中心網(wǎng)絡(luò)擴(kuò)展性受限于服務(wù)器網(wǎng)絡(luò)端口數(shù)的問題,本文提出一種新型高擴(kuò)展低端口的數(shù)據(jù)中心網(wǎng)絡(luò)結(jié)構(gòu)HRN(Hyper Ring Network)。HRN基于低端口普通服務(wù)器和交換機(jī),以分層遞歸定義的形式構(gòu)建大規(guī)模數(shù)據(jù)中心網(wǎng)絡(luò)結(jié)構(gòu)。首先定義HRN結(jié)構(gòu)的編碼規(guī)則和構(gòu)建規(guī)則,根據(jù)其構(gòu)建方式得出其拓?fù)鋵傩圆⒆C明;然后基于HRN結(jié)構(gòu)設(shè)計(jì)最短路徑路由、并行路徑路由和容錯(cuò)路由,來保證數(shù)據(jù)中心的通信性能;最后實(shí)驗(yàn)?zāi)MHRN拓?fù)浼捌渎酚伤惴?并從拓?fù)湫院涂煽啃詢煞矫媾c其它結(jié)構(gòu)進(jìn)行對比。實(shí)驗(yàn)結(jié)果表明該結(jié)構(gòu)能以較低的服務(wù)器和交換機(jī)比例來實(shí)現(xiàn)大規(guī)模網(wǎng)絡(luò)拓?fù)?具有高度擴(kuò)展性,且有效降低了構(gòu)建成本,同時(shí)高效路由算法使結(jié)構(gòu)能提供良好的吞吐量和強(qiáng)可靠性。(2)數(shù)據(jù)中心作為管理和調(diào)度資源的共享平臺,必須具備高效的資源調(diào)度策略。針對調(diào)度過程中系統(tǒng)的負(fù)載失衡問題,本文結(jié)合上述結(jié)構(gòu)HRN提出一種基于Max-Min算法與蟻群算法融合的數(shù)據(jù)中心資源調(diào)度優(yōu)化算法:(1)基于數(shù)據(jù)中心的資源調(diào)度模型設(shè)計(jì)調(diào)度優(yōu)化目標(biāo),然后綜合考慮用戶請求的時(shí)間約束、可靠性、通信帶寬等指標(biāo),制定資源約束函數(shù);(2)針對傳統(tǒng)蟻群算法在解決調(diào)度問題時(shí)存在的不足,本文改進(jìn)了狀態(tài)轉(zhuǎn)移概率公式、局部信息素、全局信息素更新公式,然后就資源負(fù)載不均問題提出了負(fù)載調(diào)整因子,并將其加入信息素更新公式,從而保證調(diào)度過程的負(fù)載均衡;(3)就蟻群算法前期收斂慢的問題,提出將Max-Min算法與改進(jìn)后的蟻群算法相結(jié)合,因?yàn)镸ax-Min算法具有處理效率高且負(fù)載均衡效果好的優(yōu)點(diǎn),所以算法前期利用Max-Min進(jìn)行全局尋優(yōu),用得到的最優(yōu)解來初始化蟻群算法的信息素分布,從而加快算法收斂速度;(4)用CloudSim模擬本文算法,并與Max-Min和蟻群算法進(jìn)行對比,實(shí)驗(yàn)結(jié)果表明本文算法加快了整體的調(diào)度速度,能在保證系統(tǒng)負(fù)載均衡的同時(shí)以較短的時(shí)間完成調(diào)度。
[Abstract]:In order to adapt to the development and demand of the emerging application mode, the data center network is undergoing profound changes, not only in the scale expansion and cost control, but also in the resource scheduling strategy.Network topology and resource scheduling algorithms are the focus of modern data center research. Although the existing network structure has good scalability and fault-tolerance, there is a problem that the expansion scale is limited by the number of server network ports.Performance and economic costs cannot be considered at the same time.Secondly, with the rapid increase of data center size and the number of users, the current resource scheduling algorithm can not effectively balance execution efficiency and load balance in the face of multi-class user requests.In view of the above problems, this paper specifically studies the following contents: 1) aiming at the problem that the expansibility of the current data center network is limited by the number of server network ports,In this paper, a new type of data center network structure, HRN(Hyper Ring Network).HRN, with high expansion and low ports, is proposed, which is based on low port common server and switch, and constructs large-scale data center network structure in the form of hierarchical recursive definition.Firstly, the coding rules and construction rules of HRN structure are defined, and its topological properties are obtained and proved according to its construction mode. Secondly, the shortest path routing, parallel path routing and fault-tolerant routing based on HRN structure are designed to ensure the communication performance of the data center.Finally, the HRN topology and its routing algorithm are simulated and compared with other structures in terms of topology and reliability.The experimental results show that the structure can realize the large-scale network topology with a low ratio of servers and switches, and has a high scalability, and effectively reduces the construction cost.At the same time, the efficient routing algorithm enables the structure to provide good throughput and strong reliability. The data center is a shared platform for resource management and scheduling, and must have an efficient resource scheduling strategy.Aiming at the problem of system load imbalance during scheduling,In this paper, a data center resource scheduling optimization algorithm based on the combination of Max-Min algorithm and ant colony algorithm is proposed, which is based on the above structure HRN. The resource scheduling model based on the data center is used to design the scheduling optimization objectives, and then the time constraints of user requests are considered synthetically.Aiming at the shortcomings of traditional ant colony algorithm in solving scheduling problems, this paper improves the formula of state transition probability, local pheromone and global pheromone updating.Then, the load adjustment factor is put forward for the problem of uneven load of resources, and the pheromone updating formula is added to ensure the load balance of scheduling process (3) the problem of slow convergence in the early stage of ant colony algorithm.This paper proposes to combine the Max-Min algorithm with the improved ant colony algorithm. Because the Max-Min algorithm has the advantages of high processing efficiency and good load balancing effect, Max-Min is used for global optimization in the early stage of the algorithm.The optimal solution is used to initialize the pheromone distribution of the ant colony algorithm, so as to speed up the convergence of the algorithm. The algorithm is simulated by CloudSim and compared with Max-Min and ant colony algorithm. The experimental results show that the proposed algorithm accelerates the overall scheduling speed.At the same time, the scheduling can be completed in a short time while ensuring the load balance of the system.
【學(xué)位授予單位】：浙江理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP308

【參考文獻(xiàn)】

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

1 王斌鋒;蘇金樹;陳琳;;云計(jì)算數(shù)據(jù)中心網(wǎng)絡(luò)設(shè)計(jì)綜述[J];計(jì)算機(jī)研究與發(fā)展;2016年09期

2 宣豪駿;姜瑛;;Cloudsim中基于智能算法的任務(wù)調(diào)度研究[J];價(jià)值工程;2016年10期

3 張煥青;張學(xué)平;王海濤;劉彥涵;;基于負(fù)載均衡蟻群優(yōu)化算法的云計(jì)算任務(wù)調(diào)度[J];微電子學(xué)與計(jì)算機(jī);2015年05期

4 韓冬;肖文俊;李梅生;;EBSN:一種新型全結(jié)構(gòu)模塊化數(shù)據(jù)中心模型[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2015年01期

5 陸菲菲;羅興國;謝向輝;朱桂明;濮小川;;面向大規(guī)模數(shù)據(jù)中心的常量度數(shù)互連網(wǎng)絡(luò)研究[J];計(jì)算機(jī)研究與發(fā)展;2014年11期

6 Han QI;Muhammad SHIRAZ;Jie-yao LIU;Abdullah GANI;Zulkanain ABDUL RAHMAN;Torki A.ALTAMEEM;;Review:Data center network architecture in cloud computing:review, taxonomy, and open research issues[J];Journal of Zhejiang University-Science C(Computers & Electronics);2014年09期

7 孫佳佳;王興偉;高程希;黃敏;;云環(huán)境下基于神經(jīng)網(wǎng)絡(luò)和群搜索優(yōu)化的資源分配機(jī)制[J];軟件學(xué)報(bào);2014年08期

8 朱桂明;謝向輝;郭得科;陸菲菲;陶志榮;;一種高吞吐量、高可擴(kuò)展數(shù)據(jù)中心網(wǎng)絡(luò)結(jié)構(gòu)[J];軟件學(xué)報(bào);2014年06期

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

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

，

本文編號：1713350