Dynamic Controller/Switch Mapping: A Service Oriented Assignment Approach
With the capability of decoupling the control plane and the data plane of networks, Software-Defined Network (SDN) enables flexible and efficient implementations in networks. In addition, Network Function Virtualization (NFV) with Virtual Network Function (VNF) service chain capabilities provides hi...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on parallel and distributed systems 2022, Vol.33 (10), p.2482-2495 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2495 |
|---|---|
| container_issue | 10 |
| container_start_page | 2482 |
| container_title | IEEE transactions on parallel and distributed systems |
| container_volume | 33 |
| creator | Pham, Chuan Nguyen, Duong Tuan Tran, Nguyen H. Nguyen, Kim Khoa Cheriet, Mohamed |
| description | With the capability of decoupling the control plane and the data plane of networks, Software-Defined Network (SDN) enables flexible and efficient implementations in networks. In addition, Network Function Virtualization (NFV) with Virtual Network Function (VNF) service chain capabilities provides high-performance networks with greater scalability, elasticity, and adaptability. Such an elastic deployment of service chains results in different Service Level Agreements (SLA) and resource requirements on the control plane. In this work, we illustrate the impact of service chains on the control plane and formulate the dynamic controller/switch mapping (DCSM) problem in NFV networks in order to reduce the operational cost. We address the combinatorial optimization problem, DCSM, by designing a novel mechanism to relax DCSM into a tractable problem based on the Penalty Successive Upper Bound Minimization (PSUM) method. In doing so, we conduct several simulation scenarios to evaluate the performance. The experimental results show that our proposed algorithms can achieve a near-optimal result and reduce the operational cost up to 31.7% and 28.3% compared to K-Mean and the matching game-based approaches, respectively. |
| doi_str_mv | 10.1109/TPDS.2022.3144116 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TPDS_2022_3144116</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9690940</ieee_id><sourcerecordid>2647423698</sourcerecordid><originalsourceid>FETCH-LOGICAL-c288t-cb227b2dc93ceff7f7aa9daef2ae60988635399e87b05d8c9f2bcf2b932c35fa3</originalsourceid><addsrcrecordid>eNo9kN1LwzAUxYMoOKd_gPhS8LlbvtomvpXNj8FkwuZzSNObLWNra9Ip--_NmPhwuffAOffAD6F7gkeEYDlefUyXI4opHTHCOSH5BRqQLBMpJYJdxhvzLJWUyGt0E8IWY8IzzAdoNj02eu9MMmmb3re7Hfjx8sf1ZpO8665zzfopKZMl-G9nIFl4B00PdVKG4NbNPoqk7DrfarO5RVdW7wLc_e0h-nx5Xk3e0vnidTYp56mhQvSpqSgtKlobyQxYW9hCa1lrsFRDjqUQOcuYlCCKCme1MNLSysSRjBqWWc2G6PH8N9Z-HSD0atsefBMrFc15wSnLpYgucnYZ34bgwarOu732R0WwOhFTJ2LqREz9EYuZh3PGAcC_X-YSS47ZLzkyZ88</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2647423698</pqid></control><display><type>article</type><title>Dynamic Controller/Switch Mapping: A Service Oriented Assignment Approach</title><source>IEEE Electronic Library (IEL)</source><creator>Pham, Chuan ; Nguyen, Duong Tuan ; Tran, Nguyen H. ; Nguyen, Kim Khoa ; Cheriet, Mohamed</creator><creatorcontrib>Pham, Chuan ; Nguyen, Duong Tuan ; Tran, Nguyen H. ; Nguyen, Kim Khoa ; Cheriet, Mohamed</creatorcontrib><description>With the capability of decoupling the control plane and the data plane of networks, Software-Defined Network (SDN) enables flexible and efficient implementations in networks. In addition, Network Function Virtualization (NFV) with Virtual Network Function (VNF) service chain capabilities provides high-performance networks with greater scalability, elasticity, and adaptability. Such an elastic deployment of service chains results in different Service Level Agreements (SLA) and resource requirements on the control plane. In this work, we illustrate the impact of service chains on the control plane and formulate the dynamic controller/switch mapping (DCSM) problem in NFV networks in order to reduce the operational cost. We address the combinatorial optimization problem, DCSM, by designing a novel mechanism to relax DCSM into a tractable problem based on the Penalty Successive Upper Bound Minimization (PSUM) method. In doing so, we conduct several simulation scenarios to evaluate the performance. The experimental results show that our proposed algorithms can achieve a near-optimal result and reduce the operational cost up to 31.7% and 28.3% compared to K-Mean and the matching game-based approaches, respectively.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/TPDS.2022.3144116</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Chains ; Combinatorial analysis ; Control systems ; Controllers ; Costs ; Decoupling ; Mapping ; network function virtualization ; Operating costs ; Optimization ; Performance evaluation ; Process control ; Reliability ; Resilience ; Routing ; service chain ; Software-defined network ; Software-defined networking ; Upper bounds ; Virtual networks</subject><ispartof>IEEE transactions on parallel and distributed systems, 2022, Vol.33 (10), p.2482-2495</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c288t-cb227b2dc93ceff7f7aa9daef2ae60988635399e87b05d8c9f2bcf2b932c35fa3</cites><orcidid>0000-0002-9354-7544 ; 0000-0002-5246-7265 ; 0000-0001-7323-9213 ; 0000-0003-1430-3443 ; 0000-0001-9048-4608</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9690940$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,4024,27923,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9690940$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Pham, Chuan</creatorcontrib><creatorcontrib>Nguyen, Duong Tuan</creatorcontrib><creatorcontrib>Tran, Nguyen H.</creatorcontrib><creatorcontrib>Nguyen, Kim Khoa</creatorcontrib><creatorcontrib>Cheriet, Mohamed</creatorcontrib><title>Dynamic Controller/Switch Mapping: A Service Oriented Assignment Approach</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>With the capability of decoupling the control plane and the data plane of networks, Software-Defined Network (SDN) enables flexible and efficient implementations in networks. In addition, Network Function Virtualization (NFV) with Virtual Network Function (VNF) service chain capabilities provides high-performance networks with greater scalability, elasticity, and adaptability. Such an elastic deployment of service chains results in different Service Level Agreements (SLA) and resource requirements on the control plane. In this work, we illustrate the impact of service chains on the control plane and formulate the dynamic controller/switch mapping (DCSM) problem in NFV networks in order to reduce the operational cost. We address the combinatorial optimization problem, DCSM, by designing a novel mechanism to relax DCSM into a tractable problem based on the Penalty Successive Upper Bound Minimization (PSUM) method. In doing so, we conduct several simulation scenarios to evaluate the performance. The experimental results show that our proposed algorithms can achieve a near-optimal result and reduce the operational cost up to 31.7% and 28.3% compared to K-Mean and the matching game-based approaches, respectively.</description><subject>Algorithms</subject><subject>Chains</subject><subject>Combinatorial analysis</subject><subject>Control systems</subject><subject>Controllers</subject><subject>Costs</subject><subject>Decoupling</subject><subject>Mapping</subject><subject>network function virtualization</subject><subject>Operating costs</subject><subject>Optimization</subject><subject>Performance evaluation</subject><subject>Process control</subject><subject>Reliability</subject><subject>Resilience</subject><subject>Routing</subject><subject>service chain</subject><subject>Software-defined network</subject><subject>Software-defined networking</subject><subject>Upper bounds</subject><subject>Virtual networks</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kN1LwzAUxYMoOKd_gPhS8LlbvtomvpXNj8FkwuZzSNObLWNra9Ip--_NmPhwuffAOffAD6F7gkeEYDlefUyXI4opHTHCOSH5BRqQLBMpJYJdxhvzLJWUyGt0E8IWY8IzzAdoNj02eu9MMmmb3re7Hfjx8sf1ZpO8665zzfopKZMl-G9nIFl4B00PdVKG4NbNPoqk7DrfarO5RVdW7wLc_e0h-nx5Xk3e0vnidTYp56mhQvSpqSgtKlobyQxYW9hCa1lrsFRDjqUQOcuYlCCKCme1MNLSysSRjBqWWc2G6PH8N9Z-HSD0atsefBMrFc15wSnLpYgucnYZ34bgwarOu732R0WwOhFTJ2LqREz9EYuZh3PGAcC_X-YSS47ZLzkyZ88</recordid><startdate>2022</startdate><enddate>2022</enddate><creator>Pham, Chuan</creator><creator>Nguyen, Duong Tuan</creator><creator>Tran, Nguyen H.</creator><creator>Nguyen, Kim Khoa</creator><creator>Cheriet, Mohamed</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-9354-7544</orcidid><orcidid>https://orcid.org/0000-0002-5246-7265</orcidid><orcidid>https://orcid.org/0000-0001-7323-9213</orcidid><orcidid>https://orcid.org/0000-0003-1430-3443</orcidid><orcidid>https://orcid.org/0000-0001-9048-4608</orcidid></search><sort><creationdate>2022</creationdate><title>Dynamic Controller/Switch Mapping: A Service Oriented Assignment Approach</title><author>Pham, Chuan ; Nguyen, Duong Tuan ; Tran, Nguyen H. ; Nguyen, Kim Khoa ; Cheriet, Mohamed</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c288t-cb227b2dc93ceff7f7aa9daef2ae60988635399e87b05d8c9f2bcf2b932c35fa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Chains</topic><topic>Combinatorial analysis</topic><topic>Control systems</topic><topic>Controllers</topic><topic>Costs</topic><topic>Decoupling</topic><topic>Mapping</topic><topic>network function virtualization</topic><topic>Operating costs</topic><topic>Optimization</topic><topic>Performance evaluation</topic><topic>Process control</topic><topic>Reliability</topic><topic>Resilience</topic><topic>Routing</topic><topic>service chain</topic><topic>Software-defined network</topic><topic>Software-defined networking</topic><topic>Upper bounds</topic><topic>Virtual networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pham, Chuan</creatorcontrib><creatorcontrib>Nguyen, Duong Tuan</creatorcontrib><creatorcontrib>Tran, Nguyen H.</creatorcontrib><creatorcontrib>Nguyen, Kim Khoa</creatorcontrib><creatorcontrib>Cheriet, Mohamed</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</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>Technology 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><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pham, Chuan</au><au>Nguyen, Duong Tuan</au><au>Tran, Nguyen H.</au><au>Nguyen, Kim Khoa</au><au>Cheriet, Mohamed</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic Controller/Switch Mapping: A Service Oriented Assignment Approach</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>2022</date><risdate>2022</risdate><volume>33</volume><issue>10</issue><spage>2482</spage><epage>2495</epage><pages>2482-2495</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>With the capability of decoupling the control plane and the data plane of networks, Software-Defined Network (SDN) enables flexible and efficient implementations in networks. In addition, Network Function Virtualization (NFV) with Virtual Network Function (VNF) service chain capabilities provides high-performance networks with greater scalability, elasticity, and adaptability. Such an elastic deployment of service chains results in different Service Level Agreements (SLA) and resource requirements on the control plane. In this work, we illustrate the impact of service chains on the control plane and formulate the dynamic controller/switch mapping (DCSM) problem in NFV networks in order to reduce the operational cost. We address the combinatorial optimization problem, DCSM, by designing a novel mechanism to relax DCSM into a tractable problem based on the Penalty Successive Upper Bound Minimization (PSUM) method. In doing so, we conduct several simulation scenarios to evaluate the performance. The experimental results show that our proposed algorithms can achieve a near-optimal result and reduce the operational cost up to 31.7% and 28.3% compared to K-Mean and the matching game-based approaches, respectively.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPDS.2022.3144116</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-9354-7544</orcidid><orcidid>https://orcid.org/0000-0002-5246-7265</orcidid><orcidid>https://orcid.org/0000-0001-7323-9213</orcidid><orcidid>https://orcid.org/0000-0003-1430-3443</orcidid><orcidid>https://orcid.org/0000-0001-9048-4608</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1045-9219 |
| ispartof | IEEE transactions on parallel and distributed systems, 2022, Vol.33 (10), p.2482-2495 |
| issn | 1045-9219 1558-2183 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TPDS_2022_3144116 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Chains Combinatorial analysis Control systems Controllers Costs Decoupling Mapping network function virtualization Operating costs Optimization Performance evaluation Process control Reliability Resilience Routing service chain Software-defined network Software-defined networking Upper bounds Virtual networks |
| title | Dynamic Controller/Switch Mapping: A Service Oriented Assignment Approach |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T21%3A15%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dynamic%20Controller/Switch%20Mapping:%20A%20Service%20Oriented%20Assignment%20Approach&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Pham,%20Chuan&rft.date=2022&rft.volume=33&rft.issue=10&rft.spage=2482&rft.epage=2495&rft.pages=2482-2495&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/TPDS.2022.3144116&rft_dat=%3Cproquest_RIE%3E2647423698%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2647423698&rft_id=info:pmid/&rft_ieee_id=9690940&rfr_iscdi=true |