Dynamic Placement of Extended Service Function Chains: Steiner-based Approximation Algorithms

Selma Khebbache; Makhlouf Hadji; Djamal Zeghlache

doi:10.1109/LCN.2018.8638044

Dynamic Placement of Extended Service Function Chains: Steiner-based Approximation Algorithms

Selma Khebbache
, Makhlouf Hadji
, Djamal Zeghlache

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	43rd IEEE Conference on Local Computer Networks, LCN 2018
Publisher	IEEE Computer Society
Pages	307-310
Number of pages	4
ISBN (Electronic)	9781538644133
DOIs	https://doi.org/10.1109/LCN.2018.8638044
Publication status	Published - 2 Jul 2018
Externally published	Yes
Event	43rd IEEE Conference on Local Computer Networks, LCN 2018 - Chicago, United States Duration: 1 Oct 2018 → 4 Oct 2018

Publication series

Name	Proceedings - Conference on Local Computer Networks, LCN
Volume	2018-October

Conference

Conference	43rd IEEE Conference on Local Computer Networks, LCN 2018
Country/Territory	United States
City	Chicago
Period	1/10/18 → 4/10/18

Access to Document

10.1109/LCN.2018.8638044

Cite this

Khebbache, S., Hadji, M., & Zeghlache, D. (2018). Dynamic Placement of Extended Service Function Chains: Steiner-based Approximation Algorithms. In 43rd IEEE Conference on Local Computer Networks, LCN 2018 (pp. 307-310). Article 8638044 (Proceedings - Conference on Local Computer Networks, LCN; Vol. 2018-October). IEEE Computer Society. https://doi.org/10.1109/LCN.2018.8638044

@inproceedings{78d9fc70f8c94bcabaa318b3378f4352,

title = "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.",

author = "Selma Khebbache and Makhlouf Hadji and Djamal Zeghlache",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 43rd IEEE Conference on Local Computer Networks, LCN 2018 ; Conference date: 01-10-2018 Through 04-10-2018",

year = "2018",

month = jul,

day = "2",

doi = "10.1109/LCN.2018.8638044",

language = "English",

series = "Proceedings - Conference on Local Computer Networks, LCN",

publisher = "IEEE Computer Society",

pages = "307--310",

booktitle = "43rd IEEE Conference on Local Computer Networks, LCN 2018",

}

Khebbache, S, Hadji, M & Zeghlache, D 2018, Dynamic Placement of Extended Service Function Chains: Steiner-based Approximation Algorithms. in 43rd IEEE Conference on Local Computer Networks, LCN 2018., 8638044, Proceedings - Conference on Local Computer Networks, LCN, vol. 2018-October, IEEE Computer Society, pp. 307-310, 43rd IEEE Conference on Local Computer Networks, LCN 2018, Chicago, United States, 1/10/18. https://doi.org/10.1109/LCN.2018.8638044

Dynamic Placement of Extended Service Function Chains: Steiner-based Approximation Algorithms. / Khebbache, Selma; Hadji, Makhlouf; Zeghlache, Djamal.
43rd IEEE Conference on Local Computer Networks, LCN 2018. IEEE Computer Society, 2018. p. 307-310 8638044 (Proceedings - Conference on Local Computer Networks, LCN; Vol. 2018-October).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dynamic Placement of Extended Service Function Chains

T2 - 43rd IEEE Conference on Local Computer Networks, LCN 2018

AU - Khebbache, Selma

AU - Hadji, Makhlouf

AU - Zeghlache, Djamal

PY - 2018/7/2

Y1 - 2018/7/2

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85062874530

U2 - 10.1109/LCN.2018.8638044

DO - 10.1109/LCN.2018.8638044

M3 - Conference contribution

AN - SCOPUS:85062874530

T3 - Proceedings - Conference on Local Computer Networks, LCN

SP - 307

EP - 310

BT - 43rd IEEE Conference on Local Computer Networks, LCN 2018

PB - IEEE Computer Society

Y2 - 1 October 2018 through 4 October 2018

ER -

Dynamic Placement of Extended Service Function Chains: Steiner-based Approximation Algorithms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this