Skip to Main content Skip to Navigation
Conference papers

Dynamic placement of extended service function chains: Steiner-based approximation algorithms

Abstract : This paper proposes Steiner-based algorithms to extend already deployed tenant slices or Virtualized Network Functions Forwarding Graphs (or Service Function Chains) as demand grows or additional services are appended to prior service functions and chains. The tenant slices are hosted by Network Function Virtualization Infrastructure (NVFI) providers that can make use of the proposed algorithms to extend tenant slices on demand for growing traffic loads and service extensions including protection and security services(such as extending a slice with a dedicated security slice). The paper proposes a Steiner-based ILP as an exact solution for small graphs and Steiner based approximation algorithms to improve scalability for larger problems.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01851804
Contributor : Makhlouf Hadji <>
Submitted on : Monday, July 30, 2018 - 10:58:18 PM
Last modification on : Friday, May 29, 2020 - 4:24:02 PM

Identifiers

Citation

Selma Khebbache, Makhlouf Hadji, Djamal Zeghlache. Dynamic placement of extended service function chains: Steiner-based approximation algorithms. LCN 2018: 43rd IEEE conference on Local Computer Networks, Oct 2018, Chicago, United States. pp.307-310, ⟨10.1109/LCN.2018.8638044⟩. ⟨hal-01851804⟩

Share

Metrics

Record views

170