【摘要】：網(wǎng)絡(luò)功能虛擬化技術(shù)的提出,為減少服務(wù)提供商的投資成本與管理開銷,實現(xiàn)網(wǎng)絡(luò)功能的靈活組合、新服務(wù)的快速部署提供了解決方案,使多樣化、可擴展的服務(wù)供應(yīng)成為可能.網(wǎng)絡(luò)功能虛擬化中的研究難點是服務(wù)鏈映射問題.現(xiàn)有以最小化端到端時延為目標(biāo)的映射算法受制于資源瓶頸的限制,導(dǎo)致有效服務(wù)路徑不能被映射,影響服務(wù)鏈的映射成功率.針對這一問題,提出一種求解服務(wù)鏈映射問題的粒子群優(yōu)化算法(SIFC-SCMPSO),并以路徑跳數(shù)為約束設(shè)計了初始化可行解與位置更新策略.實驗結(jié)果表明,該算法有效地減少了資源用量,提高了有效路徑被發(fā)現(xiàn)的概率,在服務(wù)鏈映射成功率、長期平均收益、平均開銷等評價指標(biāo)上均取得了較好的結(jié)果.
[Abstract]:The technology of network function virtualization provides a solution for reducing the investment cost and management cost of service providers, realizing the flexible combination of network functions and the rapid deployment of new services. An extensible service supply is possible. The research difficulty of network function virtualization is the service chain mapping problem. The existing mapping algorithms which aim to minimize end-to-end delay are constrained by resource bottleneck, which results in the effective service path cannot be mapped, which affects the mapping success rate of service chain. In order to solve this problem, a particle swarm optimization algorithm (SIFC-SCMPSO) is proposed to solve the service chain mapping problem, and the initialization feasible solution and position update strategy are designed with path hops as constraints. The experimental results show that the proposed algorithm can effectively reduce the amount of resources and increase the probability of finding effective paths. It has achieved good results in the evaluation indexes such as the success rate of service chain mapping, the long-term average income, the average cost and so on.
【作者單位】： 鄭州大學(xué)信息工程學(xué)院;河南工業(yè)大學(xué)信息科學(xué)與工程學(xué)院;國家數(shù)字交換系統(tǒng)工程技術(shù)研究中心;
【基金】：國家“九七三”重點基礎(chǔ)研究發(fā)展計劃基金項目(2012CB315901)資助 國家自然科學(xué)基金項目(61379079)資助 河南省國際合作項目(152102410021)資助
【分類號】：TP393.01
，

本文編號：2224334