计算机科学 ›› 2015, Vol. 42 ›› Issue (7): 138-141.doi: 10.11896/j.issn.1002-137X.2015.07.030

• 网络与通信 • 上一篇    下一篇

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

彭利民   

  1. 华南理工大学自动化科学与工程学院 广州510006
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受广东省自然科学基金项目(S2012040007599)资助

Virtual Network Mapping Algorithm of Searching Virtual and Substrate Network Synchronously

PENG Li-min   

  • Online:2018-11-14 Published:2018-11-14

摘要: 针对虚拟网络映射中的资源分配问题,通过建立双网同步搜索映射模型,采用普里姆最小生成树算法思想,同步搜索虚拟网络中的待映射虚拟节点和物理网络中的可映射物理节点,将相邻的虚拟节点依次映射到邻接的物理节点上,协调完成节点及其邻接链路的映射操作,使虚拟网络映射具有拓扑一致性。仿真实验表明,提出的DS-VNM算法能有效地降低虚拟链路的映射路径长度,提高网络收益与网络代价比、虚拟网络请求接受率,获得了较好的资源分配性能。

关键词: 虚拟网络映射,双网搜索,资源分配

Abstract: 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.

Key words: Virtual network mapping,Double networks search,Resource allocation

[1] Fischer A,Botero J F,Beck M T,et al.Virtual network embedding:A survey[J].IEEE communication surveys and tutorials,2013,5(4):1888-1906
[2] Cordella L P,Foggia P,Sansone C,et al.A (sub) graph isomorphism algorithm for matching large graphs[J].IEEE Transactions on Pattern Aanalysis and Machine Intelligence,2004,6(4):1367-1382
[3] Lischka J,Karl H.A virtual network mapping algorithm based on subgraph isomorphism detecting[C]∥Proceeding of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures.Barcelona,Spain,2009:81-88
[4] 魏晓辉,邹磊,李洪亮.基于优化的同构子图搜索的虚拟网络映射算法[J].吉林大学学报,2013,3(1):165-171 Wei Xiao-hui,Zhou Lei,Li Hong-Liang.Virtual network embedding algorithm based on improved sub-graph isomorphism search[J].Journal of Jinlin University,2013,3(1):165-171
[5] Chowdhury M,Rahman M R,Boutaba R.ViNEYard:Virtual network embedding algorithms with coordinated node and link mapping[J].IEEE/ACM Transactions on Networking,2012,4(3):206-219
[6] Yu Min-lan,Yi Yung,Jennifer R,et al.Rethinking virtual network embedding:substrate support for path splitting and migration[J].ACM SIGCOMM Computer communication review,2008,8(2):17-29
[7] Eppstein D.Finding the k shortest paths[J].SIAM Journal on Computing,1998,8(2):652-763
[8] Li 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,3(3):178-186
[9] Zegura E,Calvert K,Bhattacharjee S.How to model an internetwork[C]∥Proceeding of the 15th Annual Joint Conference of the IEEE Computer and Communications Society.San Francisco CA,USA,1996:594-602

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!