Skip to main content
SpringerLink
Log in

Hop-Limit Path Mapping Algorithm for Virtual Network Embedding

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Virtual network (VN) mapping which deals with the allocation of network resources from the shared physical substrate to individual VNs is one of the key challenges for the application of realizing network virtualization. While a variety of state-of-the-art algorithms have attempted to address this issue from different aspects, the challenge still remains for mapping virtual link with hop count constraint. This paper presents a fast approximation path mapping algorithm to address this issue by formulating such virtual link mapping problem as a path-flow mathematical programming model, which aims to minimize the maximum link load factor. Through the use of the primal–dual method, a fully polynomial time approximation algorithm is proposed to solve this model. The experimental results show that the proposed algorithm can effectively solve the problem of path mapping with hop limit.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Carapinha, J., & Jiménez J.: ‘Network virtualization: a view from the bottom. In Proceedings of the 1st ACM workshop on virtualized infrastructure systems and architectures, Barcelona, Spain, August 2009, pp. 73–80.

  2. Chowdhury, N., & Boutaba, R. (2008). A survey of network virtualization. Waterloo: David R. Cheriton School of Computer Science University of Waterloo.

    MATH  Google Scholar 

  3. Houidi, I., Louati, W., Zeghlache, D., & Baucke, S. (2009). Virtual resource description and clustering for virtual network discovery. In Proceedings of ICC. IEEE, Dresden, Germany, pp. 1–6.

  4. Zhu, Y., & Ammar M. (2006). Algorithms for assigning substrate network resources to virtual network components. In Proceedings of IEEE INFOCOM, Barcelona, Catalunya, Spain, April 2006.

  5. Szeto, W., Iraqi, Y., & Boutaba R. (2003). A multi-commodity flow based approach to virtual network resource allocation. In Proceedings of IEEE GLOBECOM, pp. 3004–3008.

  6. Yu, M., Yi, Y., Rexford, J., & Chiang, M. (2008). Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SIGCOMM Computer Communication Review, 38(2), 17–29.

    Article  Google Scholar 

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

  8. Lischka J., & Karl, H. (2009). A virtual network mapping algorithm based on subgraph isomorphism detection. In Proceedings of the 1st ACM workshop on virtualized infrastructure systems and architectures, Barcelona, Spain, August 2009, pp. 81–88.

  9. Wang, L., Qu, H., & Zhao, J. (2014). Virtual network embedding algorithm for load balance with various requests. Chinese Journal of Electronics, 23(2), 382–387.

    Google Scholar 

  10. Zhang, D., & Gao, L. (2014). Virtual network mapping through locality-aware topological potential and influence node ranking. Chinese Journal of Electronics, 23(1), 61–64.

    Google Scholar 

  11. Zhang, Z. B., Cheng, X., Su, S., et al. (2013). A unified enhanced particle swarm optimization-based virtual network embedding algorithm. International Journal of Communication Systems, 26(8), 1054–1073.

    Article  Google Scholar 

  12. Hu, Q., Wang, Y., & Cao, X. (2013). Resolve the virtual network embedding problem: A column generation approach. In Proceedings of IEEE INFOCOM, 2013.

  13. Jarray, Abdallah, & Karmouch, Ahmed. (2015). Decomposition approaches for virtual network embedding with one-shot node and link mapping. IEEE/ACM Transactions on Networking, 23(3), 1012–1025.

    Article  Google Scholar 

  14. Inführ, J., & Raidl, G. R. (2011). Introducing the virtual network mapping problem with delay, routing and location constraints. Network optimization, volume 6701 of the series lecture notes in computer science, pp. 105–117.

  15. Su, S., Zhang, Z., Liu, A. X., Cheng, X., Wang, Y., & Zhao, X. (2014). Energy-aware virtual network embedding. IEEE/ACM Transactions on Networking, 22(5), 1607–1620.

    Article  Google Scholar 

  16. Melo, M., Sargento, S., Killat, U., Timm-Giel, A., & Carapinha, J. (2015). Optimal virtual network embedding: Energy aware formulation. Computer Networks, 91(C), 184–195.

    Article  Google Scholar 

  17. Zhang, S., Qian, Z., Wu, J., Lu, S., & Epstein, L. (2014). Virtual network embedding with opportunistic resource sharing. IEEE Transactions on Parallel and Distributed Systems, 25(3), 816–827.

    Article  Google Scholar 

  18. Liu, S., Cai, Z., Xu, H., & Xu, M. (2015). Towards security-aware virtual network embedding. Computer Networks, 91(C), 151–163.

    Article  Google Scholar 

  19. Gouveia, L. (1996). Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research, 95, 178–190.

    Article  MATH  Google Scholar 

  20. Garg, N., & Könemann, J. (1998). Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings IEEE Symposium on Foundations of Computer Science, pp. 300–309.

  21. Plotkin, S. A., Shmoys, D., & Tardos, E. (1995). Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20, 257–301.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work is supported by 863 Program (2015AA016102, 2015AA015602), Zhejiang Province Science and technology project (No. 2014C01051), Zhejiang Province Key scientific and technological innovation team (2013TD20), and National Science Foundation of China (NO. 61379118).

Author information

Authors and Affiliations

  1. College of Computer Science, Hangzhou Dianzi University, Hangzhou, 310018, China

    Min Zhang & Xijie Tang

Authors
  1. Min Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xijie Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Min Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, M., Tang, X. Hop-Limit Path Mapping Algorithm for Virtual Network Embedding. Wireless Pers Commun 95, 2033–2048 (2017). https://doi.org/10.1007/s11277-016-3933-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3933-1

Keywords

Search

Navigation