摘要
本文对网络虚拟化技术中的虚拟网映射问题及其研究现状进行了介绍,分析了当前虚拟网映射算法存在的不足,提出了一种解决路径跳数限制约束的虚拟网映射算法—基于路径集多商品流问题模型的映射算法PBMC,该算法有效解决了路径跳数约束与网络资源分布均衡性之间的问题,提高了虚拟网构建成功率和网络资源利用率.
This paper introduces the problem of virtual network mapping on network virtualization technology,reviews the previous studies and analyzes the shortage of existing mapping algorithms.A new mapping algorithm PBMC is proposed,which is based on path based multi-commodity problem model to resolve the problem of hop count limit and network resource distribution balance.Simulation results indicate that compared with traditional multi-commodity based algorithm,PBMC performs better in virtual network request acceptance ratio and resource utilization ratio.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2011年第6期1315-1320,共6页
Acta Electronica Sinica
基金
国家自然科学基金(No.60773182
No.61070157
No.61070213)
国家"863"高技术研究发展计划重大项目(No.2008AA01A323
No.2008AA01A325
No.2009AA01A334)
关键词
网络虚拟化
虚拟网
映射算法
多商品流问题
network virtualization
virtual network
mapping algorithm
multi-commodity problem