Dynamic control of NFV forwarding graphs with end-to-end deadline constraints

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

Abstract

There is a strong industrial drive to use cloud computing technologies and concepts for providing timing sensitive services in the networking domain since it would provide the means to share the physical resources among multiple users and thus increase the elasticity and reduce the costs. In this work, we develop a mathematical model for user-stateless virtual network functions forming a forwarding graph. The model captures uncertainties of the performance of these virtual resources as well as the time-overhead needed to instantiate them. The model is used to derive a service controller for horizontal scaling of the virtual resources as well as an admission controller that guarantees that packets exiting the forwarding graph meet their end-to-end deadline. The Automatic Service and Admission Controller (AutoSAC) developed in this work uses feedback and feedforward making it robust against uncertainties of the underlying infrastructure. Also, it has a fast reaction time to changes in the input.
Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications (ICC)
Number of pages7
ISBN (Electronic)978-146738999-0
DOIs
Publication statusPublished - 2017 Jul 31
EventIEEE International Conference on Communications 2017: IEEE ICC 2017 - Paris, France
Duration: 2017 May 212017 Aug 25
http://icc2017.ieee-icc.org

Conference

ConferenceIEEE International Conference on Communications 2017
Country/TerritoryFrance
CityParis
Period2017/05/212017/08/25
Internet address

Subject classification (UKÄ)

  • Control Engineering

Free keywords

  • uncertainty
  • cloud computing
  • hardware
  • fabrics
  • mathematical model
  • admission control
  • virtual machines
  • network function virtualization

Fingerprint

Dive into the research topics of 'Dynamic control of NFV forwarding graphs with end-to-end deadline constraints'. Together they form a unique fingerprint.

Cite this