本文關(guān)鍵詞：基于知識描述和遺傳算法的跨域虛擬網(wǎng)絡(luò)映射　出處：《軟件學(xué)報》2014年10期 　論文類型：期刊論文

  更多相關(guān)文章： 網(wǎng)絡(luò)虛擬化 跨域虛擬網(wǎng)絡(luò)映射 資源匹配 知識描述 虛擬網(wǎng)絡(luò)劃分 遺傳算法

【摘要】：網(wǎng)絡(luò)虛擬化環(huán)境下的跨域虛擬網(wǎng)絡(luò)映射是指當(dāng)物理網(wǎng)絡(luò)由多個自治域構(gòu)成時,以最小化虛擬網(wǎng)絡(luò)映射開銷為目標(biāo),將虛擬網(wǎng)絡(luò)請求恰當(dāng)?shù)貏澐譃槎鄠�虛擬子網(wǎng)請求,并分別指派給相應(yīng)自治域以完成映射.資源匹配和虛擬網(wǎng)絡(luò)劃分是跨域虛擬網(wǎng)絡(luò)映射中的兩個關(guān)鍵階段.然而,現(xiàn)有的資源匹配算法無法支持精確的數(shù)值屬性匹配,也無法滿足虛擬網(wǎng)絡(luò)用戶對表達(dá)多樣化映射約束的需求,故實用性不高.此外,虛擬網(wǎng)絡(luò)劃分屬于NP問題,目前也缺乏高效的求解方法.針對上述兩個階段中存在的問題,分別提出了基于OWL及SWRL的資源匹配算法和基于遺傳算法的虛擬網(wǎng)絡(luò)劃分算法.理論分析證明了該方法的正確性.仿真實驗從效率、性能及穩(wěn)定性方面驗證了該方法的有效性.
[Abstract]:Cross-domain virtual network mapping in network virtualization environment is to minimize the overhead of virtual network mapping when the physical network is composed of multiple autonomous domains. A virtual network request is appropriately divided into a plurality of virtual subnet requests. Resource matching and virtual network partitioning are two key stages of cross-domain virtual network mapping. The existing resource matching algorithms can not support accurate numerical attribute matching and can not meet the needs of virtual network users to express the constraints of diverse mapping, so it is not practical. Virtual network partitioning is a NP problem, and there is no efficient method to solve it. The resource matching algorithm based on OWL and SWRL and the virtual network partition algorithm based on genetic algorithm are proposed respectively. The theoretical analysis proves the correctness of the method and the efficiency of simulation experiment. The effectiveness of the method is verified in terms of performance and stability.
【作者單位】： 網(wǎng)絡(luò)與交換技術(shù)國家重點實驗室(北京郵電大學(xué));中國西安衛(wèi)星測控中心喀什衛(wèi)星測控站;
【基金】：國家高技術(shù)研究發(fā)展計劃(863)(2013AA013502) 中央高�；究蒲袠I(yè)務(wù)費專項資金(BUPT-2013RC1103) 國家科技支撐計劃(2012BAH35F02)
【分類號】：TP393.0
【正文快照】： 中文引用格式:肖藹玲,王穎,孟洛明,邱雪松,李文t，

本文編號：1418388