Skip to main content

A PSO-Based Virtual Network Mapping Algorithm with Crossover Operator

  • Conference paper
  • First Online:
Smart Computing and Communication (SmartCom 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10135))

Included in the following conference series:

  • 2550 Accesses

Abstract

Virtual network mapping (VNM) is a crucial technology for network virtualization to allocate network resource. One of the major challenges for virtual network mapping is the efficient allocation of substrate resources to the virtual networks. In order to further improve the efficiency of the previous algorithms in large scale network, the crossover operator is introduced into discrete particle swarm optimization algorithm, and a hybrid intelligent algorithm is designed. The algorithm can solve the problem that the traditional particle swarm algorithm is easy to fall into local optimal point and is difficult to reach the global optimal. Experimental results show that the algorithm consumes the lowest cost in the case of mapping the same virtual network requests than existing ones, and has higher revenue/costs ratio.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Turner, J., Taylor, D.: Diversifying the internet. In: Proceedings of the IEEE Global Telecommunications Conference, pp. 755–760 (2005)

    Google Scholar 

  2. Feamster, N., Gao, L., Jennifer, R.: How to lease the Internet in your spare time. ACM SIGCOMM CCR 37(1), 61–64 (2007)

    Article  Google Scholar 

  3. Herker, S., Khan, A., An, X.: Survey on survivable virtual network embedding problem and solutions. In: Proceedings of the Ninth International Conference on Networking and Services, pp. 99–104 (2013)

    Google Scholar 

  4. Ilhem, F., Nadjib, A., Guy, P., Hubert, Z.: VNR algorithm: a greedy approach for virtual networks reconfigurations. In: Proceedings of the GLOBECOM, pp. 1–6 (2011)

    Google Scholar 

  5. Minlan, Y., Yung, Y., Jennifer, R., Mung, C.: Rethinking virtual network embedding: substrate support for path splitting and migration. ACM SIGCOMM CCR 38(2), 17–29 (2008)

    Article  Google Scholar 

  6. Mosharaf, C., Muntasir, R.R., Raouf, B.: Virtual network embedding with coordinated node and link embedding. In: Proceedings of the INFOCOM 2009, pp. 783–791 (2009)

    Google Scholar 

  7. Ilhem, F., Nadjib, A.S., Guy, P.: VNE-AC: virtual network embedding algorithm based on ant colony metaheuristic. In: Proceedings of the IEEE ICC 2011, pp. 1–6 (2011)

    Google Scholar 

  8. Hong, F.Y., Vishal, A., et al.: A cost efficient design of virtual infrastructures with joint node and link mapping. J. Netw. Syst. Manage. 20(1), 97–115 (2012)

    Article  Google Scholar 

  9. Jiang, M., Zhao, Z., et al.: A virtual network mapping algorithm based on time. Chin. J. Electron. 23(CJE-1), 31–36 (2014)

    Google Scholar 

  10. Zhang, D., Gao, L.: Virtual network mapping through locality-aware topological potential and influence node ranking. Chin. J. Electron. 23(CJE-1), 61–64 (2014)

    Google Scholar 

  11. Sheng, Z., Zhuzhong, Q., et al.: Virtual network embedding with opportunistic resource sharing. IEEE Trans. Parallel Distrib. Syst. 25(3), 816–827 (2014)

    Article  Google Scholar 

  12. James, K., Russell, E.: Particle swarm optimization. In: Proceedings of the International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  13. Yuan, Y., Wang, C.-R., Wan, C., Wang, C., Song, X.: Repeatable optimization algorithm based discrete PSO for virtual network embedding. In: Guo, C., Hou, Z.-G., Zeng, Z. (eds.) ISNN 2013. LNCS, vol. 7951, pp. 334–342. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39065-4_41

    Chapter  Google Scholar 

  14. Yuan, Y., Wang, C., Wang, C.: Load controllable virtual network embedding algorithm based on discrete particle swarm optimization. J. Northerstern Univ. Nat. Sci. 35(1), 10–13 (2014)

    Google Scholar 

Download references

Acknowledgment

This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 61300195 and 61379041, the Natural Science Foundation of Hebei Province under Grant Nos. F2014501078 and F2016501079, the Science and Technology Support Program of Northeastern University at Qinhuangdao under Grant No. XNK201401, and the Science and Technology Project of Guangzhou under Grant No. 2013Y2-00069.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sancheng Peng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Yuan, Y., Peng, S., Zhou, L., Wang, C., Wan, C., Huang, H. (2017). A PSO-Based Virtual Network Mapping Algorithm with Crossover Operator. In: Qiu, M. (eds) Smart Computing and Communication. SmartCom 2016. Lecture Notes in Computer Science(), vol 10135. Springer, Cham. https://doi.org/10.1007/978-3-319-52015-5_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-52015-5_54

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-52014-8

  • Online ISBN: 978-3-319-52015-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics