Context-Aware Service Function Chaining and Its Cost-Effective Orchestration in Multi-Domain Networks
The emergence of software-defined networking (SDN) and network function virtualization (NFV) facilitates policy-driven and dynamic service function chaining (SFC). In recent years, multi-domain SFC orchestration has attracted a significant attention, as it is a complicated problem involving many iss...
Gespeichert in:
Veröffentlicht in: | IEEE access 2018-01, Vol.6, p.34976-34991 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 34991 |
---|---|
container_issue | |
container_start_page | 34976 |
container_title | IEEE access |
container_volume | 6 |
creator | Li, Guanglei Zhou, Huachun Feng, Bohao Li, Guanwen |
description | The emergence of software-defined networking (SDN) and network function virtualization (NFV) facilitates policy-driven and dynamic service function chaining (SFC). In recent years, multi-domain SFC orchestration has attracted a significant attention, as it is a complicated problem involving many issues, such as corporation of various administrations and integration of heterogeneous underlying technologies. However, as another critical problem for multi-domain SFC deployment, how to achieve context-aware service provision is still not widely discussed. Thus, in this paper, based on the hierarchical SFC architecture, we allocate metadata to share context information of packets and realize context-based and dynamic SFC in multi-domain networks. We design typical use cases and conduct related experiments about location-aware flow steering and denial of service attack elimination. Experimental results confirm the feasibility and elasticity of our proposed approach. Furthermore, to alleviate the resource over-provisioning problem of context-aware SFC orchestration, we propose a consolidation-based SF placement and chaining algorithm with an online feedback mechanism. We compare the performance of our algorithm with a related greedy algorithm and a tabu search algorithm. Simulation results demonstrate that the proposed algorithm is efficient to reduce the reject rate and improve the revenue-cost ratio, with a compromise on node load balance. |
doi_str_mv | 10.1109/ACCESS.2018.2848266 |
format | Article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_8387764</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8387764</ieee_id><doaj_id>oai_doaj_org_article_40ad343307054816b2aa2afec84d1af2</doaj_id><sourcerecordid>2455862014</sourcerecordid><originalsourceid>FETCH-LOGICAL-c408t-80f54ad8d4faba85d0e9990c9f29d7f8e89f69cbee8fb253b96a05eccc104df3</originalsourceid><addsrcrecordid>eNpNUU1P3DAUjKpWKgJ-ARdLPWfr-COxj6t0aVeCclju1ov9DN4uMbW90P77GoJQfbE1npn3MU1z0dFV11H9dT2Om91uxWinVkwJxfr-Q3PCul63XPL-43_vz815zntaj6qQHE4aHONc8E9p18-QkOwwPQWL5PI42xLiTMZ7CHOY7wjMjmxLJmPMpd14j_X_CclNsveYS4JXdpjJ9fFQQvstPlQd-YnlOaZf-az55OGQ8fztPm1uLze344_26ub7dlxftVZQVVpFvRTglBMeJlDSUdRaU6s9027wCpX2vbYTovITk3zSPVCJ1tqOCuf5abNdbF2EvXlM4QHSXxMhmFcgpjsDqQR7QCMoOC44pwOVoi5jYgAM6lRKuA48q15fFq_HFH8f64hmH49prt0bJqRUfd23qCy-sGyKOSf071U7al7SMUs65iUd85ZOVV0sqoCI7wrF1TD0gv8Dw8iMew</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2455862014</pqid></control><display><type>article</type><title>Context-Aware Service Function Chaining and Its Cost-Effective Orchestration in Multi-Domain Networks</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Li, Guanglei ; Zhou, Huachun ; Feng, Bohao ; Li, Guanwen</creator><creatorcontrib>Li, Guanglei ; Zhou, Huachun ; Feng, Bohao ; Li, Guanwen</creatorcontrib><description>The emergence of software-defined networking (SDN) and network function virtualization (NFV) facilitates policy-driven and dynamic service function chaining (SFC). In recent years, multi-domain SFC orchestration has attracted a significant attention, as it is a complicated problem involving many issues, such as corporation of various administrations and integration of heterogeneous underlying technologies. However, as another critical problem for multi-domain SFC deployment, how to achieve context-aware service provision is still not widely discussed. Thus, in this paper, based on the hierarchical SFC architecture, we allocate metadata to share context information of packets and realize context-based and dynamic SFC in multi-domain networks. We design typical use cases and conduct related experiments about location-aware flow steering and denial of service attack elimination. Experimental results confirm the feasibility and elasticity of our proposed approach. Furthermore, to alleviate the resource over-provisioning problem of context-aware SFC orchestration, we propose a consolidation-based SF placement and chaining algorithm with an online feedback mechanism. We compare the performance of our algorithm with a related greedy algorithm and a tabu search algorithm. Simulation results demonstrate that the proposed algorithm is efficient to reduce the reject rate and improve the revenue-cost ratio, with a compromise on node load balance.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2018.2848266</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Chaining ; Context ; Context-aware ; Context-aware services ; Denial of service attacks ; Domains ; Greedy algorithms ; Metadata ; multi-domain networks ; Network function virtualization ; Protocols ; Provisioning ; Resource management ; Scalability ; Search algorithms ; Security ; SFC ; Software-defined networking ; Steering ; Tabu search</subject><ispartof>IEEE access, 2018-01, Vol.6, p.34976-34991</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c408t-80f54ad8d4faba85d0e9990c9f29d7f8e89f69cbee8fb253b96a05eccc104df3</citedby><cites>FETCH-LOGICAL-c408t-80f54ad8d4faba85d0e9990c9f29d7f8e89f69cbee8fb253b96a05eccc104df3</cites><orcidid>0000-0001-5064-2050 ; 0000-0003-3442-199X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8387764$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,860,2096,27610,27901,27902,54908</link.rule.ids></links><search><creatorcontrib>Li, Guanglei</creatorcontrib><creatorcontrib>Zhou, Huachun</creatorcontrib><creatorcontrib>Feng, Bohao</creatorcontrib><creatorcontrib>Li, Guanwen</creatorcontrib><title>Context-Aware Service Function Chaining and Its Cost-Effective Orchestration in Multi-Domain Networks</title><title>IEEE access</title><addtitle>Access</addtitle><description>The emergence of software-defined networking (SDN) and network function virtualization (NFV) facilitates policy-driven and dynamic service function chaining (SFC). In recent years, multi-domain SFC orchestration has attracted a significant attention, as it is a complicated problem involving many issues, such as corporation of various administrations and integration of heterogeneous underlying technologies. However, as another critical problem for multi-domain SFC deployment, how to achieve context-aware service provision is still not widely discussed. Thus, in this paper, based on the hierarchical SFC architecture, we allocate metadata to share context information of packets and realize context-based and dynamic SFC in multi-domain networks. We design typical use cases and conduct related experiments about location-aware flow steering and denial of service attack elimination. Experimental results confirm the feasibility and elasticity of our proposed approach. Furthermore, to alleviate the resource over-provisioning problem of context-aware SFC orchestration, we propose a consolidation-based SF placement and chaining algorithm with an online feedback mechanism. We compare the performance of our algorithm with a related greedy algorithm and a tabu search algorithm. Simulation results demonstrate that the proposed algorithm is efficient to reduce the reject rate and improve the revenue-cost ratio, with a compromise on node load balance.</description><subject>Algorithms</subject><subject>Chaining</subject><subject>Context</subject><subject>Context-aware</subject><subject>Context-aware services</subject><subject>Denial of service attacks</subject><subject>Domains</subject><subject>Greedy algorithms</subject><subject>Metadata</subject><subject>multi-domain networks</subject><subject>Network function virtualization</subject><subject>Protocols</subject><subject>Provisioning</subject><subject>Resource management</subject><subject>Scalability</subject><subject>Search algorithms</subject><subject>Security</subject><subject>SFC</subject><subject>Software-defined networking</subject><subject>Steering</subject><subject>Tabu search</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNUU1P3DAUjKpWKgJ-ARdLPWfr-COxj6t0aVeCclju1ov9DN4uMbW90P77GoJQfbE1npn3MU1z0dFV11H9dT2Om91uxWinVkwJxfr-Q3PCul63XPL-43_vz815zntaj6qQHE4aHONc8E9p18-QkOwwPQWL5PI42xLiTMZ7CHOY7wjMjmxLJmPMpd14j_X_CclNsveYS4JXdpjJ9fFQQvstPlQd-YnlOaZf-az55OGQ8fztPm1uLze344_26ub7dlxftVZQVVpFvRTglBMeJlDSUdRaU6s9027wCpX2vbYTovITk3zSPVCJ1tqOCuf5abNdbF2EvXlM4QHSXxMhmFcgpjsDqQR7QCMoOC44pwOVoi5jYgAM6lRKuA48q15fFq_HFH8f64hmH49prt0bJqRUfd23qCy-sGyKOSf071U7al7SMUs65iUd85ZOVV0sqoCI7wrF1TD0gv8Dw8iMew</recordid><startdate>20180101</startdate><enddate>20180101</enddate><creator>Li, Guanglei</creator><creator>Zhou, Huachun</creator><creator>Feng, Bohao</creator><creator>Li, Guanwen</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0001-5064-2050</orcidid><orcidid>https://orcid.org/0000-0003-3442-199X</orcidid></search><sort><creationdate>20180101</creationdate><title>Context-Aware Service Function Chaining and Its Cost-Effective Orchestration in Multi-Domain Networks</title><author>Li, Guanglei ; Zhou, Huachun ; Feng, Bohao ; Li, Guanwen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c408t-80f54ad8d4faba85d0e9990c9f29d7f8e89f69cbee8fb253b96a05eccc104df3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Chaining</topic><topic>Context</topic><topic>Context-aware</topic><topic>Context-aware services</topic><topic>Denial of service attacks</topic><topic>Domains</topic><topic>Greedy algorithms</topic><topic>Metadata</topic><topic>multi-domain networks</topic><topic>Network function virtualization</topic><topic>Protocols</topic><topic>Provisioning</topic><topic>Resource management</topic><topic>Scalability</topic><topic>Search algorithms</topic><topic>Security</topic><topic>SFC</topic><topic>Software-defined networking</topic><topic>Steering</topic><topic>Tabu search</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Guanglei</creatorcontrib><creatorcontrib>Zhou, Huachun</creatorcontrib><creatorcontrib>Feng, Bohao</creatorcontrib><creatorcontrib>Li, Guanwen</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Guanglei</au><au>Zhou, Huachun</au><au>Feng, Bohao</au><au>Li, Guanwen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Context-Aware Service Function Chaining and Its Cost-Effective Orchestration in Multi-Domain Networks</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2018-01-01</date><risdate>2018</risdate><volume>6</volume><spage>34976</spage><epage>34991</epage><pages>34976-34991</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>The emergence of software-defined networking (SDN) and network function virtualization (NFV) facilitates policy-driven and dynamic service function chaining (SFC). In recent years, multi-domain SFC orchestration has attracted a significant attention, as it is a complicated problem involving many issues, such as corporation of various administrations and integration of heterogeneous underlying technologies. However, as another critical problem for multi-domain SFC deployment, how to achieve context-aware service provision is still not widely discussed. Thus, in this paper, based on the hierarchical SFC architecture, we allocate metadata to share context information of packets and realize context-based and dynamic SFC in multi-domain networks. We design typical use cases and conduct related experiments about location-aware flow steering and denial of service attack elimination. Experimental results confirm the feasibility and elasticity of our proposed approach. Furthermore, to alleviate the resource over-provisioning problem of context-aware SFC orchestration, we propose a consolidation-based SF placement and chaining algorithm with an online feedback mechanism. We compare the performance of our algorithm with a related greedy algorithm and a tabu search algorithm. Simulation results demonstrate that the proposed algorithm is efficient to reduce the reject rate and improve the revenue-cost ratio, with a compromise on node load balance.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2018.2848266</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0001-5064-2050</orcidid><orcidid>https://orcid.org/0000-0003-3442-199X</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2169-3536 |
ispartof | IEEE access, 2018-01, Vol.6, p.34976-34991 |
issn | 2169-3536 2169-3536 |
language | eng |
recordid | cdi_ieee_primary_8387764 |
source | IEEE Open Access Journals; DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals |
subjects | Algorithms Chaining Context Context-aware Context-aware services Denial of service attacks Domains Greedy algorithms Metadata multi-domain networks Network function virtualization Protocols Provisioning Resource management Scalability Search algorithms Security SFC Software-defined networking Steering Tabu search |
title | Context-Aware Service Function Chaining and Its Cost-Effective Orchestration in Multi-Domain Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T12%3A08%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Context-Aware%20Service%20Function%20Chaining%20and%20Its%20Cost-Effective%20Orchestration%20in%20Multi-Domain%20Networks&rft.jtitle=IEEE%20access&rft.au=Li,%20Guanglei&rft.date=2018-01-01&rft.volume=6&rft.spage=34976&rft.epage=34991&rft.pages=34976-34991&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2018.2848266&rft_dat=%3Cproquest_ieee_%3E2455862014%3C/proquest_ieee_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2455862014&rft_id=info:pmid/&rft_ieee_id=8387764&rft_doaj_id=oai_doaj_org_article_40ad343307054816b2aa2afec84d1af2&rfr_iscdi=true |