Skip to main content
Log in

Efficient Online Virtual Network Mapping Using Resource Evaluation

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

Network virtualization is a promising solution that can prevent network ossification by allowing multiple heterogeneous virtual networks (VNs) to cohabit on a shared substrate network. It provides flexibility and promotes diversity. A key issue that needs to be addressed in network virtualization is allocation of substrate resources for the VNs with respect to their resource requirements and the topologies of the substrate and virtual networks, namely the VN mapping (VNM) problem. Efficient VNM algorithms aim to maximize the number of coexisting VNs, and increase the utilization and revenue obtained from the substrate resources. In this paper, we present an online VNM algorithm (OVNM) that maximizes the number of coexisting VNs leading to good utilization and revenue of the substrate. Using the OVNM algorithm, we estimate the VN mapping and evaluate the associated substrate resources to map the VN within a proper region on the substrate by using the FVN_Sort (first virtual node sorting) function. This improves the probability of a VN mapping success. Furthermore, by mapping the virtual nodes and links in a coordinated fashion, the resource consumption while mapping is minimized. We evaluate the performance of our approach by using simulation, and show that the algorithm has an acceptable run time and leads to a better blocking probability performance, which means more coexisting VNs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Turner, J.S., Taylor, D.E.: Diversifying the Internet, In: Proceedings of the Global Telecommunications Conference, pp. 755–760 (2004)

  2. Anderson, T., Peterson, L., Shenker, S., Turner, J.: Overcoming the internet impasse through virtualization. IEEE Comput. 38(4), 34–41 (2005)

    Article  Google Scholar 

  3. GENI http://www.geni.net/

  4. Chowdhury, N.M.M.K., Boutaba, R.: Network virtualization: State of the art and research challenges. Commun. Mag. 47(7), 20–26 (2009)

    Article  Google Scholar 

  5. Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., Neugebauer, R., Pratt, I., Warfield, A.: Xen and the art of virtualization. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP19), pp. 164–177 (2003)

  6. Rosenblum, M., Garfinkel, T.: Virtual machine monitors: Current technology and future trends. IEEE Comput. 38(5), 39–47 (2005)

    Article  Google Scholar 

  7. Lischka, J., Karl, H.: A virtual network mapping algorithm based on subgraph isomorphism detection. In: Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures, pp. 81–88. (2009)

  8. Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SIGCOMM Comput. Commun. Rev. 38(2), 17–29 (2008)

    Article  Google Scholar 

  9. Houidi, I., Louati, W., Zeghlache, D.: A distributed virtual network mapping algorithm. In: Proceedings of the International Conference on Communications (ICC), pp. 5634–5640 (2008)

  10. Chowdhury, N.M.M.K., Rahman, M.R., Boutaba, R.: Virtual network embedding with coordinated node and link mapping. In: Proceedings of IEEE INFOCOM, pp. 783–791 (2009)

  11. Razzaq, A., Rathore, M. S.: An approach towards resource efficient virtual network embedding. In: Proceedings of the 2nd International Conference on Evolving Internet, pp. 68–73 (2010)

  12. Zhang, S., Qiu, X.: A novel virtual network mapping algorithm for cost minimizing, cyber journals. J select Areas Telecommun, pp. 1–9 (2011)

  13. Di, H., Li, L., Anand, V., Yu, H., Sun, G.: Cost efficient virtual infrastructure mapping using subgraph isomorphism. In: Proceedings of the Communications and Photonics Conference and Exhibition (ACP), pp. 533–534 (2010)

  14. Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: The p-medians. SIAM J. Appl. Math. 37(3), 539–560 (1969)

    Article  MathSciNet  Google Scholar 

  15. Kershenbaum, A., Kermani, P., Grover, G.: MENTOR: An algorithm for mesh network topological optimization and routing. IEEE Trans. Commun. 39(4), 503–513 (1991)

    Article  Google Scholar 

  16. Duffield, N., Goyal, P., Greenberg, A.: A flexible model for resource management in virtual private networks. In: Proceedings of ACM SIGCOMM, pp. 251–262 (1998)

  17. Cai, Z., Liu, F., Xiao, N.: Virtual network embedding for evolving networks. In: Proceedings of IEEE GLOBECOM, pp. 1–5 (2010)

Download references

Acknowledgments

This research was partially supported by Natural Science Foundation of China grant (No.60,872,032, 60,972,030 and 61,001,084), Sichuan Youth Science and Technology Fund (No.2012JQ0020) Program for New Century Excellent Talents in University (No.NCET-11-0058), and the Fundamental Research Funds for the Central Universities (ZYGX2010J002, ZYGX2010J009). The research of Dr. Vishal Anand is supported in part by the Scholarly Incentive Grant at the College at Brockport, SUNY.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongfang Yu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Di, H., Yu, H., Anand, V. et al. Efficient Online Virtual Network Mapping Using Resource Evaluation. J Netw Syst Manage 20, 468–488 (2012). https://doi.org/10.1007/s10922-012-9249-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-012-9249-x

Keywords

Navigation