期刊文献+

A Topology-Cognitive Algorithm Framework for Virtual Network Embedding Problem 被引量:7

A Topology-Cognitive Algorithm Framework for Virtual Network Embedding Problem
下载PDF
导出
摘要 The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem. The virtual network embedding/ mapping problem is an important issue in network virtualization in Software-Defined Networking (SDN). It is mainly concerned with mapping virtual network requests, which could be a set of SDN flows, onto a shared substrate network automatically and efficiently. Previous researches mainly focus on developing heuristic algorithms for general topology virtual network. In practice however, the virtual network is usually generated with specific topology for specific purpose. Thus, it is a challenge to optimize the heuristic algorithms with these topology information. In order to deal with this problem, we propose a topology-cognitive algorithm framework, which is composed of a guiding principle for topology algorithm developing and a compound algorithm. The compound algorithm is composed of several sub- algorithms, which are optimized for specific topologies. We develop star, tree, and ring topology algorithms as examples, other sub- algorithms can be easily achieved following the same framework. The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms, and the developed compound algorithm greatly enhances the performance of the Revenue/Cost (R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.
出处 《China Communications》 SCIE CSCD 2014年第4期73-84,共12页 中国通信(英文版)
关键词 算法框架 虚拟网络 拓扑结构 嵌入问题 启发式算法 映射问题 网络嵌入 拓扑算法 network virtualization, software- defined networking, virtual network embedding, topology-cognitive
  • 相关文献

参考文献17

  • 1Andersen D G. Theoretical approaches to node assignment [J]. Computer Science Department, 2002: 86.
  • 2Bavier A, Feamster N, Huang M, et al. In VINI veritas: realistic and controlled network experimentation[C]//ACM SIGCOMM Computer Communication Review. ACM, 2006, 36(4): 3-14.
  • 3Turner J S, Taylor D E. Diversifying the internet[Cl//Global Telecommunications Conference, 2005. GLOBECOM'05. IEEE. IEEE, 2005, 2: 6 pp.- 760.
  • 4Feamster N, Gao L, Rexford J. How to lease the Internet in your spare time[J]. ACM SIGCOMM Computer Communication Review, 2007, 37(1): 61-64.
  • 5Andersen D G. Theoretical approaches to node assignment[J]. Computer Science Department, 2002: 86.
  • 6Kleinberg J M. Approximation algorithms for disjoint paths problems[D]. Massachusetts Institute of Technology, 1996.
  • 7Kolliopoulos S G, Stein C. Improved approximation algorithms for unsplittable flow prob- lems[C)I/Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on. IEEE, 1997: 426-436.
  • 8Zhu V, Ammar M H. Algorithms for Assigning Substrate Network Resources to Virtual Network Components[C]IIINFOCOM. 2006: 1-12.
  • 9Lu J, Turner J. Efficient mapping of virtual networks onto a shared substrate[J]. Washington University in St. Louis, Tech. Rep, 2006.
  • 10Ricci R, Alfeld C, Lepreau J. A solver for the network testbed mapping problem[J]. ACM SIGCOMM Computer Communication Review, 2003,33(2): 65-81.

同被引文献17

引证文献7

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部