Optimized Service Chain Mapping and reduced flow processing with Application-Awareness

Deepak Nadig, Byrav Ramamurthy, Brian Bockelman, David Swanson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Network Function Virtualization (NFV) brings a new set of challenges when deploying virtualized services on commercial-off-the-shelf (COTS) hardware. Network functions can be dynamically managed to provide the necessary services on-demand and further, services can be chained together to form a larger composite. In this paper, we address an important technical problem of mapping service function chains (SFCs) across different data centers with the objective of reducing the flow processing costs. We develop an integer linear programming (ILP) formulation to optimally map service function chains to multiple data centers while adhering to the data center's capacity constraints. We propose a novel application-aware flow reduction (AAFR) algorithm to simplify the SFC-ILP to significantly reduce the number of flows processed by the SFCs. We perform a thorough study of the SFC mapping problem for multiple data centers and evaluate the performance of our proposed approach with respect to three parameters: i) impact of number of SFCs and SFC length on flow processing cost, ii) capacitated/uncapacitated flow processing cost gains, and iii) balancing flow-to-SFC mappings across data centers. Our evaluations show that our proposed AAFR algorithm reduces flow-processing costs by 70% for the capacitated-SFC mapping case over the SFC-ILP. In addition, our uncapacitated AAFR (AAFR-U) algorithm provides a further 4.1% cost-gain over its capacitated counterpart (AAFR-C).

Original languageEnglish (US)
Title of host publication2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages500-505
Number of pages6
ISBN (Print)9781538646335
DOIs
StatePublished - Sep 10 2018
Event4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018 - Montreal, Canada
Duration: Jun 25 2018Jun 29 2018

Publication series

Name2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018

Other

Other4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018
CountryCanada
CityMontreal
Period6/25/186/29/18

Fingerprint

Processing
Linear programming
Costs
Chain length
Hardware
Composite materials

Keywords

  • Application-awareness
  • Network Functions Virtualization
  • Service Chaining
  • Software Defined Networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Nadig, D., Ramamurthy, B., Bockelman, B., & Swanson, D. (2018). Optimized Service Chain Mapping and reduced flow processing with Application-Awareness. In 2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018 (pp. 500-505). [8459912] (2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/NETSOFT.2018.8459912

Optimized Service Chain Mapping and reduced flow processing with Application-Awareness. / Nadig, Deepak; Ramamurthy, Byrav; Bockelman, Brian; Swanson, David.

2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 500-505 8459912 (2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nadig, D, Ramamurthy, B, Bockelman, B & Swanson, D 2018, Optimized Service Chain Mapping and reduced flow processing with Application-Awareness. in 2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018., 8459912, 2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018, Institute of Electrical and Electronics Engineers Inc., pp. 500-505, 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018, Montreal, Canada, 6/25/18. https://doi.org/10.1109/NETSOFT.2018.8459912
Nadig D, Ramamurthy B, Bockelman B, Swanson D. Optimized Service Chain Mapping and reduced flow processing with Application-Awareness. In 2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 500-505. 8459912. (2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018). https://doi.org/10.1109/NETSOFT.2018.8459912
Nadig, Deepak ; Ramamurthy, Byrav ; Bockelman, Brian ; Swanson, David. / Optimized Service Chain Mapping and reduced flow processing with Application-Awareness. 2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 500-505 (2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018).
@inproceedings{1667a69e0c254b31ae43959360ee9b45,
title = "Optimized Service Chain Mapping and reduced flow processing with Application-Awareness",
abstract = "Network Function Virtualization (NFV) brings a new set of challenges when deploying virtualized services on commercial-off-the-shelf (COTS) hardware. Network functions can be dynamically managed to provide the necessary services on-demand and further, services can be chained together to form a larger composite. In this paper, we address an important technical problem of mapping service function chains (SFCs) across different data centers with the objective of reducing the flow processing costs. We develop an integer linear programming (ILP) formulation to optimally map service function chains to multiple data centers while adhering to the data center's capacity constraints. We propose a novel application-aware flow reduction (AAFR) algorithm to simplify the SFC-ILP to significantly reduce the number of flows processed by the SFCs. We perform a thorough study of the SFC mapping problem for multiple data centers and evaluate the performance of our proposed approach with respect to three parameters: i) impact of number of SFCs and SFC length on flow processing cost, ii) capacitated/uncapacitated flow processing cost gains, and iii) balancing flow-to-SFC mappings across data centers. Our evaluations show that our proposed AAFR algorithm reduces flow-processing costs by 70{\%} for the capacitated-SFC mapping case over the SFC-ILP. In addition, our uncapacitated AAFR (AAFR-U) algorithm provides a further 4.1{\%} cost-gain over its capacitated counterpart (AAFR-C).",
keywords = "Application-awareness, Network Functions Virtualization, Service Chaining, Software Defined Networks",
author = "Deepak Nadig and Byrav Ramamurthy and Brian Bockelman and David Swanson",
year = "2018",
month = "9",
day = "10",
doi = "10.1109/NETSOFT.2018.8459912",
language = "English (US)",
isbn = "9781538646335",
series = "2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "500--505",
booktitle = "2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018",

}

TY - GEN

T1 - Optimized Service Chain Mapping and reduced flow processing with Application-Awareness

AU - Nadig, Deepak

AU - Ramamurthy, Byrav

AU - Bockelman, Brian

AU - Swanson, David

PY - 2018/9/10

Y1 - 2018/9/10

N2 - Network Function Virtualization (NFV) brings a new set of challenges when deploying virtualized services on commercial-off-the-shelf (COTS) hardware. Network functions can be dynamically managed to provide the necessary services on-demand and further, services can be chained together to form a larger composite. In this paper, we address an important technical problem of mapping service function chains (SFCs) across different data centers with the objective of reducing the flow processing costs. We develop an integer linear programming (ILP) formulation to optimally map service function chains to multiple data centers while adhering to the data center's capacity constraints. We propose a novel application-aware flow reduction (AAFR) algorithm to simplify the SFC-ILP to significantly reduce the number of flows processed by the SFCs. We perform a thorough study of the SFC mapping problem for multiple data centers and evaluate the performance of our proposed approach with respect to three parameters: i) impact of number of SFCs and SFC length on flow processing cost, ii) capacitated/uncapacitated flow processing cost gains, and iii) balancing flow-to-SFC mappings across data centers. Our evaluations show that our proposed AAFR algorithm reduces flow-processing costs by 70% for the capacitated-SFC mapping case over the SFC-ILP. In addition, our uncapacitated AAFR (AAFR-U) algorithm provides a further 4.1% cost-gain over its capacitated counterpart (AAFR-C).

AB - Network Function Virtualization (NFV) brings a new set of challenges when deploying virtualized services on commercial-off-the-shelf (COTS) hardware. Network functions can be dynamically managed to provide the necessary services on-demand and further, services can be chained together to form a larger composite. In this paper, we address an important technical problem of mapping service function chains (SFCs) across different data centers with the objective of reducing the flow processing costs. We develop an integer linear programming (ILP) formulation to optimally map service function chains to multiple data centers while adhering to the data center's capacity constraints. We propose a novel application-aware flow reduction (AAFR) algorithm to simplify the SFC-ILP to significantly reduce the number of flows processed by the SFCs. We perform a thorough study of the SFC mapping problem for multiple data centers and evaluate the performance of our proposed approach with respect to three parameters: i) impact of number of SFCs and SFC length on flow processing cost, ii) capacitated/uncapacitated flow processing cost gains, and iii) balancing flow-to-SFC mappings across data centers. Our evaluations show that our proposed AAFR algorithm reduces flow-processing costs by 70% for the capacitated-SFC mapping case over the SFC-ILP. In addition, our uncapacitated AAFR (AAFR-U) algorithm provides a further 4.1% cost-gain over its capacitated counterpart (AAFR-C).

KW - Application-awareness

KW - Network Functions Virtualization

KW - Service Chaining

KW - Software Defined Networks

UR - http://www.scopus.com/inward/record.url?scp=85054362197&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054362197&partnerID=8YFLogxK

U2 - 10.1109/NETSOFT.2018.8459912

DO - 10.1109/NETSOFT.2018.8459912

M3 - Conference contribution

AN - SCOPUS:85054362197

SN - 9781538646335

T3 - 2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018

SP - 500

EP - 505

BT - 2018 4th IEEE Conference on Network Softwarization and Workshops, NetSoft 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -