点边联合协调的高效虚拟网络映射 |
| |
引用本文: | 虞红芳,高秀娇. 点边联合协调的高效虚拟网络映射[J]. 电子科技大学学报(自然科学版), 2012, 41(6): 830-835. DOI: 10.3969/j.issn.1001-0548.2012.06.003 |
| |
作者姓名: | 虞红芳 高秀娇 |
| |
作者单位: | 1.电子科技大学通信与信息工程学院 成都 611731 |
| |
基金项目: | 国家自然科学基金(60872032) |
| |
摘 要: | 把虚拟网络高效地映射到一个公共的物理网络对网络虚拟化非常重要。该文提出了一种基于线性规划松弛的点边联合协调的高效虚拟网络映射算法。该算法首先松弛MILP并添加约束条件得到加强的线性松弛模型STRICT_LP,然后运用渐进启发式算法求解,得到映射解。仿真结果显示,该算法能够很好地实现虚拟网络点边协调映射,在成功率、网络开销、收益和网络收益开销比值4个方面优于D-ViNE和R-ViNE算法。
|
关 键 词: | 混合整数线性规划 网络虚拟化 松弛 虚拟网络映射 |
收稿时间: | 2010-12-24 |
Efficient Virtual Network Embedding with Jointly Coordinated Node and Link Mapping |
| |
Affiliation: | 1.School of Communication Information and Engineering,University of Electronic Science and Technology of China Chengdu 611731 |
| |
Abstract: | The problem of efficiently mapping a virtual network (VN) over a common physical network is very important for the network virtualization. This paper proposes a VN mapping algorithm based on the relaxed mixed integer linear program (MILP) with close coordination between the node and link mapping. The integer constraints in the MILP formulation of VN mapping problem are relaxed and new linear constraints are added to obtain a strict LP relaxation model, called STRICT_LP. And then a heuristic algorithm is devised to progressively solve the STRICT_LP to get the whole mapping solution. The simulation results show that the proposed algorithm can realize a better coordination between node and link mapping stages and the performances are better than D-ViNE and R-ViNE in term of the acceptance ratio, revenue, cost, and the ratio of revenue to cost. |
| |
Keywords: | |
|
| 点击此处可从《电子科技大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《电子科技大学学报(自然科学版)》下载全文 |