Robust Online Composition, Routing and NF Placement for NFV-Enabled Services
Network function virtualization (NFV) fosters innovation in the networking field and reduces the complexity involved in managing modern-day conventional networks. Via NFV, the provisioning of a network service becomes more agile, whereby virtual network functions can be instantiated on commodity ser...
Gespeichert in:
Veröffentlicht in: | IEEE journal on selected areas in communications 2020-06, Vol.38 (6), p.1089-1101 |
---|---|
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 | 1101 |
---|---|
container_issue | 6 |
container_start_page | 1089 |
container_title | IEEE journal on selected areas in communications |
container_volume | 38 |
creator | Alhussein, Omar Zhuang, Weihua |
description | Network function virtualization (NFV) fosters innovation in the networking field and reduces the complexity involved in managing modern-day conventional networks. Via NFV, the provisioning of a network service becomes more agile, whereby virtual network functions can be instantiated on commodity servers and data centers on demand. Network functions can be either mandatory or best-effort. The former type is strictly necessary for the correctness of a network service, whereas the latter is preferrable yet not necessary. In this paper, we study the online provisioning of NFV-enabled network services. We consider both unicast and multicast NFV-enabled services with multiple mandatory and best-effort NF instances. We propose a primal-dual based online approximation algorithm that allocates both processing and transmission resources to maximize a profit function, subject to resource constraints on physical links and NFV nodes. The online algorithm resembles a joint admission mechanism and an online composition, routing and NF placement framework. The online algorithm is derived from an offline formulation through a primal-dual based analysis. Such analysis offers direct insights and a fundamental understanding on the nature of the profit-maximization problem for NFV-enabled services with multiple resource types. |
doi_str_mv | 10.1109/JSAC.2020.2986612 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2406700999</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9060929</ieee_id><sourcerecordid>2406700999</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-518706852c220c73aa5c5d6fd9e11528616fb18f292c2446b3eaa9453cb190de3</originalsourceid><addsrcrecordid>eNo9kF1LwzAUhoMoOKc_QLwJeGvnSdqkyeUomx8MJ5t6G9I0lY4umUkr7N_bseHVgcPzvufwIHRLYEIIyMfX9bSYUKAwoVJwTugZGhHGRAIA4hyNIE_TROSEX6KrGDcAJMsEHaHFypd97PDStY2zuPDbnY9N13j3gFe-7xr3jbWr8Nscv7fa2K11Ha59GBZfyczpsrUVXtvw2xgbr9FFrdtob05zjD7ns4_iOVksn16K6SIxVKZdwojIgQtGDaVg8lRrZljF60paQhgVnPC6JKKmciCyjJep1VpmLDUlkVDZdIzuj7274H96Gzu18X1ww0lFM-A5gJRyoMiRMsHHGGytdqHZ6rBXBNRBmjpIUwdp6iRtyNwdM4219p-XwEEOr_8BorVmMw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2406700999</pqid></control><display><type>article</type><title>Robust Online Composition, Routing and NF Placement for NFV-Enabled Services</title><source>IEEE Electronic Library (IEL)</source><creator>Alhussein, Omar ; Zhuang, Weihua</creator><creatorcontrib>Alhussein, Omar ; Zhuang, Weihua</creatorcontrib><description>Network function virtualization (NFV) fosters innovation in the networking field and reduces the complexity involved in managing modern-day conventional networks. Via NFV, the provisioning of a network service becomes more agile, whereby virtual network functions can be instantiated on commodity servers and data centers on demand. Network functions can be either mandatory or best-effort. The former type is strictly necessary for the correctness of a network service, whereas the latter is preferrable yet not necessary. In this paper, we study the online provisioning of NFV-enabled network services. We consider both unicast and multicast NFV-enabled services with multiple mandatory and best-effort NF instances. We propose a primal-dual based online approximation algorithm that allocates both processing and transmission resources to maximize a profit function, subject to resource constraints on physical links and NFV nodes. The online algorithm resembles a joint admission mechanism and an online composition, routing and NF placement framework. The online algorithm is derived from an offline formulation through a primal-dual based analysis. Such analysis offers direct insights and a fundamental understanding on the nature of the profit-maximization problem for NFV-enabled services with multiple resource types.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2020.2986612</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Approximation algorithms ; competitive analysis ; Composition ; Data centers ; Heuristic algorithms ; Multicast ; NFV ; Noise measurement ; online algorithms ; Placement ; primal-dual scheme ; profit maximization ; Provisioning ; Quality of service ; Routing ; Substrates ; Unicast ; Virtual networks</subject><ispartof>IEEE journal on selected areas in communications, 2020-06, Vol.38 (6), p.1089-1101</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-518706852c220c73aa5c5d6fd9e11528616fb18f292c2446b3eaa9453cb190de3</citedby><cites>FETCH-LOGICAL-c293t-518706852c220c73aa5c5d6fd9e11528616fb18f292c2446b3eaa9453cb190de3</cites><orcidid>0000-0002-1531-5916 ; 0000-0003-0488-511X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9060929$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9060929$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Alhussein, Omar</creatorcontrib><creatorcontrib>Zhuang, Weihua</creatorcontrib><title>Robust Online Composition, Routing and NF Placement for NFV-Enabled Services</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>Network function virtualization (NFV) fosters innovation in the networking field and reduces the complexity involved in managing modern-day conventional networks. Via NFV, the provisioning of a network service becomes more agile, whereby virtual network functions can be instantiated on commodity servers and data centers on demand. Network functions can be either mandatory or best-effort. The former type is strictly necessary for the correctness of a network service, whereas the latter is preferrable yet not necessary. In this paper, we study the online provisioning of NFV-enabled network services. We consider both unicast and multicast NFV-enabled services with multiple mandatory and best-effort NF instances. We propose a primal-dual based online approximation algorithm that allocates both processing and transmission resources to maximize a profit function, subject to resource constraints on physical links and NFV nodes. The online algorithm resembles a joint admission mechanism and an online composition, routing and NF placement framework. The online algorithm is derived from an offline formulation through a primal-dual based analysis. Such analysis offers direct insights and a fundamental understanding on the nature of the profit-maximization problem for NFV-enabled services with multiple resource types.</description><subject>Algorithms</subject><subject>Approximation algorithms</subject><subject>competitive analysis</subject><subject>Composition</subject><subject>Data centers</subject><subject>Heuristic algorithms</subject><subject>Multicast</subject><subject>NFV</subject><subject>Noise measurement</subject><subject>online algorithms</subject><subject>Placement</subject><subject>primal-dual scheme</subject><subject>profit maximization</subject><subject>Provisioning</subject><subject>Quality of service</subject><subject>Routing</subject><subject>Substrates</subject><subject>Unicast</subject><subject>Virtual networks</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kF1LwzAUhoMoOKc_QLwJeGvnSdqkyeUomx8MJ5t6G9I0lY4umUkr7N_bseHVgcPzvufwIHRLYEIIyMfX9bSYUKAwoVJwTugZGhHGRAIA4hyNIE_TROSEX6KrGDcAJMsEHaHFypd97PDStY2zuPDbnY9N13j3gFe-7xr3jbWr8Nscv7fa2K11Ha59GBZfyczpsrUVXtvw2xgbr9FFrdtob05zjD7ns4_iOVksn16K6SIxVKZdwojIgQtGDaVg8lRrZljF60paQhgVnPC6JKKmciCyjJep1VpmLDUlkVDZdIzuj7274H96Gzu18X1ww0lFM-A5gJRyoMiRMsHHGGytdqHZ6rBXBNRBmjpIUwdp6iRtyNwdM4219p-XwEEOr_8BorVmMw</recordid><startdate>20200601</startdate><enddate>20200601</enddate><creator>Alhussein, Omar</creator><creator>Zhuang, Weihua</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>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-1531-5916</orcidid><orcidid>https://orcid.org/0000-0003-0488-511X</orcidid></search><sort><creationdate>20200601</creationdate><title>Robust Online Composition, Routing and NF Placement for NFV-Enabled Services</title><author>Alhussein, Omar ; Zhuang, Weihua</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-518706852c220c73aa5c5d6fd9e11528616fb18f292c2446b3eaa9453cb190de3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Approximation algorithms</topic><topic>competitive analysis</topic><topic>Composition</topic><topic>Data centers</topic><topic>Heuristic algorithms</topic><topic>Multicast</topic><topic>NFV</topic><topic>Noise measurement</topic><topic>online algorithms</topic><topic>Placement</topic><topic>primal-dual scheme</topic><topic>profit maximization</topic><topic>Provisioning</topic><topic>Quality of service</topic><topic>Routing</topic><topic>Substrates</topic><topic>Unicast</topic><topic>Virtual networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Alhussein, Omar</creatorcontrib><creatorcontrib>Zhuang, Weihua</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>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Alhussein, Omar</au><au>Zhuang, Weihua</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robust Online Composition, Routing and NF Placement for NFV-Enabled Services</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2020-06-01</date><risdate>2020</risdate><volume>38</volume><issue>6</issue><spage>1089</spage><epage>1101</epage><pages>1089-1101</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>Network function virtualization (NFV) fosters innovation in the networking field and reduces the complexity involved in managing modern-day conventional networks. Via NFV, the provisioning of a network service becomes more agile, whereby virtual network functions can be instantiated on commodity servers and data centers on demand. Network functions can be either mandatory or best-effort. The former type is strictly necessary for the correctness of a network service, whereas the latter is preferrable yet not necessary. In this paper, we study the online provisioning of NFV-enabled network services. We consider both unicast and multicast NFV-enabled services with multiple mandatory and best-effort NF instances. We propose a primal-dual based online approximation algorithm that allocates both processing and transmission resources to maximize a profit function, subject to resource constraints on physical links and NFV nodes. The online algorithm resembles a joint admission mechanism and an online composition, routing and NF placement framework. The online algorithm is derived from an offline formulation through a primal-dual based analysis. Such analysis offers direct insights and a fundamental understanding on the nature of the profit-maximization problem for NFV-enabled services with multiple resource types.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2020.2986612</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-1531-5916</orcidid><orcidid>https://orcid.org/0000-0003-0488-511X</orcidid></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0733-8716 |
ispartof | IEEE journal on selected areas in communications, 2020-06, Vol.38 (6), p.1089-1101 |
issn | 0733-8716 1558-0008 |
language | eng |
recordid | cdi_proquest_journals_2406700999 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithms Approximation algorithms competitive analysis Composition Data centers Heuristic algorithms Multicast NFV Noise measurement online algorithms Placement primal-dual scheme profit maximization Provisioning Quality of service Routing Substrates Unicast Virtual networks |
title | Robust Online Composition, Routing and NF Placement for NFV-Enabled Services |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T20%3A18%3A14IST&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=Robust%20Online%20Composition,%20Routing%20and%20NF%20Placement%20for%20NFV-Enabled%20Services&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Alhussein,%20Omar&rft.date=2020-06-01&rft.volume=38&rft.issue=6&rft.spage=1089&rft.epage=1101&rft.pages=1089-1101&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2020.2986612&rft_dat=%3Cproquest_RIE%3E2406700999%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=2406700999&rft_id=info:pmid/&rft_ieee_id=9060929&rfr_iscdi=true |