期刊文献+

Robust Virtual Network Embedding Based on Component Connectivity in Large-Scale Network 被引量:4

Robust Virtual Network Embedding Based on Component Connectivity in Large-Scale Network
下载PDF
导出
摘要 Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics. Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.
出处 《China Communications》 SCIE CSCD 2017年第10期164-179,共16页 中国通信(英文版)
基金 supported in part by the National Natural Science Foundation of China under Grant No.61471055
关键词 large-scale network component connectivity virtual network embedding SDN 大规模网络 网络嵌入 虚拟网络 连通性 组件 启发式算法 NP难问题 健壮
  • 相关文献

参考文献4

二级参考文献176

  • 1Andersen, D.G., 2002. Theoretical Approaches to Node As- signment. Available from http://www.cs.cmu.edu/-dga/ papers/andersen-assign.ps [Accessed on Sept. 20, 2010]. 被引量:1
  • 2Anderson, T., Peterson, L., Shenker, S., Turner, J., 2005. Overcoming the Internet impasse through virtualization. IEEE Comput. Mag., 38(4):34-41. 被引量:1
  • 3Bavier, A., Feamster, N., Huang, M., Peterson, L., Rexford, J., 2006. In V1NI Veritas: Realistic and Controlled NetworkExperimentation. Proc. Conf. on Applications, Tech- nologies, Architectures, and Protocols for Computer Communications, p. 3-14. [doi: 10.1145/1151659.1 a 59916]. 被引量:1
  • 4Fan, J., Ammar, M.H., 2006. Dynamic Topology Configura- tion in Service Overlay Networks: a Study of Recon- figuration Policies. Proc. 25th IEEE Int. Conf. on Com- puter Communications, p.1-12. [cioi:10.1109/INFOCOM. 2006.139]. 被引量:1
  • 5Feamster, N., Gao, L., Rexford, J., 2007. How to lease the Intemet in your spare time. ACM SIGCOMM Comput.Commun. Rev., 37(1):61-64. [doi:10.1145/1198255.1198 265]. 被引量:1
  • 6Kleinberg, J., 1996. Approximation Algorithms for Disjoint Paths Problems. PhD Thesis, MIT, USA. 被引量:1
  • 7Kolliopoulos, S.G., Stein, C., 1997. Improved Approximation Algorithms for Unsplittable Flow Problems. Proc. 38th Annual Symp. on Foundations of Computer Science, p.426-436. [doi:10.1109/SFCS.1997.646131]. 被引量:1
  • 8Lu, J., Turner, J., 2006. Efficient Mapping of Virtual Networks onto a Shared Substrate. Technical Report No. WUCSE- 2006-35, Washington University, USA. 被引量:1
  • 9Ricci, R., Alfeld, C., Lepreau, J., 2003. A solver for the net- work testbed mapping problem. ACM SIGCOMM Corn- put. Commun. Rev., 33(2):65-81. [doi:10.1145/956981.956988]. 被引量:1
  • 10Turner, J.S., Taylor, D.E., 2005. Diversifying the Intemet. Proc. IEEE Global Telecommunications Conf., p.755- 760. 被引量:1

共引文献459

同被引文献23

引证文献4

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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