彈性光網(wǎng)絡(luò)中節(jié)點(diǎn)優(yōu)先的虛擬網(wǎng)絡(luò)映射算法
發(fā)布時(shí)間:2018-04-04 18:17
本文選題:光通信 切入點(diǎn):彈性光網(wǎng)絡(luò) 出處:《中國(guó)激光》2017年09期
【摘要】:針對(duì)彈性光網(wǎng)絡(luò)中虛擬網(wǎng)絡(luò)映射的資源消耗問題,綜合考慮節(jié)點(diǎn)、鏈路對(duì)虛擬網(wǎng)絡(luò)映射資源需求的影響,提出了節(jié)點(diǎn)優(yōu)先的虛擬網(wǎng)絡(luò)映射算法。所提算法先對(duì)虛擬節(jié)點(diǎn)依據(jù)節(jié)點(diǎn)權(quán)值進(jìn)行排序,然后為虛擬節(jié)點(diǎn)分配滿足資源需求的物理節(jié)點(diǎn),并采用貪心原則映射虛擬節(jié)點(diǎn),最后利用協(xié)同映射方式將虛擬鏈路映射到長(zhǎng)度最短的無環(huán)物理路徑上,以達(dá)到減小虛擬網(wǎng)絡(luò)資源消耗的目的。仿真結(jié)果表明,所提算法能有效減小虛擬網(wǎng)絡(luò)資源消耗并降低網(wǎng)絡(luò)請(qǐng)求阻塞率。
[Abstract]:In order to solve the problem of resource consumption of virtual network mapping in elastic optical networks, a node-first virtual network mapping algorithm is proposed considering the effect of nodes and links on the resource requirements of virtual network mapping.The proposed algorithm first sorts the virtual nodes according to the weights of the nodes, then allocates the physical nodes to meet the resource requirements for the virtual nodes, and maps the virtual nodes according to the greedy principle.Finally, the virtual link is mapped to the shortest physical path in order to reduce the resource consumption of the virtual network.Simulation results show that the proposed algorithm can effectively reduce the consumption of virtual network resources and reduce the blocking rate of network requests.
【作者單位】: 河北工程大學(xué)信息與電氣工程學(xué)院;
【基金】:河北省自然科學(xué)基金(F2014402075,F2017402068) 河北省高等學(xué)?茖W(xué)技術(shù)研究青年基金(QN2016090)
【分類號(hào)】:TN929.1
【相似文獻(xiàn)】
相關(guān)期刊論文 前10條
1 David P.Chernicoff ,張,
本文編號(hào):1711122
本文鏈接:http://www.sikaile.net/kejilunwen/xinxigongchenglunwen/1711122.html
最近更新
教材專著