浏览全部资源
扫码关注微信
[ "黄胜,男,博士,重庆邮电大学副教授,主要研究方向为光纤通信系统和网络。" ]
[ "吴川川,男,重庆邮电大学硕士研究生,主要研究方向为网络资源虚拟化。" ]
[ "杨晓非,男,重庆邮电大学副教授,主要研究方向为电路、信号与系统。" ]
[ "王辉,男,重庆邮电大学硕士研究生,主要研究方向为光网络。" ]
[ "张卫,男,重庆邮电大学硕士研究生,主要研究方向为路由查找。" ]
网络出版日期:2013-12,
纸质出版日期:2013-12-20
移动端阅览
黄胜, 吴川川, 杨晓非, 等. 一种基于临近原则的虚拟网络映射算法[J]. 电信科学, 2013,29(12):38-44.
Sheng Huang, Chuanchuan Wu, Xiaofei Yang, et al. A Virtual Network Mapping Algorithm Based on Approaching Principle[J]. Telecommunications science, 2013, 29(12): 38-44.
黄胜, 吴川川, 杨晓非, 等. 一种基于临近原则的虚拟网络映射算法[J]. 电信科学, 2013,29(12):38-44. DOI: 10.3969/j.issn.1000-0801.2013.12.006.
Sheng Huang, Chuanchuan Wu, Xiaofei Yang, et al. A Virtual Network Mapping Algorithm Based on Approaching Principle[J]. Telecommunications science, 2013, 29(12): 38-44. DOI: 10.3969/j.issn.1000-0801.2013.12.006.
在两阶段虚拟网络映射算法的基础上,针对现有的贪婪策略对节点映射存在盲目性的缺点,提出了一种基于临近原则的虚拟网络映射算法。该算法对节点映射阶段做了优化和改进,在节点映射阶段充分考虑其对链路映射带来的影响,使节点映射到相对集中的区域,降低链路映射阶段的求解难度。仿真结果表明,所提出的算法与已有的算法相比,在虚拟网络请求接受率、平均时间收益和收益开销比等方面均有明显提高。
On the basis of two stages virtual network mapping algorithm
pointing at the defects of the blind node mapping of existing greedy strategy
a virtual network mapping algorithm based on approaching principle was proposed. The algorithm optimized and improved the node mapping stage
and it took a full consideration of the impact on link mapping in the node mapping stage
which made the nodes map to the area of relatively concentrated and reduced the difficulty of solving the link mapping stage. Simulation results show that compared with the existing algorithms
the proposed algorithm improves the virtual network request acceptance ratio
average time revenue and revenue/cost(r/c)ratio.
程祥 , 张忠宝 , 苏森 . 虚拟网络映射问题研究综述 . 通信学报 , 2011 , 32 ( 10 ): 143 ~ 150
魏晓辉 , 张忠宝 , 李洪亮 . 基于优化的同构子图搜索的虚拟网络映射算法 . 吉林大学报 , 2013 , 43 ( 1 ): 165 ~ 171
李小玲 , 王怀民 , 丁博 . 虚拟网络映射问题研究及其进展 . 软件学报 , 2012 , 23 ( 10 ): 3009 ~ 3028
Chowdhury N M M K , Boutaba R . Network virtualization: state of the art and research challenges . IEEE Communications Magazine , 2009 , 47 ( 7 ): 20 ~ 26 .
Lu N J , Turner J . Efficient Mapping of Virtual Networks onto a Shared Substrate . Washington: Washington University Technology Report , 2006
Yu N M , Yi Y , Rexford J , et al . Rethinking virtual network embedding: substrate support for path splitting and migration . Computer Communication Review , 2008 , 38 ( 2 ): 17 ~ 29
Lu N J , Zhang S R , Li Y , et al . Davinci: dynamically adaptive virtual networks for a customized internet . Proceedings of the ACM CoNEXT Conference , Madrid, Spain , 2008
Zhu Y , Ammar M . Algorithms for assigning substrate network resources to virtual network components . Proceedings of the 25th IEEE Int'l Conference on Computer Communications , Barcelona, Catalunya, Spain , 2006
Shamsi J , Brockmeyer M . QoSMap: QoS aware mapping of virtual networks for resiliency and efficiency . Proceedings of the IEEE GLOBECOM Workshop , Washington D C, USA , 2007
Houidi I , Louati W , Zeghlache D . A distributed virtual network mapping algorithm . Proceedings of IEEE ICC , Beijing, China , 2008
Chowdhury N M M K , Rahman M R , Boutaba R . Virtual network embedding with coordinated node and link mapping . Proceedings of IEEE INFOCOM 2009 , Rio de Janeiro, Brazil , 2009 : 783 ~ 791
Chowdhury N M M K , Rahman M R , Boutaba R . ViNEYard:virtual network embedding algorithms with coordinated node and link mapping . IEEE/ACM Transactions on Networking , 2012 ( 3 )
Lischka J , Karl H . A virtual network mapping algorithm based on subgraph isomorphism detection . Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems andArchitectures , Barcelona, Spain , 2009 : 81 ~ 88
Liu J , Huang T , Chen J Y . ViNEYard: a new algorithm based on the proximity principle for the virtual network embedding problem . Journal of Zhejiang University-Science C(Computers &Electronics) , 2011 , 12 ( 11 ): 910 ~ 918
Eppstein D . Finding the shortest paths . SIAM J Comput , 1998 , 28 ( 2 ): 652 ~ 673
0
浏览量
614
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构