Availability‐aware virtual network function placement based on multidimensional universal generating functions
Network function virtualization (NFV) implements network functions as software, which enables flexible, resource‐efficient, and rapid provision of network services. In NFV, network services are realized by the service function chain (SFC), which is a chain of virtual network functions (VNFs) linked...
Gespeichert in:
Veröffentlicht in: | International journal of network management 2024-03, Vol.34 (2), p.n/a |
---|---|
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 | n/a |
---|---|
container_issue | 2 |
container_start_page | |
container_title | International journal of network management |
container_volume | 34 |
creator | Arakawa, Kengo Oki, Eiji |
description | Network function virtualization (NFV) implements network functions as software, which enables flexible, resource‐efficient, and rapid provision of network services. In NFV, network services are realized by the service function chain (SFC), which is a chain of virtual network functions (VNFs) linked in the proper order. Both availability and deployment cost are key concerns for network operators providing network services as SFC. This paper proposes a flexible VNF placement model on a per‐VNF instance basis that minimizes deployment costs while satisfying availability requirements that may be placed on SFC. This paper uses a multidimensional universal generating function (MUGF) method, which is a multistate system analysis method, to compute the availability of a multistate SFC system with multiple VNFs coexisting on a server. The MUGF method calculates the performance of the entire SFC by combining the performance of servers as determined by applying a continuous‐time Markov chain. To reduce the time to compute the SFC availability, we introduce operators to be applied to MUGF and develop an availability computing method. In addition, a heuristic algorithm for determining VNF placement targeting the lowest deployment cost possible while meeting availability requirements is presented. Numerical results show that the proposed model obtains VNF placement with lower cost than the conventional model in all examined cases. The proposed model achieves VNF placement at 58.5%–75.0% of the deployment cost of the conventional model for the same SFC availability requirements.
We propose a virtual network function (VNF) placement model on a per‐VNF instance basis that considers the availability of the service function chain (SFC). We develop an availability computation method with reduced computation time using a multidimensional universal generating function. Our proposed model achieves VNF placement with lower deployment cost for the same SFC availability requirements than the conventional model. |
doi_str_mv | 10.1002/nem.2252 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2954640777</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2954640777</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2882-1f8f21392bf9d2ef29d37d6df19e9f482c89ce7bc351c3a4ef89200919a97f073</originalsourceid><addsrcrecordid>eNp10L1OwzAQB3ALgUQpSDxCJBaWFNtJ6nisqvIhFVhgthznXLmkTrCdVt14BJ6RJ8GhiI3pTqffnU5_hC4JnhCM6Y2FzYTSgh6hEcGcp4RwfDz0RZEykpen6Mz7NY6UcDZC3WwrTSMr05iw__r4lDvpINkaF3rZJBbCrnVvie6tCqa1SddIBRuwIamkhzqJo03fBFObOPRRxKXemi04H7sVWHAyGLv6u-DP0YmWjYeL3zpGr7eLl_l9uny-e5jPlqmiZUlToktNScZppXlNQVNeZ6ye1ppw4DovqSq5AlaprCAqkznoklOMOeGSM41ZNkZXh7uda9978EGs297F_7ygvMinOWZsUNcHpVzrvQMtOmc20u0FwWLIU8Q8xZBnpOmB7kwD-3-deFo8_vhvAZh6gA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2954640777</pqid></control><display><type>article</type><title>Availability‐aware virtual network function placement based on multidimensional universal generating functions</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Arakawa, Kengo ; Oki, Eiji</creator><creatorcontrib>Arakawa, Kengo ; Oki, Eiji</creatorcontrib><description>Network function virtualization (NFV) implements network functions as software, which enables flexible, resource‐efficient, and rapid provision of network services. In NFV, network services are realized by the service function chain (SFC), which is a chain of virtual network functions (VNFs) linked in the proper order. Both availability and deployment cost are key concerns for network operators providing network services as SFC. This paper proposes a flexible VNF placement model on a per‐VNF instance basis that minimizes deployment costs while satisfying availability requirements that may be placed on SFC. This paper uses a multidimensional universal generating function (MUGF) method, which is a multistate system analysis method, to compute the availability of a multistate SFC system with multiple VNFs coexisting on a server. The MUGF method calculates the performance of the entire SFC by combining the performance of servers as determined by applying a continuous‐time Markov chain. To reduce the time to compute the SFC availability, we introduce operators to be applied to MUGF and develop an availability computing method. In addition, a heuristic algorithm for determining VNF placement targeting the lowest deployment cost possible while meeting availability requirements is presented. Numerical results show that the proposed model obtains VNF placement with lower cost than the conventional model in all examined cases. The proposed model achieves VNF placement at 58.5%–75.0% of the deployment cost of the conventional model for the same SFC availability requirements.
We propose a virtual network function (VNF) placement model on a per‐VNF instance basis that considers the availability of the service function chain (SFC). We develop an availability computation method with reduced computation time using a multidimensional universal generating function. Our proposed model achieves VNF placement with lower deployment cost for the same SFC availability requirements than the conventional model.</description><identifier>ISSN: 1055-7148</identifier><identifier>EISSN: 1099-1190</identifier><identifier>DOI: 10.1002/nem.2252</identifier><language>eng</language><publisher>Chichester: Wiley Subscription Services, Inc</publisher><subject>Algorithms ; Availability ; Heuristic methods ; Markov chains ; Network function virtualization ; Operators (mathematics) ; Placement ; service function chain ; Systems analysis ; universal generating function ; virtual network function ; Virtual networks</subject><ispartof>International journal of network management, 2024-03, Vol.34 (2), p.n/a</ispartof><rights>2023 The Authors. published by John Wiley & Sons Ltd.</rights><rights>2023. This article is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c2882-1f8f21392bf9d2ef29d37d6df19e9f482c89ce7bc351c3a4ef89200919a97f073</cites><orcidid>0000-0003-2177-5027</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnem.2252$$EPDF$$P50$$Gwiley$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnem.2252$$EHTML$$P50$$Gwiley$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Arakawa, Kengo</creatorcontrib><creatorcontrib>Oki, Eiji</creatorcontrib><title>Availability‐aware virtual network function placement based on multidimensional universal generating functions</title><title>International journal of network management</title><description>Network function virtualization (NFV) implements network functions as software, which enables flexible, resource‐efficient, and rapid provision of network services. In NFV, network services are realized by the service function chain (SFC), which is a chain of virtual network functions (VNFs) linked in the proper order. Both availability and deployment cost are key concerns for network operators providing network services as SFC. This paper proposes a flexible VNF placement model on a per‐VNF instance basis that minimizes deployment costs while satisfying availability requirements that may be placed on SFC. This paper uses a multidimensional universal generating function (MUGF) method, which is a multistate system analysis method, to compute the availability of a multistate SFC system with multiple VNFs coexisting on a server. The MUGF method calculates the performance of the entire SFC by combining the performance of servers as determined by applying a continuous‐time Markov chain. To reduce the time to compute the SFC availability, we introduce operators to be applied to MUGF and develop an availability computing method. In addition, a heuristic algorithm for determining VNF placement targeting the lowest deployment cost possible while meeting availability requirements is presented. Numerical results show that the proposed model obtains VNF placement with lower cost than the conventional model in all examined cases. The proposed model achieves VNF placement at 58.5%–75.0% of the deployment cost of the conventional model for the same SFC availability requirements.
We propose a virtual network function (VNF) placement model on a per‐VNF instance basis that considers the availability of the service function chain (SFC). We develop an availability computation method with reduced computation time using a multidimensional universal generating function. Our proposed model achieves VNF placement with lower deployment cost for the same SFC availability requirements than the conventional model.</description><subject>Algorithms</subject><subject>Availability</subject><subject>Heuristic methods</subject><subject>Markov chains</subject><subject>Network function virtualization</subject><subject>Operators (mathematics)</subject><subject>Placement</subject><subject>service function chain</subject><subject>Systems analysis</subject><subject>universal generating function</subject><subject>virtual network function</subject><subject>Virtual networks</subject><issn>1055-7148</issn><issn>1099-1190</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>24P</sourceid><recordid>eNp10L1OwzAQB3ALgUQpSDxCJBaWFNtJ6nisqvIhFVhgthznXLmkTrCdVt14BJ6RJ8GhiI3pTqffnU5_hC4JnhCM6Y2FzYTSgh6hEcGcp4RwfDz0RZEykpen6Mz7NY6UcDZC3WwrTSMr05iw__r4lDvpINkaF3rZJBbCrnVvie6tCqa1SddIBRuwIamkhzqJo03fBFObOPRRxKXemi04H7sVWHAyGLv6u-DP0YmWjYeL3zpGr7eLl_l9uny-e5jPlqmiZUlToktNScZppXlNQVNeZ6ye1ppw4DovqSq5AlaprCAqkznoklOMOeGSM41ZNkZXh7uda9978EGs297F_7ygvMinOWZsUNcHpVzrvQMtOmc20u0FwWLIU8Q8xZBnpOmB7kwD-3-deFo8_vhvAZh6gA</recordid><startdate>202403</startdate><enddate>202403</enddate><creator>Arakawa, Kengo</creator><creator>Oki, Eiji</creator><general>Wiley Subscription Services, Inc</general><scope>24P</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-0003-2177-5027</orcidid></search><sort><creationdate>202403</creationdate><title>Availability‐aware virtual network function placement based on multidimensional universal generating functions</title><author>Arakawa, Kengo ; Oki, Eiji</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2882-1f8f21392bf9d2ef29d37d6df19e9f482c89ce7bc351c3a4ef89200919a97f073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Availability</topic><topic>Heuristic methods</topic><topic>Markov chains</topic><topic>Network function virtualization</topic><topic>Operators (mathematics)</topic><topic>Placement</topic><topic>service function chain</topic><topic>Systems analysis</topic><topic>universal generating function</topic><topic>virtual network function</topic><topic>Virtual networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Arakawa, Kengo</creatorcontrib><creatorcontrib>Oki, Eiji</creatorcontrib><collection>Wiley Online Library Open Access</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>International journal of network management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Arakawa, Kengo</au><au>Oki, Eiji</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Availability‐aware virtual network function placement based on multidimensional universal generating functions</atitle><jtitle>International journal of network management</jtitle><date>2024-03</date><risdate>2024</risdate><volume>34</volume><issue>2</issue><epage>n/a</epage><issn>1055-7148</issn><eissn>1099-1190</eissn><abstract>Network function virtualization (NFV) implements network functions as software, which enables flexible, resource‐efficient, and rapid provision of network services. In NFV, network services are realized by the service function chain (SFC), which is a chain of virtual network functions (VNFs) linked in the proper order. Both availability and deployment cost are key concerns for network operators providing network services as SFC. This paper proposes a flexible VNF placement model on a per‐VNF instance basis that minimizes deployment costs while satisfying availability requirements that may be placed on SFC. This paper uses a multidimensional universal generating function (MUGF) method, which is a multistate system analysis method, to compute the availability of a multistate SFC system with multiple VNFs coexisting on a server. The MUGF method calculates the performance of the entire SFC by combining the performance of servers as determined by applying a continuous‐time Markov chain. To reduce the time to compute the SFC availability, we introduce operators to be applied to MUGF and develop an availability computing method. In addition, a heuristic algorithm for determining VNF placement targeting the lowest deployment cost possible while meeting availability requirements is presented. Numerical results show that the proposed model obtains VNF placement with lower cost than the conventional model in all examined cases. The proposed model achieves VNF placement at 58.5%–75.0% of the deployment cost of the conventional model for the same SFC availability requirements.
We propose a virtual network function (VNF) placement model on a per‐VNF instance basis that considers the availability of the service function chain (SFC). We develop an availability computation method with reduced computation time using a multidimensional universal generating function. Our proposed model achieves VNF placement with lower deployment cost for the same SFC availability requirements than the conventional model.</abstract><cop>Chichester</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/nem.2252</doi><tpages>28</tpages><orcidid>https://orcid.org/0000-0003-2177-5027</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1055-7148 |
ispartof | International journal of network management, 2024-03, Vol.34 (2), p.n/a |
issn | 1055-7148 1099-1190 |
language | eng |
recordid | cdi_proquest_journals_2954640777 |
source | Wiley Online Library Journals Frontfile Complete |
subjects | Algorithms Availability Heuristic methods Markov chains Network function virtualization Operators (mathematics) Placement service function chain Systems analysis universal generating function virtual network function Virtual networks |
title | Availability‐aware virtual network function placement based on multidimensional universal generating functions |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T03%3A32%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Availability%E2%80%90aware%20virtual%20network%20function%20placement%20based%20on%20multidimensional%20universal%20generating%20functions&rft.jtitle=International%20journal%20of%20network%20management&rft.au=Arakawa,%20Kengo&rft.date=2024-03&rft.volume=34&rft.issue=2&rft.epage=n/a&rft.issn=1055-7148&rft.eissn=1099-1190&rft_id=info:doi/10.1002/nem.2252&rft_dat=%3Cproquest_cross%3E2954640777%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2954640777&rft_id=info:pmid/&rfr_iscdi=true |