Virtual network embedding based on real-time topological attributes^*

Abstract

As a great challenge of network virtualization, virtual network embedding/mapping is increasingly important. It aims to successfully and efficiently assign the nodes and links of a virtual network (VN) onto a shared substrate network. The problem has been proved to be NP-hard and some heuristic algorithms have been proposed. However, most of the algorithms use only the local information of a node, such as CPU capacity and bandwidth, to determine how to map a VN, without considering the topological attributes which may pose significant impact on the performance of the embedding. In this paper, a new embedding algorithm is proposed based on real-time topological attributes. The concept of betweenness centrality in graph theory is borrowed to sort the nodes of VNs, and the nodes of the substrate network are sorted according to the correlation properties between the former selected and unselected nodes. In this way, node mapping and link mapping can be well coupled. A simulator is built to evaluate the performance of the proposed virtual network embedding (VNE) algorithm. The results show that the new algorithm significantly increases the revenue/cost (R/C) ratio and acceptance ratio as well as reduces the runtime.

Keywords

Virtual network embedding (VNE) / Real-time topological attributes / Betweenness centrality / Correlation properties / Network virtualization

References

[1] Andersen, D.G., 2002. Theoretical Approaches to Node Assignment. Available from Accessed on 2010-Sept.-20].

[2] Anderson, T., Peterson, L., Shenker, S., , 2005. Overcoming the Internet impasse through virtualization. IEEE Comput. Mag., 38(4): 34−41.

[3] Bavier, A., Feamster, N., Huang, M., , 2006. In VINI veritas: realistic and controlled network experimentation. ACM SIGCOMM Comput. Commun. Rev., 36(4): 3−14. [

[4] Cheng, X., Su, S., Zhang, Z., , 2011. Virtual network embedding through topology-aware node ranking. ACM SIGCOMM Comput. Commun. Rev., 41(2): 38−47. [

[5] Cheng, X., Su, S., Zhang, Z., , 2012. Virtual network embedding through topology awareness and optimization. Comput. Netw., 56(6): 1797−1813. [

[6] Chowdhury, N.M.M.K., Rahman, M.R., Boutaba, R., 2009. Virtual network embedding with coordinated node and link mapping. Proc. 28th IEEE Int. Conf. on Computer Communications, p.783−791. [

[7] Fan, J., Ammar, M.H., 2006. Dynamic topology configuration in service overlay networks: a study of reconfiguration policies. Proc. 25th IEEE Int. Conf. on Computer Communications, p.1−12. [

[8] Fischer, A., Botero, J.F., Till Beck, M., , 2013. Virtual network embedding: a survey. IEEE Commun. Surv. Tutor., 15(4): 1888−1906. [

[9] Li, X.L., Wang, H.M., Guo, C.G., , 2012. Topology awareness algorithm for virtual network mapping. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 13(3): 178−186. [

[10] Liu, J., Huang, T., Chen, J.Y., , 2011. A new algorithm based on the proximity principle for the virtual network embedding problem. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 12(11): 910−918. [

[11] Lu, J., Turner, J., 2006. Efficient Mapping of Virtual Networks onto a Shared Substrate. Technical Report No. WUCSE-2006-35, Washington University, USA.

[12] Ricci, R., Alfeld, C., Lepreau, J., 2003. A solver for the network testbed mapping problem. ACM SIGCOMM Comput. Commun. Rev., 33(2): 65−81. [

[13] Wang, Z., Han, Y., Lin, T., , 2012. Virtual network embedding by exploiting topological information. Proc. IEEE Global Communications Conf., p.2603−2608. [

[14] Yu, M., Yi, Y., Rexford, J., , 2008. Rethinking virtual network embedding: substrate support for path splitting and migration. ACM SIGCOMM Comput. Commun. Rev., 38(2): 17−29. [

[15] Zegura, E.W., Calvert, K.L., Bhattacharjee, S., 1996. How to model an internetwork. Proc. IEEE 15th Annual Conf. on Computer Communications Jointly with the IEEE Computer and Communications Societies, p.594−602. [

[16] Zhu, Y., Ammar, M., 2006. Algorithms for assigning substrate network resources to virtual network components. Proc. 25th IEEE Int. Conf. on Computer Communications, p.1−12. [

RIGHTS & PERMISSIONS

Higher Education Press