本文選題：物理設(shè)施　切入點(diǎn)：虛擬網(wǎng)絡(luò)請求　出處：《南京郵電大學(xué)》2017年碩士論文

【摘要】：移動網(wǎng)絡(luò)的運(yùn)營目前正面臨著持續(xù)增長的流量壓力,而底層有限的物理資源正在變得日益緊張。無線網(wǎng)絡(luò)虛擬化能夠使多種無線網(wǎng)絡(luò)共享相同的物理基礎(chǔ)設(shè)施資源,是處理該問題的一種有效方式。其中一個主要挑戰(zhàn)是如何高效可靠的根據(jù)所到達(dá)的虛擬網(wǎng)絡(luò)請求對底層的物理網(wǎng)絡(luò)資源進(jìn)行合理的分配和利用。本文首先介紹網(wǎng)絡(luò)虛擬化的理論知識和發(fā)展背景,在此基礎(chǔ)上,本文研究提出一些針對虛擬網(wǎng)絡(luò)映射的相關(guān)算法及策略。首先,本文給出了網(wǎng)絡(luò)虛擬化相關(guān)的理論知識介紹,包括網(wǎng)絡(luò)虛擬化的發(fā)展歷史,現(xiàn)有研究中對于網(wǎng)絡(luò)虛擬化相關(guān)的研究概況和一些實(shí)現(xiàn)方法,主要包括VN映射的典型問題描述和MILP模型,并詳細(xì)的給出了兩種相關(guān)的VN映射算法的實(shí)現(xiàn)過程。本文研究一種基于蟻群優(yōu)化的虛擬網(wǎng)絡(luò)映射算法。算法在節(jié)點(diǎn)映射階段考慮負(fù)載與頻譜連續(xù)性。在鏈路映射階段則通過對節(jié)點(diǎn)可用性等級進(jìn)行排序,從而降低了虛擬網(wǎng)絡(luò)請求的阻塞率。仿真結(jié)果表明,該算法不僅可以降低阻塞概率和占用頻率,而且還可以平衡鏈路負(fù)載。其次,本文提出一種嘗試性的多媒體網(wǎng)絡(luò)的映射策略,所針對的場景是面向多媒體服務(wù)的邊緣云,對于無線通信環(huán)境復(fù)雜多變性,無線網(wǎng)絡(luò)的帶寬利用率會呈現(xiàn)出一定范圍的波動和變化。最后的仿真結(jié)果表明在特定條件約束的多媒體資源場景下,所提出的網(wǎng)絡(luò)映射策略方案基本符合預(yù)期的結(jié)果,從而為實(shí)際更復(fù)雜的應(yīng)用場景提供一定的參考。
[Abstract]:The operation of mobile networks is currently under increasing traffic pressure, while the limited physical resources at the bottom are becoming increasingly tight. Wireless network virtualization enables multiple wireless networks to share the same physical infrastructure resources. It is an effective way to deal with this problem. One of the main challenges is how to allocate and utilize the underlying physical network resources efficiently and reliably according to the virtual network request. This paper first introduces the network. The theoretical knowledge and development background of network virtualization, On this basis, this paper puts forward some related algorithms and strategies for virtual network mapping. Firstly, this paper introduces the theory of network virtualization, including the history of network virtualization. The current research on network virtualization and some implementation methods include the typical problem description of VN mapping and MILP model. In this paper, we study a virtual network mapping algorithm based on ant colony optimization. The algorithm takes load and spectrum continuity into account in the node mapping phase. Phase sorts the node availability levels, The simulation results show that the proposed algorithm can not only reduce the blocking probability and occupancy frequency, but also balance the link load. In this paper, we propose a tentative mapping strategy for multimedia networks. The scenario is a multimedia service-oriented edge cloud, which is complex and volatile for wireless communication environments. The bandwidth utilization rate of wireless network will fluctuate and change in a certain range. Finally, the simulation results show that the proposed network mapping strategy scheme basically accords with the expected results in the scenario of multimedia resources with specific constraints. Thus, it provides a certain reference for the actual more complex application scenarios.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN92

【參考文獻(xiàn)】

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

1 周宏成;;5G超密集網(wǎng)絡(luò)虛擬化解決方案[J];電腦與電信;2017年03期

2 吳修民;;移動通信技術(shù)的發(fā)展對互聯(lián)網(wǎng)網(wǎng)絡(luò)架構(gòu)的影響分析[J];中國新通信;2016年20期

3 Zeheng Yang;Yongan Guo;;An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint[J];中國通信;2016年08期

4 王鋒;周萬;李遜;;VPC多租戶虛擬化網(wǎng)絡(luò)解決方案[J];電信技術(shù);2015年08期

5 Jian DING;Tao HUANG;Jiang LIU;Yun-jie LIU;;基于實(shí)時拓?fù)鋵傩缘奶摂M網(wǎng)絡(luò)映射算法（英文）[J];Journal of Zhejiang University-Science C(Computers & Electronics);2015年02期

6 任勇毛;李俊;錢華林;;未來互聯(lián)網(wǎng)體系結(jié)構(gòu)研究進(jìn)展[J];科研信息化技術(shù)與應(yīng)用;2012年03期

7 程祥;張忠寶;蘇森;楊放春;;虛擬網(wǎng)絡(luò)映射問題研究綜述[J];通信學(xué)報;2011年10期

8 賀延平;;第四代移動通信系統(tǒng)關(guān)鍵技術(shù)研究[J];電子科技;2011年07期

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

1 孫曉川;未來網(wǎng)絡(luò)虛擬化資源管理機(jī)制研究[D];北京郵電大學(xué);2013年

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

1 熊文成;網(wǎng)絡(luò)虛擬化中高效虛擬網(wǎng)絡(luò)映射算法[D];北京郵電大學(xué);2015年

，

本文編號：1691836