Skip to main content

Software Defined Networking II: NFV

  • Chapter
  • First Online:
Software Defined Systems

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

Abstract

Network function virtualization (NFV) emerges as a promising technology to increase the network flexibility, customizability, and efficiency by softwarizing traditional dedicated hardware based functions to virtualized network functions. The prosperous potential of edge cloud makes it an ideal platform to host the network functions. From the perspective of network service providers, an inevitable concern is how to reduce the overall cost for renting various resources from infrastructure providers. This first relates to the virtualized network function (VNF) placement, which shall not be discussed independently without the consideration of flow scheduling. In this chapter, we first discuss a static VNF placement problem with preknown service request rate. Then, we consider a more practical scenario and we alternatively investigate how to dynamically minimize the overall operational cost with joint consideration of packet scheduling, network function management, and resource allocation, without any prior knowledge.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Notes

  1. 1.

    http://www.gurobi.com.

References

  1. Bernardetta Addis, Dallal Belabed, Mathieu Bouet, and Stefano Secci. Virtual Network Functions Placement and Routing Optimization. In Proceedings of the 4th International Conference on Cloud Networking (CloudNet), pages 171–177. IEEE, 2015.

    Google Scholar 

  2. R. Cohen, L. Lewin-Eytan, J. S. Naor, and D. Raz. Near optimal placement of virtual network functions. In 2015 IEEE Conference on Computer Communications (INFOCOM), pages 1346–1354, April 2015.

    Google Scholar 

  3. Apostolos Destounis, Georgios S. Paschos, and Iordanis Koutsopoulos. Streaming Big Data meets Backpressure in Distributed Network Computation. page 24, jan 2016.

    Google Scholar 

  4. Huawei Huang, Song Guo, Jinsong Wu, and Jie Li. Service Chaining for Hybrid Network Function. IEEE Transactions on Cloud Computing, 2017.

    Google Scholar 

  5. Huawei Huang, Peng Li, Song Guo, Weifa Liang, and Kun Wang. Near-Optimal Deployment of Service Chains by Exploiting Correlations between Network Functions. IEEE Transactions on Cloud Computing, 2017.

    Google Scholar 

  6. Wolfgang John, Konstantinos Pentikousis, George Agapiou, Eduardo Jacob, Mario Kind, Antonio Manzalini, Fulvio Risso, Dimitri Staessens, Rebecca Steinert, and Catalin Meirosu. Research directions in Network Service Chaining. In SDN4FNS 2013 – 2013 Workshop on Software Defined Networks for Future Networks and Services, 2013.

    Google Scholar 

  7. Joao Martins, Mohamed Ahmed, Costin Raiciu, Vladimir Olteanu, Michio Honda, Roberto Bifulco, and Felipe Huici. Clickos and the art of network function virtualization. In Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation, pages 459–473. USENIX Association, 2014.

    Google Scholar 

  8. Sevil Mehraghdam, Matthias Keller, and Holger Karl. Specifying and Placing Chains of Virtual Network Functions. In Proceedings of the 3rd International Conference on Cloud Networking (CloudNet), pages 7–13. IEEE, 2014.

    Google Scholar 

  9. Hendrik Moens and Filip De Turck. VNF-P: A Model for Efficient Placement of Virtualized Network Functions. In Proceedings of the 10th International Conference on Network and Service Management (CNSM), pages 418–423. IEEE, 2014.

    Google Scholar 

  10. Michael J. Neely. Opportunistic scheduling with worst case delay guarantees in single and multi-hop networks. In 2011 Proceedings IEEE INFOCOM, pages 1728–1736. IEEE, apr 2011.

    Google Scholar 

  11. Yipei Niu, Bin Luo, Fangming Liu, Jiangchuan Liu, and Bo Li. When hybrid cloud meets flash crowd: Towards cost-effective service provisioning. In 2015 IEEE Conference on Computer Communications (INFOCOM), pages 1044–1052. IEEE, apr 2015.

    Google Scholar 

  12. Mathew Ryden, Kwangsung Oh, Abhishek Chandra, and Jon Weissman. Nebula: Distributed Edge Cloud for Data Intensive Computing. In 2014 IEEE International Conference on Cloud Engineering, pages 57–66. IEEE, mar 2014.

    Google Scholar 

  13. Navindra Yadav, Jim Guichard, Brad McConnell, Christian Jacquenet, Michael Smith, Abhishek Chauhan, Mohamed Boucadair, Paul Quinn, Rajeev Manur, Tom Nadeau, and Others. Network Service Chaining Problem Statement. Network, 2013.

    Google Scholar 

  14. Deze Zeng, Lin Gu, Song Guo, Zixue Cheng, and Shui Yu. Joint Optimization of Task Scheduling and Image Placement in Fog Computing Supported Software-Defined Embedded System. IEEE Transactions on Computers, 65(12):3702–3712, 2016.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Zeng, D., Gu, L., Pan, S., Guo, S. (2020). Software Defined Networking II: NFV. In: Software Defined Systems. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-32942-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-32942-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-32941-9

  • Online ISBN: 978-3-030-32942-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics