A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains

Network Service Providers (NSPs) envisage to support the divergent and stringent requirements of future services by instantiating these services as service chains, commonly referred to as Service Function Chains (SFCs), that are customized and configured to meet specific service requirements. Howeve...

Descripción completa

Detalles Bibliográficos
Autores: Kibalya, Godfrey Mirondo|||0000-0002-7053-3756, Serrat Fernández, Juan|||0000-0002-4551-9880, Gorricho Moreno, Juan Luis|||0000-0002-6280-1546, Gift Bujjingo, Doreen, Serugunda, Jonathan
Tipo de recurso: artículo
Fecha de publicación:2021
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/359414
Acceso en línea:https://hdl.handle.net/2117/359414
https://dx.doi.org/10.1109/ACCESS.2021.3104841
Access Level:acceso abierto
Palabra clave:Computer network architectures
Service function chaining
Distributed algorithm
Multi-domain embedding
Network function virtualization.
Ordinadors, Xarxes d'
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
id ES_d1a69064f0b3d7500a67d02111a7aec3
oai_identifier_str oai:upcommons.upc.edu:2117/359414
network_acronym_str ES
network_name_str España
repository_id_str
spelling A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domainsKibalya, Godfrey Mirondo|||0000-0002-7053-3756Serrat Fernández, Juan|||0000-0002-4551-9880Gorricho Moreno, Juan Luis|||0000-0002-6280-1546Gift Bujjingo, DoreenSerugunda, JonathanComputer network architecturesService function chainingDistributed algorithmMulti-domain embeddingNetwork function virtualization.Ordinadors, Xarxes d'Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadorsNetwork Service Providers (NSPs) envisage to support the divergent and stringent requirements of future services by instantiating these services as service chains, commonly referred to as Service Function Chains (SFCs), that are customized and configured to meet specific service requirements. However, due to the limited footprint of the Infrastructure Providers (InPs), these SFCs may have to transcend multiple InPs/domains. In this regard, determining the optimal set of InPs in which to embed the SFC request emerges as a complex problem for several reasons. First, the large number of possible combinations for selecting the InPs to embed the different sub-chains of the request makes this problem computationally complex, rendering optimal solutions only after long computations, especially in large scale networks, which is unfeasible for delay sensitive applications. Second, the unwillingness of InPs to disclose their internal information, which may be vital for making embedding decisions, usually implies the provisioning of single-domain solutions, which are unsuitable in this working scenario. In this regard, this paper first formulates the multi-domain service deployment problem under multiple request constraints, such as bandwidth or delay, among others. Then, due to the NP-hardness nature of the above problem, this paper proposes an algorithm that is aided by a multi-stage graph for computing a request embedding solution in a distributed manner, solving the problem in acceptable run-times. Results from different simulations reveal that the proposed algorithm is optimized in terms of acceptance ratio and embedding cost, with up to 60.0% and 88.7% improvements in terms of embedding cost and execution time, respectively, for some scenarios, in comparison with a benchmark state-of-the-art algorithm.Institute of Electrical and Electronics Engineers (IEEE)20212021-08-1620222022-01-12journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/359414https://dx.doi.org/10.1109/ACCESS.2021.3104841reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)InglésengMinisterio de Economía y Competitividad http://doi.org/10.13039/501100003329 TEC2015-71329-C2-2-R APROVISIONAMIENTO DINAMICO DE CONECTIVIDAD EN ESCENARIOS INALAMBRICOS 5G DE ALTA DENSIDADEuropean Commission http://doi.org/10.13039/100010661 Horizon 2020 Framework Programme 777067 Novel Enablers for Cloud Slicingopen accesshttp://purl.org/coar/access_right/c_abf2Attribution 3.0 Spainhttp://creativecommons.org/licenses/by/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/3594142026-05-27T15:37:01Z
dc.title.none.fl_str_mv A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains
title A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains
spellingShingle A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains
Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
Computer network architectures
Service function chaining
Distributed algorithm
Multi-domain embedding
Network function virtualization.
Ordinadors, Xarxes d'
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
title_short A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains
title_full A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains
title_fullStr A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains
title_full_unstemmed A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains
title_sort A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains
dc.creator.none.fl_str_mv Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
Serrat Fernández, Juan|||0000-0002-4551-9880
Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
Gift Bujjingo, Doreen
Serugunda, Jonathan
author Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
author_facet Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
Serrat Fernández, Juan|||0000-0002-4551-9880
Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
Gift Bujjingo, Doreen
Serugunda, Jonathan
author_role author
author2 Serrat Fernández, Juan|||0000-0002-4551-9880
Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
Gift Bujjingo, Doreen
Serugunda, Jonathan
author2_role author
author
author
author
dc.subject.none.fl_str_mv Computer network architectures
Service function chaining
Distributed algorithm
Multi-domain embedding
Network function virtualization.
Ordinadors, Xarxes d'
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
topic Computer network architectures
Service function chaining
Distributed algorithm
Multi-domain embedding
Network function virtualization.
Ordinadors, Xarxes d'
Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
description Network Service Providers (NSPs) envisage to support the divergent and stringent requirements of future services by instantiating these services as service chains, commonly referred to as Service Function Chains (SFCs), that are customized and configured to meet specific service requirements. However, due to the limited footprint of the Infrastructure Providers (InPs), these SFCs may have to transcend multiple InPs/domains. In this regard, determining the optimal set of InPs in which to embed the SFC request emerges as a complex problem for several reasons. First, the large number of possible combinations for selecting the InPs to embed the different sub-chains of the request makes this problem computationally complex, rendering optimal solutions only after long computations, especially in large scale networks, which is unfeasible for delay sensitive applications. Second, the unwillingness of InPs to disclose their internal information, which may be vital for making embedding decisions, usually implies the provisioning of single-domain solutions, which are unsuitable in this working scenario. In this regard, this paper first formulates the multi-domain service deployment problem under multiple request constraints, such as bandwidth or delay, among others. Then, due to the NP-hardness nature of the above problem, this paper proposes an algorithm that is aided by a multi-stage graph for computing a request embedding solution in a distributed manner, solving the problem in acceptable run-times. Results from different simulations reveal that the proposed algorithm is optimized in terms of acceptance ratio and embedding cost, with up to 60.0% and 88.7% improvements in terms of embedding cost and execution time, respectively, for some scenarios, in comparison with a benchmark state-of-the-art algorithm.
publishDate 2021
dc.date.none.fl_str_mv 2021
2021-08-16
2022
2022-01-12
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/359414
https://dx.doi.org/10.1109/ACCESS.2021.3104841
url https://hdl.handle.net/2117/359414
https://dx.doi.org/10.1109/ACCESS.2021.3104841
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Economía y Competitividad http://doi.org/10.13039/501100003329 TEC2015-71329-C2-2-R APROVISIONAMIENTO DINAMICO DE CONECTIVIDAD EN ESCENARIOS INALAMBRICOS 5G DE ALTA DENSIDAD
European Commission http://doi.org/10.13039/100010661 Horizon 2020 Framework Programme 777067 Novel Enablers for Cloud Slicing
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution 3.0 Spain
http://creativecommons.org/licenses/by/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution 3.0 Spain
http://creativecommons.org/licenses/by/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers (IEEE)
publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers (IEEE)
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869420282116046848
score 15,300719

Similares en LA Referencia