期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于邻接节点与拓扑结构感知的虚拟网络映射算法 被引量：7

Virtual Network Mapping Algorithm Based on Adjacent Node and Topology Awareness
下载PDF
导出
摘要 现有虚拟网络映射算法的节点映射和链路映射间关联性较差,且链路映射路径较长,导致算法请求接受率和收益开销比均较低。为此,提出一种基于邻接节点与拓扑结构感知的虚拟网络映射算法。在考虑节点位置约束的条件下,将节点资源度、接近中心度与广度优先搜索算法相结合对节点映射过程进行改进,同时利用链路带宽需求与最短路径算法实现链路映射。仿真结果表明,与G-VNM、TCF-VNM、TAS-VNM算法相比,该算法能够缩短链路映射长度,提高请求接受率和收益开销比。 The existing Virtual Network(VN)mapping algorithms have poor correlation between node mapping and link mapping,and the longer link mapping path leads to lower request acceptance rate and lower revenue overhead.To solve this problem,a VN mapping algorithm based on adjacent node and topology awareness is proposed.Considering node location constraint,node resource degree,closeness centrality and breadth first search algorithm are combined to improve node mapping.At the same time,link map is implemented by link bandwidth requirement and shortest path algorithm.Simulation results show that,compared with G-VNM,TCF-VNM and TAS-VNM algorithm,the proposed algorithm can shorten the proposed link mapping length and improve the request acceptance rate and the return cost ratio.
作者 谢枫 孟相如 赵志远 苏玉泽 XIE Feng;MENG Xiangru;ZHAO Zhiyuan;SU Yuze(College of Information and Navigation,Air Force Engineering University,Xi’an 710077,China)
机构地区 空军工程大学信息与导航学院
出处 《计算机工程》 CAS CSCD 北大核心 2018年第9期107-112,共6页 Computer Engineering
基金 国家自然科学基金(61401499)
关键词 虚拟网络映射 节点资源度 接近中心度 位置约束 邻接节点感知 拓扑结构感知 Virtual Network(VN)mapping node resource degree closeness centrality location constraint adjacent node awareness topology awareness
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

二级参考文献117

  • 1ANDERSON T, PETERSON L, SHENKER S, et al. Overcoming the Internet impasse through virtualization[J]. Computer, 2005, 38(4): 34-41.
  • 2TURNER J, TAYLOR D. Diversifying the Internet[A]. Proceedings of the IEEE Global Telecommunications Conference[C]. St Louis, MO, 2005. 755-760.
  • 3BAVIER A, FEAMSTER N, HUANG M, et al. In VINI veritas: realistic and controlled network experimentation[A]. Proceedings of the ACM SIGCOMM[C]. Pisa, Italy, 2006.3-14.
  • 4FEAMSTER N, GAO L, REXFORD J. How to lease the Internet in your spare time[J]. ACM SIGCOMM Computer Communication Review, 2007, 37(1): 61-64.
  • 5CHOWDHURY N, BOUTABA R. A survey of network virtualization[J]. Computer Networks, 2010, 54(5): 862-876.
  • 6CHOWDHURY N, BOUTABA R. Network virtualization: state of the art and research challenges[J]. IEEE Communications Magazine, 2009, 47(7): 20-26.
  • 7GUPTA A, KLEINBERG J, KUMAR A, et al. Provisioning a virtual private network: a network design problem for multicommodity flow[A]. Proceedings of the 33th Annual ACM Symposium on Theory of Computing[C]. Heraklion, Crete, Greece, 2001. 389-398.
  • 8HAQUE A, HOP. A study on the design of survivable optical virtual private networks (O-VPN) [J]. IEEE Transactions on Reliability, 2006, 55(3): 516-524.
  • 9SZETO W, IRAQI Y, BOUTABA R. A multi-commodity flow based approach to virtual network resource allocation[A]. Proceedings of the IEEE Global Telecommunications Conference[C]. San Francisco,USA 2003.3004-3008.
  • 10FANG Q, COBB J, LEISS E. A pre-selection routing scheme for virtual circuit networks[A]. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems[C]. Cambridge, Massachusetts, USA, 1999. 1-6.

共引文献101

同被引文献60

引证文献7

二级引证文献7

计算机工程
2018年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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