本文選題：虛擬網(wǎng)絡(luò)映射 + 節(jié)點(diǎn)分割��； 參考：《南京郵電大學(xué)》2014年碩士論文

【摘要】：為解決現(xiàn)有互聯(lián)網(wǎng)技術(shù)的僵化問(wèn)題,網(wǎng)絡(luò)虛擬化技術(shù)采用了虛擬化手段,以共享同一個(gè)底層物理網(wǎng)絡(luò)的方式,通過(guò)映射上層虛擬網(wǎng)絡(luò)滿足用戶多樣化的應(yīng)用需求。虛擬網(wǎng)絡(luò)映射(VNE)是網(wǎng)絡(luò)虛擬化的關(guān)鍵環(huán)節(jié)。VNE就是根據(jù)不回的應(yīng)用目標(biāo),采用最優(yōu)化技術(shù)方法,將虛擬網(wǎng)絡(luò)部署到物理網(wǎng)絡(luò)上。VNE的當(dāng)前研究主題,所涉及的網(wǎng)絡(luò)關(guān)鍵技術(shù)點(diǎn),包括成本/收益、可靠性、存活性和節(jié)能等。本文從成本/收益和能耗二個(gè)方面,研究VNE的算法設(shè)計(jì)與驗(yàn)證。 論文從成本/收益的方面分析節(jié)點(diǎn)分割的映射問(wèn)題,目標(biāo)定位于聚集分散的物理資源,論述了節(jié)點(diǎn)分割映射的可行性以及節(jié)點(diǎn)需求的形式化表示。在些基礎(chǔ)上,應(yīng)用混合整數(shù)規(guī)劃建模方法,提出了結(jié)合路徑分割與節(jié)點(diǎn)分割映射的問(wèn)題模型及算法。論文運(yùn)用了開源軟件GLPK對(duì)NSFNET拓?fù)涫纠_展性能仿真實(shí)驗(yàn)。結(jié)果表明,相比于節(jié)點(diǎn)不可分割的算法,所提算法可以減少虛擬網(wǎng)絡(luò)映射成本；當(dāng)?shù)讓泳W(wǎng)絡(luò)資源相對(duì)稀缺或虛擬網(wǎng)絡(luò)請(qǐng)求量較大時(shí),所提算法可以提高虛擬網(wǎng)絡(luò)請(qǐng)求的接受率。 論文進(jìn)一步分析了虛擬網(wǎng)絡(luò)映射中的能耗問(wèn)題,根據(jù)節(jié)點(diǎn)和鏈路的能耗等級(jí)及特性構(gòu)建了能耗表示的數(shù)學(xué)模型及相應(yīng)的算法；以最小化虛擬網(wǎng)絡(luò)請(qǐng)求的能耗為目標(biāo),引入了基于比例計(jì)算的一種節(jié)能的速率自適應(yīng)虛擬網(wǎng)絡(luò)映射算法(VNE-REA)�；陂_源軟件ALEVIN,論文引入二進(jìn)制變量表示速率和能耗等級(jí)的方法,將原有的非線性問(wèn)題轉(zhuǎn)化為線性問(wèn)題。結(jié)果表明,VNE-REA可以提高虛擬網(wǎng)絡(luò)請(qǐng)求的接受率,同時(shí)降低網(wǎng)絡(luò)能耗。
[Abstract]:In order to solve the problem of rigid Internet technology network virtualization technology adopts virtualization means to share the same underlying physical network through mapping the upper virtual network to meet the diverse application needs of users.Virtual Network Mapping (VNE) is the key link of network virtualization.Includes cost / benefit, reliability, survivability and energy saving.This paper studies the algorithm design and verification of VNE from cost / benefit and energy consumption.In this paper, the mapping problem of node segmentation is analyzed from the aspect of cost / benefit. The target is focused on the distributed physical resources, and the feasibility of node segmentation mapping and the formal representation of node requirements are discussed.On the basis of these, the problem model and algorithm combining path segmentation and node segmentation mapping are proposed by using mixed integer programming modeling method.In this paper, the open source software GLPK is used to simulate the performance of NSFNET topology.The results show that the proposed algorithm can reduce the cost of virtual network mapping compared with the node indivisible algorithm, and the proposed algorithm can improve the acceptance rate of virtual network requests when the underlying network resources are relatively scarce or the amount of virtual network requests is large.In this paper, the problem of energy consumption in virtual network mapping is further analyzed. According to the energy consumption level and characteristics of nodes and links, the mathematical model of energy consumption representation and the corresponding algorithm are constructed, and the goal is to minimize the energy consumption of virtual network requests.An energy saving rate adaptive virtual network mapping algorithm based on proportional computation is introduced in this paper.Based on the open source software ALEVIN, this paper introduces binary variables to express the speed and the energy level, and transforms the original nonlinear problem into a linear problem.The results show that VNE-REA can improve the acceptance rate of virtual network requests and reduce the network energy consumption.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.01

【參考文獻(xiàn)】

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

1 李文;吳春明;陳健;平玲娣;;物理節(jié)點(diǎn)可重復(fù)映射的虛擬網(wǎng)映射算法[J];電子與信息學(xué)報(bào);2011年04期

2 ;Topology awareness algorithm for virtual network mapping[J];Journal of Zhejiang University-Science C(Computers & Electronics);2012年03期

，

本文編號(hào)：1742397