【摘要】：近年互聯(lián)網(wǎng)規(guī)模在不斷地發(fā)生著擴(kuò)張,隨之而來的是互聯(lián)網(wǎng)在架構(gòu)方面的移動(dòng)性、可擴(kuò)展性以及安全性等方面的問題。網(wǎng)絡(luò)虛擬化技術(shù)作為緩解甚至解決互聯(lián)網(wǎng)架構(gòu)僵硬化的關(guān)鍵手段,引起了未來網(wǎng)絡(luò)研究者的廣泛重視。怎樣實(shí)現(xiàn)多個(gè)虛擬網(wǎng)絡(luò)映射到底層異構(gòu)物理網(wǎng)絡(luò),是網(wǎng)絡(luò)虛擬化過程中亟待解決的重要技術(shù)。目前來說,無線虛擬網(wǎng)絡(luò)還是一個(gè)比較新的領(lǐng)域,因此,對(duì)于虛擬無線異構(gòu)網(wǎng)絡(luò)中資源分配算法的研究具有重要的理論和實(shí)踐意義。論文介紹了虛擬網(wǎng)絡(luò)映射過程中資源分配的約束條件、資源的優(yōu)化目標(biāo)以及現(xiàn)有的虛擬網(wǎng)絡(luò)映射算法。在此基礎(chǔ)上研究了一種基于啟發(fā)式排序的異構(gòu)無線虛擬網(wǎng)絡(luò)的映射算法HWVN-HS。算法要為每一個(gè)虛擬節(jié)點(diǎn)確定一組待映射的候選物理節(jié)點(diǎn)。在完成待映射候選物理節(jié)點(diǎn)的確定后,隨即對(duì)候選物理節(jié)點(diǎn)的數(shù)量執(zhí)行排序算法,然后根據(jù)各個(gè)虛擬節(jié)點(diǎn)所對(duì)應(yīng)的候選物理節(jié)點(diǎn)的數(shù)量由少到多依次進(jìn)行映射。算法有兩個(gè)排序過程,一個(gè)是對(duì)虛擬節(jié)點(diǎn)對(duì)應(yīng)的候選物理節(jié)點(diǎn)數(shù)量進(jìn)行排序從而決定哪一個(gè)虛擬節(jié)點(diǎn)優(yōu)先映射;另一個(gè)是對(duì)物理節(jié)點(diǎn)的潛力進(jìn)行排序,決定出哪一個(gè)物理節(jié)點(diǎn)優(yōu)先進(jìn)行映射。在節(jié)點(diǎn)映射完成后,接下來進(jìn)行路徑選擇。在選擇路徑時(shí)通過迪杰斯特拉最短路徑算法計(jì)算路徑成本,然后根據(jù)公式計(jì)算得到物理節(jié)點(diǎn)的映射潛力,物理節(jié)點(diǎn)的映射潛力越小,映射的優(yōu)先級(jí)越高。仿真結(jié)果表明HWVN-HS使得物理資源的利用更加均衡。論文研究了一種基于資源補(bǔ)償?shù)淖赃m應(yīng)異構(gòu)無線虛擬網(wǎng)絡(luò)的資源分配策略AHWVN-RC。假設(shè)虛擬基站有K個(gè)需求用戶,對(duì)用戶在選擇網(wǎng)絡(luò)時(shí)的參數(shù)及分配得到的數(shù)據(jù)速率做出了一組約束,并且通過約束松弛方法對(duì)約束條件組進(jìn)行簡化,得到一組線性規(guī)劃的約束。AHWVN-RC中的自適應(yīng)分配指的是根據(jù)資源的供需狀況進(jìn)行的資源再分配。AHWVN-RC中補(bǔ)償機(jī)制的調(diào)用主要分為兩個(gè)過程:首先是在同一個(gè)基站中補(bǔ)償可用的資源;若同一個(gè)基站中的無線資源不足,則調(diào)用基站就近位置的其他基站給予補(bǔ)償。該算法策略提高了虛擬網(wǎng)絡(luò)運(yùn)營商的滿意度水平,在容量受限的條件下使得有效利用率達(dá)到最大化。
[Abstract]:In recent years, the scale of the Internet has been continuously expanding, followed by the mobility, scalability and security of the Internet in the aspect of architecture. Network virtualization technology, as a key means to alleviate or even solve the rigidity of Internet architecture, has attracted extensive attention of network researchers in the future. How to map multiple virtual networks to underlying heterogeneous physical networks is an important technology to be solved in the process of network virtualization. At present, wireless virtual network is still a new field, so the research of resource allocation algorithm in virtual wireless heterogeneous network has important theoretical and practical significance. This paper introduces the resource allocation constraints, resource optimization objectives and existing virtual network mapping algorithms in the process of virtual network mapping. On this basis, a mapping algorithm HWVN-HSs based on heuristic sorting for heterogeneous wireless virtual networks is studied. The algorithm determines a set of candidate physical nodes to be mapped for each virtual node. After the determination of candidate physical nodes to be mapped, the sorting algorithm is performed on the number of candidate physical nodes, and then the number of candidate physical nodes is mapped according to the number of candidate physical nodes corresponding to each virtual node. The algorithm has two sorting processes, one is to sort the number of candidate physical nodes corresponding to the virtual node to determine which virtual node should be mapped first, and the other is to sort the potential of the physical node. Determines which physical nodes are mapped first. After the node mapping is complete, the path is selected. The path cost is calculated by Dijstra shortest path algorithm, and then the mapping potential of physical node is calculated according to the formula. The smaller the mapping potential of physical node is, the higher the priority of mapping is. Simulation results show that HWVN-HS makes the utilization of physical resources more balanced. An adaptive heterogeneous wireless virtual network resource allocation strategy AHWVN-RCbased on resource compensation is studied in this paper. Assuming that the virtual base station has K demand users, this paper makes a set of constraints on the parameters and the assigned data rate of the user when selecting the network, and simplifies the constraint group by the method of constraint relaxation. To obtain a set of linear programming constraints. AHWVN-RC adaptive allocation refers to the resource redistribution according to the supply and demand of resources .AHWVN-RC compensation mechanism is mainly divided into two processes: first in the same base station to compensate the available resources; If the wireless resources in the same base station are insufficient, the other base stations in the nearest location are called to compensate. The algorithm strategy improves the satisfaction level of the virtual network operators and maximizes the effective utilization under the condition of limited capacity.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN92

【參考文獻(xiàn)】

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

1 曹儐;郎文強(qiáng);李云;;基于最大收益的無線虛擬網(wǎng)絡(luò)重映射算法[J];重慶郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2016年05期

2 曹儐;郎文強(qiáng);陳卓;李云;;無線網(wǎng)絡(luò)虛擬化中資源共享的功率分配算法[J];通信學(xué)報(bào);2016年02期

3 王化;;基于虛擬網(wǎng)絡(luò)的故障探測(cè)及診斷算法的研究[J];電腦開發(fā)與應(yīng)用;2012年12期

4 羅娟;劉川川;李仁發(fā);;基于鏈路可靠性的無線虛擬網(wǎng)絡(luò)分配方法[J];通信學(xué)報(bào);2012年S1期

5 蔡志平;劉強(qiáng);呂品;肖儂;王志英;;虛擬網(wǎng)絡(luò)映射模型及其優(yōu)化算法[J];軟件學(xué)報(bào);2012年04期

相關(guān)博士學(xué)位論文 前2條

1 戴慶龍;接入網(wǎng)虛擬化融合組網(wǎng)技術(shù)研究[D];北京郵電大學(xué);2015年

2 劉文志;網(wǎng)絡(luò)虛擬化環(huán)境下資源管理關(guān)鍵技術(shù)研究[D];北京郵電大學(xué);2012年

相關(guān)碩士學(xué)位論文 前4條

1 馬超;基于負(fù)載壓力的虛擬網(wǎng)絡(luò)映射算法研究[D];重慶大學(xué);2015年

2 周宇清;異構(gòu)網(wǎng)絡(luò)中網(wǎng)絡(luò)選擇與資源管理技術(shù)的研究[D];南京郵電大學(xué);2015年

3 任劍;無線基站虛擬化研究及實(shí)現(xiàn)[D];中國科學(xué)院大學(xué)(工程管理與信息技術(shù)學(xué)院);2013年

4 劉川川;無線網(wǎng)絡(luò)虛擬化中資源分配算法研究[D];湖南大學(xué);2013年

，

本文編號(hào)：2178415