HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
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.
Document type :
Conference papers
Complete list of metadata

Contributor : Makhlouf Hadji Connect in order to contact the contributor
Submitted on : Monday, July 30, 2018 - 10:58:18 PM
Last modification on : Monday, April 11, 2022 - 2:00:02 PM



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⟩



Record views