Loading…
CoDeC: A Cost-Effective and Delay-Aware SFC Deployment
Service Function Chain (SFC) provides an end-to-end service by processing traffic flow through a series of Virtual Network Functions (VNFs) in a specific order. Satisfying user's demands (e.g., end-to-end delay) on one hand and minimizing the cost of SFC deployment in terms of energy and resour...
Saved in:
Published in: | IEEE eTransactions on network and service management 2020-06, Vol.17 (2), p.793-806 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c293t-a635dbb8e278b3aaeed2714049b9e7d9a563f9864f63d26d635f8aee3b4a10f23 |
---|---|
cites | cdi_FETCH-LOGICAL-c293t-a635dbb8e278b3aaeed2714049b9e7d9a563f9864f63d26d635f8aee3b4a10f23 |
container_end_page | 806 |
container_issue | 2 |
container_start_page | 793 |
container_title | IEEE eTransactions on network and service management |
container_volume | 17 |
creator | Tashtarian, Farzad Zhani, Mohamed Faten Fatemipour, Bita Yazdani, Delaram |
description | Service Function Chain (SFC) provides an end-to-end service by processing traffic flow through a series of Virtual Network Functions (VNFs) in a specific order. Satisfying user's demands (e.g., end-to-end delay) on one hand and minimizing the cost of SFC deployment in terms of energy and resource on the other hand, introduces VNFs placement as a crucial issue that is receiving significant attention by researchers. To address this problem and boost the performance of SFC, different techniques such as Network Function (NF) distribution, NF parallelism and optimal resource allocation have been utilized. Applying these mechanisms imposes other costs which must be taken into account by network providers. In this paper, we introduce CoDeC as a Cost-effective and Delay-aware resource allocation approach. By having user defined end-to-end threshold and using aforementioned mechanisms, CoDeC tries to place the requested VNFs with the minimum cost of deployment, distribution, parallelism and energy. Therefore, we formulate the addressed problem in form of Mixed Integer linear Programming (MILP) model. We then show that the problem is NP-complete and suffers from high time complexity in large-scale scenarios. Thus, a heuristic algorithm is introduced to determine a near-optimal solution in a reasonable amount of time. Our simulation results show that CoDeC achieves better performance in term of cost and acceptance rate compared to using each mechanism individually. |
doi_str_mv | 10.1109/TNSM.2019.2949753 |
format | article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_proquest_journals_2412217129</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8884113</ieee_id><sourcerecordid>2412217129</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-a635dbb8e278b3aaeed2714049b9e7d9a563f9864f63d26d635f8aee3b4a10f23</originalsourceid><addsrcrecordid>eNpNkMFKw0AQhhdRsEYfQLwEPCfu7G6SXW8hbVWoemg9L5tmFlrSpO6mlry9CS3iaWbg--eHj5B7oDEAVU-rj-V7zCiomCmhsoRfkAkoziKR8Ozy335NbrzfUppIUGxC0qKdYvEc5mHR-i6aWYvrbvODoWmqcIq16aP8aByGy3kx3Pu67XfYdLfkypra4915BuRrPlsVr9Hi8-WtyBfRmineRSblSVWWElkmS24MYsUyEFSoUmFWKZOk3CqZCpvyiqXVgFs5ULwUBqhlPCCPp797134f0Hd62x5cM1RqJoAxyGAoCgicqLVrvXdo9d5tdsb1Gqge9ehRjx716LOeIfNwymwQ8Y-XUgoAzn8BbzFejA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2412217129</pqid></control><display><type>article</type><title>CoDeC: A Cost-Effective and Delay-Aware SFC Deployment</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Tashtarian, Farzad ; Zhani, Mohamed Faten ; Fatemipour, Bita ; Yazdani, Delaram</creator><creatorcontrib>Tashtarian, Farzad ; Zhani, Mohamed Faten ; Fatemipour, Bita ; Yazdani, Delaram</creatorcontrib><description>Service Function Chain (SFC) provides an end-to-end service by processing traffic flow through a series of Virtual Network Functions (VNFs) in a specific order. Satisfying user's demands (e.g., end-to-end delay) on one hand and minimizing the cost of SFC deployment in terms of energy and resource on the other hand, introduces VNFs placement as a crucial issue that is receiving significant attention by researchers. To address this problem and boost the performance of SFC, different techniques such as Network Function (NF) distribution, NF parallelism and optimal resource allocation have been utilized. Applying these mechanisms imposes other costs which must be taken into account by network providers. In this paper, we introduce CoDeC as a Cost-effective and Delay-aware resource allocation approach. By having user defined end-to-end threshold and using aforementioned mechanisms, CoDeC tries to place the requested VNFs with the minimum cost of deployment, distribution, parallelism and energy. Therefore, we formulate the addressed problem in form of Mixed Integer linear Programming (MILP) model. We then show that the problem is NP-complete and suffers from high time complexity in large-scale scenarios. Thus, a heuristic algorithm is introduced to determine a near-optimal solution in a reasonable amount of time. Our simulation results show that CoDeC achieves better performance in term of cost and acceptance rate compared to using each mechanism individually.</description><identifier>ISSN: 1932-4537</identifier><identifier>EISSN: 1932-4537</identifier><identifier>DOI: 10.1109/TNSM.2019.2949753</identifier><identifier>CODEN: ITNSC4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Codec ; Codecs ; Computer simulation ; Delay ; Delays ; Energy distribution ; Heuristic methods ; Integer programming ; Linear programming ; Minimum cost ; Mirrors ; Mixed integer ; network function virtualization ; NF distribution ; NF parallelism ; Noise measurement ; Optimization ; Parallel processing ; Resource allocation ; Resource management ; SFC ; Traffic flow ; Virtual networks</subject><ispartof>IEEE eTransactions on network and service management, 2020-06, Vol.17 (2), p.793-806</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-a635dbb8e278b3aaeed2714049b9e7d9a563f9864f63d26d635f8aee3b4a10f23</citedby><cites>FETCH-LOGICAL-c293t-a635dbb8e278b3aaeed2714049b9e7d9a563f9864f63d26d635f8aee3b4a10f23</cites><orcidid>0000-0002-5584-6690 ; 0000-0001-8789-020X ; 0000-0001-9511-346X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8884113$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,54795</link.rule.ids></links><search><creatorcontrib>Tashtarian, Farzad</creatorcontrib><creatorcontrib>Zhani, Mohamed Faten</creatorcontrib><creatorcontrib>Fatemipour, Bita</creatorcontrib><creatorcontrib>Yazdani, Delaram</creatorcontrib><title>CoDeC: A Cost-Effective and Delay-Aware SFC Deployment</title><title>IEEE eTransactions on network and service management</title><addtitle>T-NSM</addtitle><description>Service Function Chain (SFC) provides an end-to-end service by processing traffic flow through a series of Virtual Network Functions (VNFs) in a specific order. Satisfying user's demands (e.g., end-to-end delay) on one hand and minimizing the cost of SFC deployment in terms of energy and resource on the other hand, introduces VNFs placement as a crucial issue that is receiving significant attention by researchers. To address this problem and boost the performance of SFC, different techniques such as Network Function (NF) distribution, NF parallelism and optimal resource allocation have been utilized. Applying these mechanisms imposes other costs which must be taken into account by network providers. In this paper, we introduce CoDeC as a Cost-effective and Delay-aware resource allocation approach. By having user defined end-to-end threshold and using aforementioned mechanisms, CoDeC tries to place the requested VNFs with the minimum cost of deployment, distribution, parallelism and energy. Therefore, we formulate the addressed problem in form of Mixed Integer linear Programming (MILP) model. We then show that the problem is NP-complete and suffers from high time complexity in large-scale scenarios. Thus, a heuristic algorithm is introduced to determine a near-optimal solution in a reasonable amount of time. Our simulation results show that CoDeC achieves better performance in term of cost and acceptance rate compared to using each mechanism individually.</description><subject>Algorithms</subject><subject>Codec</subject><subject>Codecs</subject><subject>Computer simulation</subject><subject>Delay</subject><subject>Delays</subject><subject>Energy distribution</subject><subject>Heuristic methods</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Minimum cost</subject><subject>Mirrors</subject><subject>Mixed integer</subject><subject>network function virtualization</subject><subject>NF distribution</subject><subject>NF parallelism</subject><subject>Noise measurement</subject><subject>Optimization</subject><subject>Parallel processing</subject><subject>Resource allocation</subject><subject>Resource management</subject><subject>SFC</subject><subject>Traffic flow</subject><subject>Virtual networks</subject><issn>1932-4537</issn><issn>1932-4537</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNpNkMFKw0AQhhdRsEYfQLwEPCfu7G6SXW8hbVWoemg9L5tmFlrSpO6mlry9CS3iaWbg--eHj5B7oDEAVU-rj-V7zCiomCmhsoRfkAkoziKR8Ozy335NbrzfUppIUGxC0qKdYvEc5mHR-i6aWYvrbvODoWmqcIq16aP8aByGy3kx3Pu67XfYdLfkypra4915BuRrPlsVr9Hi8-WtyBfRmineRSblSVWWElkmS24MYsUyEFSoUmFWKZOk3CqZCpvyiqXVgFs5ULwUBqhlPCCPp797134f0Hd62x5cM1RqJoAxyGAoCgicqLVrvXdo9d5tdsb1Gqge9ehRjx716LOeIfNwymwQ8Y-XUgoAzn8BbzFejA</recordid><startdate>202006</startdate><enddate>202006</enddate><creator>Tashtarian, Farzad</creator><creator>Zhani, Mohamed Faten</creator><creator>Fatemipour, Bita</creator><creator>Yazdani, Delaram</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><orcidid>https://orcid.org/0000-0002-5584-6690</orcidid><orcidid>https://orcid.org/0000-0001-8789-020X</orcidid><orcidid>https://orcid.org/0000-0001-9511-346X</orcidid></search><sort><creationdate>202006</creationdate><title>CoDeC: A Cost-Effective and Delay-Aware SFC Deployment</title><author>Tashtarian, Farzad ; Zhani, Mohamed Faten ; Fatemipour, Bita ; Yazdani, Delaram</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-a635dbb8e278b3aaeed2714049b9e7d9a563f9864f63d26d635f8aee3b4a10f23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Codec</topic><topic>Codecs</topic><topic>Computer simulation</topic><topic>Delay</topic><topic>Delays</topic><topic>Energy distribution</topic><topic>Heuristic methods</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Minimum cost</topic><topic>Mirrors</topic><topic>Mixed integer</topic><topic>network function virtualization</topic><topic>NF distribution</topic><topic>NF parallelism</topic><topic>Noise measurement</topic><topic>Optimization</topic><topic>Parallel processing</topic><topic>Resource allocation</topic><topic>Resource management</topic><topic>SFC</topic><topic>Traffic flow</topic><topic>Virtual networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tashtarian, Farzad</creatorcontrib><creatorcontrib>Zhani, Mohamed Faten</creatorcontrib><creatorcontrib>Fatemipour, Bita</creatorcontrib><creatorcontrib>Yazdani, Delaram</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><jtitle>IEEE eTransactions on network and service management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tashtarian, Farzad</au><au>Zhani, Mohamed Faten</au><au>Fatemipour, Bita</au><au>Yazdani, Delaram</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>CoDeC: A Cost-Effective and Delay-Aware SFC Deployment</atitle><jtitle>IEEE eTransactions on network and service management</jtitle><stitle>T-NSM</stitle><date>2020-06</date><risdate>2020</risdate><volume>17</volume><issue>2</issue><spage>793</spage><epage>806</epage><pages>793-806</pages><issn>1932-4537</issn><eissn>1932-4537</eissn><coden>ITNSC4</coden><abstract>Service Function Chain (SFC) provides an end-to-end service by processing traffic flow through a series of Virtual Network Functions (VNFs) in a specific order. Satisfying user's demands (e.g., end-to-end delay) on one hand and minimizing the cost of SFC deployment in terms of energy and resource on the other hand, introduces VNFs placement as a crucial issue that is receiving significant attention by researchers. To address this problem and boost the performance of SFC, different techniques such as Network Function (NF) distribution, NF parallelism and optimal resource allocation have been utilized. Applying these mechanisms imposes other costs which must be taken into account by network providers. In this paper, we introduce CoDeC as a Cost-effective and Delay-aware resource allocation approach. By having user defined end-to-end threshold and using aforementioned mechanisms, CoDeC tries to place the requested VNFs with the minimum cost of deployment, distribution, parallelism and energy. Therefore, we formulate the addressed problem in form of Mixed Integer linear Programming (MILP) model. We then show that the problem is NP-complete and suffers from high time complexity in large-scale scenarios. Thus, a heuristic algorithm is introduced to determine a near-optimal solution in a reasonable amount of time. Our simulation results show that CoDeC achieves better performance in term of cost and acceptance rate compared to using each mechanism individually.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNSM.2019.2949753</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-5584-6690</orcidid><orcidid>https://orcid.org/0000-0001-8789-020X</orcidid><orcidid>https://orcid.org/0000-0001-9511-346X</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1932-4537 |
ispartof | IEEE eTransactions on network and service management, 2020-06, Vol.17 (2), p.793-806 |
issn | 1932-4537 1932-4537 |
language | eng |
recordid | cdi_proquest_journals_2412217129 |
source | IEEE Electronic Library (IEL) Journals |
subjects | Algorithms Codec Codecs Computer simulation Delay Delays Energy distribution Heuristic methods Integer programming Linear programming Minimum cost Mirrors Mixed integer network function virtualization NF distribution NF parallelism Noise measurement Optimization Parallel processing Resource allocation Resource management SFC Traffic flow Virtual networks |
title | CoDeC: A Cost-Effective and Delay-Aware SFC Deployment |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T17%3A54%3A21IST&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=CoDeC:%20A%20Cost-Effective%20and%20Delay-Aware%20SFC%20Deployment&rft.jtitle=IEEE%20eTransactions%20on%20network%20and%20service%20management&rft.au=Tashtarian,%20Farzad&rft.date=2020-06&rft.volume=17&rft.issue=2&rft.spage=793&rft.epage=806&rft.pages=793-806&rft.issn=1932-4537&rft.eissn=1932-4537&rft.coden=ITNSC4&rft_id=info:doi/10.1109/TNSM.2019.2949753&rft_dat=%3Cproquest_ieee_%3E2412217129%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c293t-a635dbb8e278b3aaeed2714049b9e7d9a563f9864f63d26d635f8aee3b4a10f23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2412217129&rft_id=info:pmid/&rft_ieee_id=8884113&rfr_iscdi=true |