發(fā)布時間：2018-03-25 02:13

  本文選題：云計算　切入點：虛擬網(wǎng)映射　出處：《電子與信息學報》2013年07期

【摘要】：虛擬網(wǎng)絡映射忽略通信路徑上中間節(jié)點的資源消耗,以底層物理網(wǎng)絡資源消耗最小或路徑最短為目標,導致最優(yōu)路徑上中間節(jié)點資源不足而出現(xiàn)瓶頸,影響整個底層網(wǎng)絡的性能及后續(xù)虛擬網(wǎng)絡請求成功率。該文針對這一問題考慮物理路徑上中間節(jié)點資源消耗,以節(jié)點負載和鏈路負載同時達到均衡為目標,將路徑跳數(shù)限制作為約束,建立虛擬網(wǎng)絡映射的數(shù)學模型,并采用多目標負載均衡粒子群優(yōu)化算法求解,記作LB-PSO。實驗證明該算法有效地消除了資源瓶頸,為后續(xù)虛擬網(wǎng)絡請求提供一個更為均衡的底層物理網(wǎng)絡,從而提高了虛擬網(wǎng)絡構(gòu)建成功率、網(wǎng)絡資源利用率以及基礎設施提供商的收益。
[Abstract]:Virtual network mapping neglects the resource consumption of the intermediate nodes on the communication path, aiming at the minimum resource consumption or the shortest path of the underlying physical network, which leads to the shortage of the intermediate node resources on the optimal path. The performance of the whole underlying network and the success rate of subsequent virtual network requests are affected. In view of this problem, the resource consumption of the intermediate node in the physical path is considered. The goal is to balance the node load and link load at the same time. A mathematical model of virtual network mapping is established with path hops restriction as constraint, and multi-objective load balancing particle swarm optimization algorithm is used to solve the problem, which is described as LB-PSO.Experimental results show that the algorithm effectively eliminates resource bottleneck. It provides a more balanced underlying physical network for subsequent virtual network requests, which improves the success rate of virtual network construction, the utilization of network resources and the benefits of infrastructure providers.
【作者單位】： 北京郵電大學智能交換與控制國家重點實驗室;
【基金】：國家自然科學基金(2009CB320406) 國家863計劃項目(2011AA01A102) 國家創(chuàng)新研究群體科學基金(60821001)資助課題
【分類號】：TP393.01

【參考文獻】

相關期刊論文 前2條

1 姜明;王保進;吳春明;孔祥慶;閔嘯;張e，

本文編號：1661076