本文選題：虛擬網(wǎng)絡(luò) + 多域��； 參考：《電子科技大學(xué)》2014年碩士論文

【摘要】：跨入新世紀(jì),國際化浪潮以及市場經(jīng)濟(jì)的沖擊迎面而來,互聯(lián)網(wǎng)新型應(yīng)用層出不窮,現(xiàn)有的互聯(lián)網(wǎng)架構(gòu)很難滿足用戶對底層網(wǎng)絡(luò)安全性、可擴展性和服務(wù)質(zhì)量等方面的要求,在一定程度上呈現(xiàn)出僵化現(xiàn)象。網(wǎng)絡(luò)虛擬化是一種有效的解決方案,網(wǎng)絡(luò)虛擬化的多態(tài)性能確保底層網(wǎng)絡(luò)資源共享、在同一底層網(wǎng)絡(luò)上異構(gòu)網(wǎng)絡(luò)共存和網(wǎng)絡(luò)本身的多樣性。在實際應(yīng)用中,底層網(wǎng)絡(luò)屬于多個基礎(chǔ)設(shè)施供應(yīng)商,如何把虛擬網(wǎng)絡(luò)嵌入到由多個基礎(chǔ)設(shè)施供應(yīng)商共同管理的底層網(wǎng)絡(luò)是一個重要挑戰(zhàn)。本文將從資源匹配、虛擬網(wǎng)絡(luò)請求分割、虛擬網(wǎng)絡(luò)嵌入和資源綁定四個方面介紹跨多域虛擬網(wǎng)絡(luò)配置過程。本文第一章簡單介紹網(wǎng)絡(luò)虛擬化以后,重點給出跨多域虛擬網(wǎng)絡(luò)嵌入的定義和面臨的挑戰(zhàn)。第二章首先對跨多域虛擬網(wǎng)絡(luò)配置問題進(jìn)行數(shù)學(xué)抽象,然后介紹了資源匹配的概念,并提出用概念聚類技術(shù)對網(wǎng)絡(luò)資源進(jìn)行整合和分類并生成系統(tǒng)樹圖,然后使用基于相似性的匹配算法進(jìn)行資源匹配。本章的重點內(nèi)容是在降低分割成本的同時跨多域分割虛擬網(wǎng)絡(luò)請求。本章提出了跨多域虛擬網(wǎng)絡(luò)分割的啟發(fā)式算法(遞歸調(diào)用最大流最小割算法)和精確算法,通過仿真得出精確算法更適合小型網(wǎng)絡(luò),啟發(fā)式算法憑借它的魯棒性和大型網(wǎng)絡(luò)線性退化性優(yōu)勢更適合動態(tài)變化的大型網(wǎng)絡(luò)。第三章主要介紹了虛擬網(wǎng)絡(luò)的嵌入過程,提出用精確嵌入算法使虛擬節(jié)點和鏈路同時進(jìn)行映射。該算法在最小化虛擬網(wǎng)絡(luò)嵌入成本的同時提高了請求接受率。分別用并行請求處理和順序請求處理兩種方式對虛擬網(wǎng)絡(luò)嵌入過程進(jìn)行仿真,通過仿真得出該精確嵌入算法更適合小型網(wǎng)絡(luò),而且并行請求處理比順序請求處理有更低的嵌入成本和更高的請求接受率,更有利于底層網(wǎng)絡(luò)的充分利用。當(dāng)虛擬網(wǎng)絡(luò)子圖嵌入到底層網(wǎng)絡(luò)以后,提出用最短路徑啟發(fā)式算法和多商品流算法把虛擬網(wǎng)絡(luò)子圖之間的虛擬鏈路嵌入到底層網(wǎng)絡(luò)的域間鏈路。仿真顯示多商品流算法有更高的請求接受率和更低的嵌入成本。全部嵌入以后,對相關(guān)資源進(jìn)行綁定和對底層網(wǎng)絡(luò)資源進(jìn)行更新。第四章介紹了本文中用到的仿真平臺。第五章對全文的工作進(jìn)行了總結(jié),并對跨多域虛擬網(wǎng)絡(luò)嵌入的未來工作進(jìn)行了展望。
[Abstract]:In the new century, with the impact of internationalization and market economy, new applications of the Internet emerge in endlessly. The existing Internet architecture is difficult to meet the requirements of users for the security, scalability and quality of service of the underlying network. To a certain extent, there is a phenomenon of ossification. Network virtualization is an effective solution. The polymorphism of network virtualization can ensure the sharing of the underlying network resources, the coexistence of heterogeneous networks and the diversity of the network itself in the same underlying network. In practical applications, the underlying network belongs to many infrastructure providers. How to embed virtual network into the underlying network managed by multiple infrastructure providers is an important challenge. This paper introduces the configuration process of cross-domain virtual network from four aspects: resource matching, virtual network request segmentation, virtual network embedding and resource binding. In the first chapter, the definition and challenges of virtual network embedding across multiple domains are given. The second chapter firstly abstracts the problem of multi-domain virtual network configuration, then introduces the concept of resource matching, and proposes to integrate and classify network resources with concept clustering technology and generate system tree graph. Then the similarity-based matching algorithm is used for resource matching. The focus of this chapter is to split virtual network requests across multiple domains while reducing the cost of segmentation. In this chapter, a heuristic algorithm (recursive calling maximum flow minimum cut algorithm) and an accurate algorithm are proposed to segment virtual networks across multiple domains. The simulation results show that the exact algorithm is more suitable for small networks. Heuristic algorithm is more suitable for large dynamic networks by virtue of its robustness and linear degradation. In chapter 3, the embedding process of virtual network is introduced, and a precise embedding algorithm is proposed to map the virtual node and link simultaneously. The algorithm not only minimizes the embedding cost of the virtual network, but also improves the request acceptance rate. Parallel request processing and sequential request processing are used to simulate the embedding process of virtual network, and the simulation results show that the accurate embedding algorithm is more suitable for small network. Moreover, parallel request processing has lower embedding cost and higher request acceptance rate than sequential request processing, which is more conducive to the full utilization of the underlying network. When the virtual network subgraph is embedded into the underlying network, the shortest path heuristic algorithm and the multi-commodity flow algorithm are proposed to embed the virtual link between the subgraph of the virtual network into the inter-domain link of the underlying network. Simulation results show that the algorithm has higher request acceptance rate and lower embedding cost. After embedding, bind the related resources and update the underlying network resources. The fourth chapter introduces the simulation platform used in this paper. The fifth chapter summarizes the work of this paper and looks forward to the future work of cross-domain virtual network embedding.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.01

【相似文獻(xiàn)】

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

1 王曉梅;;在線虛擬網(wǎng)絡(luò)實驗平臺的設(shè)計與實現(xiàn)[J];計算機教育;2009年18期

2 秦培榮;;測試虛擬網(wǎng)絡(luò):您準(zhǔn)備好了嗎[J];電信網(wǎng)技術(shù);2010年05期

3 趙道致;制造虛擬網(wǎng)絡(luò)成員企業(yè)產(chǎn)量聯(lián)合優(yōu)化[J];控制與決策;2002年04期

4 沈嘉;;基于單機的虛擬網(wǎng)絡(luò)實驗平臺的實現(xiàn)[J];電腦知識與技術(shù)(學(xué)術(shù)交流);2007年17期

5 黃澤偉;;基于多系統(tǒng)的虛擬網(wǎng)絡(luò)教學(xué)架構(gòu)的實現(xiàn)[J];重慶電力高等�？茖W(xué)校學(xué)報;2010年04期

6 刁烈斯;交換虛擬網(wǎng)絡(luò)技術(shù)[J];計算機工程;1996年04期

7 繆行外,劉保華;交換虛擬網(wǎng)絡(luò)[J];電腦技術(shù);1996年11期

8 趙曉京，莫安民，，孫賢頤;虛擬網(wǎng)絡(luò)及其實現(xiàn)[J];數(shù)據(jù)通信;1996年04期

9 高路;虛擬網(wǎng)絡(luò)技術(shù)[J];現(xiàn)代通信;1997年05期

10 陳瑞志;王麗麗;付世鳳;;虛擬網(wǎng)絡(luò)與安全實驗的研究與應(yīng)用[J];科技致富向?qū)?2010年21期

相關(guān)會議論文 前5條

1 劉輝邦;羅萱;黃保青;金耀輝;;云計算中虛擬網(wǎng)絡(luò)服務(wù)的性能測量及運營實踐[A];中國高等教育學(xué)會教育信息化分會第十二次學(xué)術(shù)年會論文集[C];2014年

2 王穎;熊文成;李文t

本文編號：1895407