本文選題：云計(jì)算 + 網(wǎng)絡(luò)性能�。� 參考：《西南大學(xué)》2017年碩士論文

【摘要】：隨著云計(jì)算平臺(tái)越來(lái)越龐大并且呈現(xiàn)動(dòng)態(tài)化,有效地管理整個(gè)云計(jì)算數(shù)據(jù)中心的資源同時(shí)滿(mǎn)足用戶(hù)應(yīng)用的資源需求成為云提供商和租戶(hù)共同的訴求。云計(jì)算的目標(biāo)是,租戶(hù)可以根據(jù)隨收隨付模式租賃計(jì)算資源,云提供商可以有效地管理計(jì)算資源以保證服務(wù)的可擴(kuò)展性和有效性。網(wǎng)絡(luò)虛擬化技術(shù)的出現(xiàn)為云計(jì)算資源的高效管理帶來(lái)了契機(jī),通過(guò)“抽象”整個(gè)云數(shù)據(jù)中心的物理基礎(chǔ)設(shè)施形成巨大的虛擬“資源池”,滿(mǎn)足多用戶(hù)同時(shí)共享資源的需求,大大降低云資源管理難度和維護(hù)成本。代表未來(lái)網(wǎng)絡(luò)發(fā)展方向的軟件定義網(wǎng)絡(luò)擁有整個(gè)網(wǎng)絡(luò)的全局視圖,可以細(xì)粒度地操縱整個(gè)云數(shù)據(jù)中心資源,使云計(jì)算資源分配任務(wù)變得更加有效。然而,由于租戶(hù)的大量服務(wù)和應(yīng)用程序通常共享同一資源池,使得數(shù)據(jù)中心環(huán)境變得非常復(fù)雜,因此,滿(mǎn)足多個(gè)用戶(hù)的計(jì)算請(qǐng)求而進(jìn)行有效的資源分配,同時(shí)保障整個(gè)網(wǎng)絡(luò)的性能將成為巨大的挑戰(zhàn)。為了解決這個(gè)問(wèn)題,首先,本文構(gòu)建一種基于軟件定義網(wǎng)絡(luò)的fat-tree數(shù)據(jù)中心虛擬資源分配網(wǎng)絡(luò)模型。其次,本文提出一種集群虛擬網(wǎng)絡(luò)(Clustered Virtual Network,CVN)策略和動(dòng)態(tài)heapsort算法尋找含有最合適數(shù)量的虛擬機(jī)(VM)的交付單元(pod),以有效地利用單個(gè)pod中的資源構(gòu)建集群虛擬網(wǎng)絡(luò)。然而,當(dāng)單個(gè)pod找不到足夠的資源時(shí),將聯(lián)合多個(gè)pod構(gòu)建跨pod集群虛擬網(wǎng)絡(luò)(Crossing Pod-CVN,CP-CVN),并提出一種max-min策略以進(jìn)行跨pod的虛擬機(jī)分配。進(jìn)而,在虛擬機(jī)分配的基礎(chǔ)上,本文進(jìn)行網(wǎng)絡(luò)資源分配,并將此網(wǎng)絡(luò)資源分配優(yōu)化問(wèn)題公式化為線(xiàn)性規(guī)劃問(wèn)題(Linear Programming,LP)以最大化網(wǎng)絡(luò)吞吐量,并提出一種近似算法解決此線(xiàn)性規(guī)劃問(wèn)題,保障網(wǎng)絡(luò)的整體性能。理論分析表明本文所提出的近似算法可以有效地解決軟件定義網(wǎng)絡(luò)中的集群虛擬云資源分配問(wèn)題并保證網(wǎng)絡(luò)性能。最后,本文通過(guò)網(wǎng)絡(luò)仿真平臺(tái)Mininet部署了仿真實(shí)驗(yàn)進(jìn)行方法評(píng)估。Mininet是一個(gè)被學(xué)術(shù)界廣泛肯定和采用的網(wǎng)絡(luò)仿真器,它使用輕量級(jí)虛擬化在單個(gè)系統(tǒng)(如計(jì)算機(jī)或虛擬機(jī))上部署大型網(wǎng)絡(luò)。本文從拓?fù)浣Y(jié)構(gòu)、通信模式、資源分配模式、數(shù)據(jù)流生成等多維度設(shè)計(jì)實(shí)驗(yàn),以驗(yàn)證所提出的算法(統(tǒng)稱(chēng)為CVN算法)的有效性。實(shí)驗(yàn)結(jié)果表明,本文所提出的CVN算法較Cloud Mirror、Oktopus和MILPFlow算法在網(wǎng)絡(luò)吞吐量和平均傳輸時(shí)延方面有更好的性能表現(xiàn),證實(shí)理論分析的正確性。
[Abstract]:As the cloud computing platform becomes more and more large and dynamic, it becomes a common demand of cloud providers and tenants to manage the resources of the whole cloud computing data center effectively and meet the resource needs of users. The goal of cloud computing is that tenants can rent computing resources according to pay-as-you-go model, and cloud providers can effectively manage computing resources to ensure the scalability and effectiveness of services. The emergence of network virtualization technology brings opportunities for the efficient management of cloud computing resources. By "abstracting" the physical infrastructure of the entire cloud data center, a huge virtual "resource pool" is formed to meet the needs of multi-users sharing resources at the same time. Greatly reduces the cloud resources management difficulty and the maintenance cost. The software definition network, which represents the future direction of network development, has the global view of the whole network, which can manipulate the whole cloud data center resource fine-grained and make the resource allocation of cloud computing more effective. However, because a large number of services and applications of tenants often share the same resource pool, the data center environment becomes very complex, so efficient resource allocation is made to satisfy the computing requests of multiple users. At the same time, ensuring the performance of the entire network will become a huge challenge. In order to solve this problem, firstly, this paper constructs a virtual resource allocation network model of fat-tree data center based on software defined network. Secondly, this paper proposes a cluster virtual network (cluster Virtual network CVN) strategy and dynamic heapsort algorithm to find delivery units containing the most appropriate number of virtual machines (VMs), so as to effectively utilize the resources in a single pod to construct a cluster virtual network. However, when a single pod can not find enough resources, it will combine multiple pod to construct Crossing Pod-CVN CP-CVN, and propose a max-min strategy to allocate virtual machines across pod. Furthermore, on the basis of virtual machine allocation, the network resource allocation problem is formulated as linear programming problem (LPP) to maximize network throughput. An approximate algorithm is proposed to solve the linear programming problem to ensure the overall performance of the network. Theoretical analysis shows that the proposed approximate algorithm can effectively solve the cluster virtual cloud resource allocation problem in the software defined network and ensure the network performance. Finally, this paper deploys the simulation experiment through the network simulation platform Mininet to evaluate. Mininet is a network simulator that is widely recognized and adopted by the academic circles. It deploys large networks on a single system, such as a computer or virtual machine, using lightweight virtualization. In order to verify the effectiveness of the proposed algorithm (collectively known as CVN algorithm), this paper designs multi-dimensional design experiments from topology, communication mode, resource allocation mode, data stream generation and so on. The experimental results show that the proposed CVN algorithm has better performance in network throughput and average transmission delay than the Cloud Mirror-Oktopus and MILPFlow algorithms. The correctness of the theoretical analysis is verified.
【學(xué)位授予單位】：西南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TP308;TP393.0

【參考文獻(xiàn)】

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

1 林偉偉;朱朝悅;;面向大規(guī)模云資源調(diào)度的可擴(kuò)展分布式調(diào)度方法[J];計(jì)算機(jī)工程與科學(xué);2015年11期

2 郭春梅;張如輝;畢學(xué)堯;;SDN網(wǎng)絡(luò)技術(shù)及其安全性研究[J];信息網(wǎng)絡(luò)安全;2012年08期

，

本文編號(hào)：1845051