期刊文献+

一种双网同步搜索的虚拟网络映射算法

Virtual Network Mapping Algorithm of Searching Virtual and Substrate Network Synchronously
下载PDF
导出
摘要 针对虚拟网络映射中的资源分配问题,通过建立双网同步搜索映射模型,采用普里姆最小生成树算法思想,同步搜索虚拟网络中的待映射虚拟节点和物理网络中的可映射物理节点,将相邻的虚拟节点依次映射到邻接的物理节点上,协调完成节点及其邻接链路的映射操作,使虚拟网络映射具有拓扑一致性。仿真实验表明,提出的DS-VNM算法能有效地降低虚拟链路的映射路径长度,提高网络收益与网络代价比、虚拟网络请求接受率,获得了较好的资源分配性能。 Aiming at the resource allocation problem in virtual network mapping,a mapping model of searching virtual network and substrate network synchronously was proposed in this paper.By using the principle of the prim minimum spanning tree algorithm,the virtual node waiting for being mapped in the virtual network and the right substrate node satisfying the current virtual node in the substrate network are searched simultaneously,so that adjacent nodes in the virtual network are mapped into adjacent nodes in the substrate network in a proper order,at the same time the virtual nodes and their adjacent links are mapped in a harmony way,resulting in that topological property of the virtual network is also kept in the substrate network after being mapped.Simulation results show that the DS-VNM algorithm can reduce the mapping path length of virtual links effectively,and improve ratio of the network revenue and network cost and the acceptance ratio of the virtual network requests,and achieve good performance while allocating network resource.
作者 彭利民
出处 《计算机科学》 CSCD 北大核心 2015年第7期138-141,共4页 Computer Science
基金 广东省自然科学基金项目(S2012040007599)资助
关键词 虚拟网络映射 双网搜索 资源分配 Virtual network mapping Double networks search Resource allocation
  • 相关文献

参考文献9

  • 1Fischer A,Botero J F,Beck M T,et al. Virtual network embed- ding: A survey[J]. IEEE communication surveys and tutorials, 2013,15(4) :1888-1906.
  • 2Cordelia L P,Foggia P,Sansone C,et al. A (sub) graph isomor- phism algorithm for matching large graphs[J]. IEEE Transac- tions on Pattern Aanalysis and Machine Intelligence, 2004, 26 (4) : 1367-1382.
  • 3Lischka J, Karl H. A virtual network mapping algorithm based on subgraph isomorphism detecting[C]//Proceeding of the 1't ACM Workshop on Virtualized Infrastructure Systems and Ar- chitectures. Barcelona, Spain, 2009 : 81-88.
  • 4魏晓辉,邹磊,李洪亮.基于优化的同构子图搜索的虚拟网络映射算法[J].吉林大学学报(工学版),2013,43(1):165-171. 被引量:7
  • 5Chowdhury M, Rahman M R, Boutaba tL ViNEYard: Virtual network embedding algorithms with coordinated node and link mapping[J]. IEEE/ACM Transactions on Networking, 2012,34 (3) :206-219.
  • 6Yu Min-lan, Yi Yung,Jennifer R, et al. Rethinking virtual net- work embedding:substrate support for path splitting and migra- tion[J]. ACM SIGCOMM Computer communication review, 2008,38(2):17-29.
  • 7Eppstein D. Finding the k shortest paths[J]. SIAM Journal on Computing, 1998,28(2) : 652-763.
  • 8Li Xiao-ling, Wang Huai-min, Guo Chang-guo, et al. Topology awareness algorithm for virtual network mapping[J]. Journal of Zhejiang University-Science C(Computers & Electronic),2012, 13(3) : 178-186.
  • 9Zegura E, Calvert K, Bhattaeharjee S. How to model an internet- work[C] ffProeeeding of the 15th Annual Joint Conference of the IEEE Computer and Communications Society. San Francisco CA,USA, 1996 : 594-602.

二级参考文献10

  • 1ChowdhuryN M M K, Rahman M R, Boutaba R. Virtual network embedding with coordinated node and link mapping[C] // INFOCOM 2009, IEEE, 2009: 783-791.
  • 2Chowdhury N M M K, Boutaba R. Network virtualization: state of the art and research challenges [J]. IEEE Communications Magazine, 2009, 47 (7) :20-26.
  • 3Yu M, Yi Y, Rexford J, et al. Rethinking virtual network embedding: substrate support for path splitting and migration[J]. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 17-29.
  • 4Fan J, Ammar M. Dynamic topology configuration in service overlay networks: a study of reconfiguration policies[C]//The 25th IEEE International Conference on Computer Communications, 2006:1-12.
  • 5Lu J, Turner J. Efficient mapping of virtual networks onto a shared substrate[R]. Department of Computer Science and Engineering, Washington University in St. Louis, Technical Report WUCSE- 2006-35, 2006.
  • 6Zhu Y, Ammar M. Algorithms for assigning substrate network resources to virtual network components[C] //IEEE INFOCOM Proceedings, Barcelona, Spain, 2006:1-12.
  • 7Lischka J, Karl H. A virtual network mapping algorithm based on subgraph isomorphism detection[C] // The 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures Proceedings, Barcelona, Spain, 2009 : 81-88.
  • 8Cordelia L P, Foggia P, Sansone C, et al. A (sub) graph isomorphism algorithm for matching large graphs[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26 (10) : 1367-1372.
  • 9Butt N, Chowdhury M, Boutaba R. Topologyawareness and re-optimization mechanism for virtual network embedding[C] // The 9th International Ifip Tc 6 Networking Conference, Chennai, India, 2010:27-39.
  • 10Zegura E, Calvert K, Bhattacharjee S. How to model an Internetwork? [C]//IEEE INFOCOM Proceedings,San Francisco, CA, USA, 1996: 594- 602.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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