【摘要】：傳統(tǒng)的數(shù)據(jù)中心網(wǎng)絡(luò)多采用樹(shù)形拓?fù)錁?gòu)建，但網(wǎng)絡(luò)過(guò)載問(wèn)題嚴(yán)重，同時(shí)采用高性能專(zhuān)用設(shè)備使得設(shè)備成本激增。Fat-tree網(wǎng)絡(luò)緩解了傳統(tǒng)樹(shù)形結(jié)構(gòu)的過(guò)載問(wèn)題，降低設(shè)備成本開(kāi)銷(xiāo)，但仍無(wú)法克服樹(shù)形網(wǎng)絡(luò)擴(kuò)展能力受限的固有問(wèn)題；Fat-tree網(wǎng)絡(luò)下行鏈路唯一，不利于下行路徑容錯(cuò)。另外，數(shù)據(jù)中心網(wǎng)絡(luò)具有多租戶特性，可以支撐多個(gè)虛擬網(wǎng)絡(luò)，但現(xiàn)有資源分配策略難以保證服務(wù)質(zhì)量，資源利用率普遍低下。因此，本文研究的重點(diǎn)之一即是如何設(shè)計(jì)一種繼承Fat-tree拓?fù)鋬?yōu)點(diǎn)且克服Fat-tree拓?fù)淙毕莸木W(wǎng)絡(luò)架構(gòu)，以適用于構(gòu)建數(shù)據(jù)中心網(wǎng)絡(luò)；同時(shí)，設(shè)計(jì)一種能夠優(yōu)化網(wǎng)絡(luò)資源配置，，保證用戶服務(wù)質(zhì)量的虛擬網(wǎng)絡(luò)映射算法也是本文的研究重點(diǎn)。 本文首先對(duì)數(shù)據(jù)中心網(wǎng)絡(luò)發(fā)展現(xiàn)狀進(jìn)行了總結(jié)，指出數(shù)據(jù)中心網(wǎng)絡(luò)的特性需求，并詳細(xì)介紹了典型的拓?fù)浼軜?gòu)。接著對(duì)現(xiàn)有虛擬網(wǎng)絡(luò)映射算法的優(yōu)缺點(diǎn)進(jìn)行總結(jié)。然后設(shè)計(jì)了一種基于模塊化的數(shù)據(jù)中心網(wǎng)絡(luò)拓?fù)浼軜?gòu)Torus of Fat-tree(ToF)，旨在解決Fat-tree網(wǎng)絡(luò)擴(kuò)展能力受限于交換機(jī)端口數(shù)量及下行鏈路缺乏動(dòng)態(tài)選擇性的問(wèn)題，同時(shí)給出三種網(wǎng)絡(luò)擴(kuò)建方式以支持網(wǎng)絡(luò)規(guī)模的靈活擴(kuò)建。另外，為提升網(wǎng)絡(luò)性能，設(shè)計(jì)了一種分布式路由算法。最后基于OPNET完成仿真性能驗(yàn)證，結(jié)果表明，ToF具有良好的網(wǎng)絡(luò)吞吐、時(shí)延性能，同時(shí)能夠很好地支持局部流量通信模式，適應(yīng)于構(gòu)建數(shù)據(jù)中心。在此基礎(chǔ)上設(shè)計(jì)了一種基于用戶優(yōu)先級(jí)的虛擬網(wǎng)絡(luò)映射算法，用以保證用戶服務(wù)質(zhì)量，并給出了模型求解算法，最后構(gòu)建驗(yàn)證系統(tǒng)，對(duì)映射模型的性能進(jìn)行評(píng)估，通過(guò)系統(tǒng)驗(yàn)證，虛擬網(wǎng)絡(luò)映射模型能夠很好地滿足不同用戶的服務(wù)需求，實(shí)現(xiàn)資源的優(yōu)化配置，提升資源利用率。
[Abstract]:The traditional data center network is constructed by tree topology, but the network overload problem is serious, and the equipment cost is greatly increased by using high performance special equipment. Fat-tree network alleviates the overload problem of traditional tree structure. Reduce the cost of equipment, but still can not overcome the tree network expansion capacity constraints inherent problems; The downlink of Fat-tree network is unique, which is unfavorable to the fault tolerance of downlink path. In addition, the data center network has the characteristic of multi-tenant, which can support many virtual networks, but the existing resource allocation strategy is difficult to guarantee the quality of service, and the utilization rate of resources is generally low. Therefore, one of the key points of this paper is how to design a network architecture that inherits the advantages of Fat-tree topology and overcomes the defects of Fat-tree topology, which is suitable for constructing data center network. At the same time, designing a virtual network mapping algorithm which can optimize the allocation of network resources and ensure the quality of service of users is also the focus of this paper. Firstly, this paper summarizes the development of data center network, points out the characteristic requirements of data center network, and introduces the typical topology architecture in detail. Then the advantages and disadvantages of the existing virtual network mapping algorithms are summarized. Then a modularized data center network topology architecture Torus of Fat-tree (ToF), is designed to solve the problem that the Fat-tree network expansion ability is limited by the number of switch ports and the downlink lack of dynamic selectivity. At the same time, three kinds of network expansion methods are given to support the flexible expansion of network scale. In addition, in order to improve network performance, a distributed routing algorithm is designed. Finally, the simulation performance based on OPNET is verified. The results show that ToF has good network throughput and delay performance, and it can support the local traffic communication mode well, which is suitable for building data center. On this basis, a virtual network mapping algorithm based on user priority is designed to ensure the quality of service of users, and a model solving algorithm is given. Finally, a verification system is constructed to evaluate the performance of the mapping model. Through system verification the virtual network mapping model can meet the service needs of different users realize the optimal allocation of resources and improve the utilization of resources.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類(lèi)號(hào)】：TP308;TP393.01

【參考文獻(xiàn)】

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

1 程祥;張忠寶;蘇森;楊放春;;基于粒子群優(yōu)化的虛擬網(wǎng)絡(luò)映射算法[J];電子學(xué)報(bào);2011年10期

2 陳曉梅;黨崗;蘇金樹(shù);;引入價(jià)格因素的網(wǎng)絡(luò)資源分配模型與算法實(shí)現(xiàn)[J];國(guó)防科技大學(xué)學(xué)報(bào);2007年06期

3 饒翔;張順頤;孫雁飛;丁文濤;;基于預(yù)判與合作博弈的下一代網(wǎng)絡(luò)資源優(yōu)化分配方法[J];通信學(xué)報(bào);2009年04期

本文編號(hào)：2374822