Volume 41 Issue 6
May  2017
Article Contents

YU Hong-fang, GAO Xiu-jiao. Efficient Virtual Network Embedding with Jointly Coordinated Node and Link Mapping[J]. Journal of University of Electronic Science and Technology of China, 2012, 41(6): 830-835. doi: 10.3969/j.issn.1001-0548.2012.06.003
Citation: YU Hong-fang, GAO Xiu-jiao. Efficient Virtual Network Embedding with Jointly Coordinated Node and Link Mapping[J]. Journal of University of Electronic Science and Technology of China, 2012, 41(6): 830-835. doi: 10.3969/j.issn.1001-0548.2012.06.003

Efficient Virtual Network Embedding with Jointly Coordinated Node and Link Mapping

doi: 10.3969/j.issn.1001-0548.2012.06.003
  • Received Date: 2010-12-24
  • Rev Recd Date: 2012-06-28
  • Publish Date: 2012-12-15
  • 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.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Article Metrics

Article views(3547) PDF downloads(77) Cited by()

Related
Proportional views

Efficient Virtual Network Embedding with Jointly Coordinated Node and Link Mapping

doi: 10.3969/j.issn.1001-0548.2012.06.003

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.

YU Hong-fang, GAO Xiu-jiao. Efficient Virtual Network Embedding with Jointly Coordinated Node and Link Mapping[J]. Journal of University of Electronic Science and Technology of China, 2012, 41(6): 830-835. doi: 10.3969/j.issn.1001-0548.2012.06.003
Citation: YU Hong-fang, GAO Xiu-jiao. Efficient Virtual Network Embedding with Jointly Coordinated Node and Link Mapping[J]. Journal of University of Electronic Science and Technology of China, 2012, 41(6): 830-835. doi: 10.3969/j.issn.1001-0548.2012.06.003

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return