期刊文献+

NFV中的vDPI功能放置问题研究 被引量:1

A Research About Placement of vDPI Functions in NFV Infrastructures
原文传递
导出
摘要 网络功能虚拟化(NFV)是视频流应用的重要技术。在视频流使用场景下,已有的工作研究NFV网络中的虚拟深度包检测(vDPI)放置问题时,仅考虑减少vDPI放置的数量,但没有考虑放置vDPI功能带来的NFV网络性能稳定性问题。针对上述不足,本文在减小vDPI放置数量的基础上,考虑提高网络稳定性,提出了一个多目标线性整数规划模型,并设计了一种贪心近似放置算法。该算法在NFV中放置vDPI功能时,可以降低vDPI放置数量、减少流量经过的平均网络跳数、降低传输时延、保证网络性能的稳定性。本文采用Lingo求出数学模型的最优解,并用贪心近似放置算法进行实验,对比算法实验结果与模型所求最优解可知:所提算法正确性较高,有较好的时间复杂度,适用于不同规模的NFV网络。 Network Function Virtualization (NFV) is an important technology for video streaming applications. In the sense of using video stream, previous related work only considered placing the virtualized deep packet inspection function under the network function virtualization infrastructures to reduce the expenditure of vDPI. However, performance of the network (such as network hops) didn't be taken into account. Focused on the issue that realizes a trade-off between these possibly conflicting goals (expenditure of vDPI and network hops), a Multi-objective Integer Linear Programming model and a greedy approximate optimal placement algorithm were devised to solve the problem. The devised algorithm can find suitable position to place vDPI in NFV and realize a trade-off between conflicting goals (expenditure of vDPI and network hops). Compared the results with mathematical model, the algorithm has high correctness and better time complexity and can be used in different size of NFV network. Network Function Virtualization (NFV); virtual Deep Packet Inspection (vDPI); Multi-objective Integer
作者 吴迪 李俊 韩淑君 Wu Di Li Jun Han Shujun(University of Chinese Academy of Sciences, Beijing, 100049, China Computer Network Information Center of ChineseAeademy of Sciences, Beijing, 100190, China)
出处 《科研信息化技术与应用》 2016年第6期34-43,共10页 E-science Technology & Application
基金 中国科学院重大装备研制基金资助项目(Y642021101)
关键词 网络功能虚拟化 虚拟深度包监测功能 多目标线性整数规划模型 贪心近似放置算法 Linear Programming model greedy approximate optimal algorithm
  • 相关文献

参考文献2

二级参考文献7

  • 1Pareto V. Manual of Political Economy[M]. New Jersey :Scholars Book Shelf, 1971 : 92-98..
  • 2Neumann J V,Morgenstern O. Theory of Games andEconomic Behavior[M]. London : Princeton UniversityPress, 1953: 271-272.
  • 3Saaty T L. The Analytic Hierarchy Process[M]. New York :McGraw-Hill International, 1980: 241-243.
  • 4Ignizio J P. Linear Programming in Single-Multiple-ObjectiveSystems[M]. New Jersey: Prentice-Hall, 1982: 37.
  • 5洪文.利用LINDO求解目标规划[J].安徽大学学报(自然科学版),2001,25(2):1-5. 被引量:6
  • 6赵慧玲,解云鹏,胡晓娟.网络功能虚拟化标准及技术探讨[J].中兴通讯技术,2015,21(4):45-50. 被引量:9
  • 7罗罡辉,叶艳妹.多目标规划的LINDO求解方法[J].计算机应用与软件,2004,21(2):108-110. 被引量:14

共引文献35

同被引文献3

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部