Cost-Aware Topological Decomposition of Virtual Network Function Forwarding Graphs

To realize a Network Service (NS) in a Network Function Virtualization (NFV) network, it is needed to form an ordered set of connected Virtual Network Functions (VNFs), commonly referred to as VNF Forwarding Graph (VNF-FG), and then embed it onto the substrate network. Forming a VNF-FG is a challeng...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE Global Communications Conference (Online) s. 5384 - 5390
Hlavní autori: Azhdari, Azadeh, Ebrahimzadeh, Amin, Afrasiabi, Seyedeh Negar, Szabo, Robert, Mouradian, Carla, Li, Wubin, Glitho, Roch. H.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 04.12.2023
Predmet:
Costs
Embedding Cost
Network function virtualization
Resource management
Simulation
Software
Software algorithms
Substrates
Virtual Network Function
VNF Decomposition
ISSN:2576-6813
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract To realize a Network Service (NS) in a Network Function Virtualization (NFV) network, it is needed to form an ordered set of connected Virtual Network Functions (VNFs), commonly referred to as VNF Forwarding Graph (VNF-FG), and then embed it onto the substrate network. Forming a VNF-FG is a challenging step of NFV resource allocation (NFV-RA), especially when the VNFs can be further decomposed into different sub-functions. In this paper, we propose a cost-aware algorithm to solve the problem of topological decomposition of VNF-FGs with the main objective of minimizing the embedding cost while satisfying the given service requirements. The simulation results indicate that our proposed algorithm outperforms the existing benchmark in terms of embedding cost, while being significantly scalable compared to the brute-force approach.
AbstractList To realize a Network Service (NS) in a Network Function Virtualization (NFV) network, it is needed to form an ordered set of connected Virtual Network Functions (VNFs), commonly referred to as VNF Forwarding Graph (VNF-FG), and then embed it onto the substrate network. Forming a VNF-FG is a challenging step of NFV resource allocation (NFV-RA), especially when the VNFs can be further decomposed into different sub-functions. In this paper, we propose a cost-aware algorithm to solve the problem of topological decomposition of VNF-FGs with the main objective of minimizing the embedding cost while satisfying the given service requirements. The simulation results indicate that our proposed algorithm outperforms the existing benchmark in terms of embedding cost, while being significantly scalable compared to the brute-force approach.
Author Li, Wubin
Glitho, Roch. H.
Azhdari, Azadeh
Mouradian, Carla
Szabo, Robert
Ebrahimzadeh, Amin
Afrasiabi, Seyedeh Negar
Author_xml – sequence: 1
  givenname: Azadeh
  surname: Azhdari
  fullname: Azhdari, Azadeh
  organization: CIISE, Concordia University,Montréal,QC,Canada
– sequence: 2
  givenname: Amin
  surname: Ebrahimzadeh
  fullname: Ebrahimzadeh, Amin
  organization: CIISE, Concordia University,Montréal,QC,Canada
– sequence: 3
  givenname: Seyedeh Negar
  surname: Afrasiabi
  fullname: Afrasiabi, Seyedeh Negar
  organization: CIISE, Concordia University,Montréal,QC,Canada
– sequence: 4
  givenname: Robert
  surname: Szabo
  fullname: Szabo, Robert
  organization: Ericsson Research,Budapest,Hungary
– sequence: 5
  givenname: Carla
  surname: Mouradian
  fullname: Mouradian, Carla
  organization: Ericsson Research,Montréal,QC,Canada
– sequence: 6
  givenname: Wubin
  surname: Li
  fullname: Li, Wubin
  organization: Ericsson Research,Montréal,QC,Canada
– sequence: 7
  givenname: Roch. H.
  surname: Glitho
  fullname: Glitho, Roch. H.
  organization: CIISE, Concordia University,Montréal,QC,Canada
BookMark eNo1kE1PhDAYhKvRxHXlH3gg8Qy-_YJyXHFBE5TErF43hbZrlaWksNn47yV-nCaZZ2YOc4nOetdrhG4wxBhDdltW9d06r584wwxiAoTGGBhNBRUnKMjSTFAOdE4CnKIF4WkSJQLTCxSM4wcAEI4pyWCBXnI3TtHqKL0ON25wndvZVnbhvW7dfnCjnazrQ2fCN-unwwye9XR0_jMsDn37wwrn57ay_S4svRzexyt0bmQ36uBPl-i1WG_yh6iqy8d8VUWWAJsiarhmkAjWtIwYkMBNRiXGkincGJGqtFGzkwDBmPOGCcUSoxrOdQptkxi6RNe_u1ZrvR283Uv_tf2_gX4DJIdVdg
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/GLOBECOM54140.2023.10437838
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9798350310900
EISSN 2576-6813
EndPage 5390
ExternalDocumentID 10437838
Genre orig-research
GroupedDBID 6IE
6IH
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i204t-3f5e40684bc42f0a05f93a11a4d1bf87d7bdf936021155b48d46fdb55e70cb6f3
IEDL.DBID RIE
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001178562005155&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:08:20 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i204t-3f5e40684bc42f0a05f93a11a4d1bf87d7bdf936021155b48d46fdb55e70cb6f3
PageCount 7
ParticipantIDs ieee_primary_10437838
PublicationCentury 2000
PublicationDate 2023-Dec.-4
PublicationDateYYYYMMDD 2023-12-04
PublicationDate_xml – month: 12
  year: 2023
  text: 2023-Dec.-4
  day: 04
PublicationDecade 2020
PublicationTitle IEEE Global Communications Conference (Online)
PublicationTitleAbbrev GLOBECOM
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002513290
Score 1.8603784
Snippet To realize a Network Service (NS) in a Network Function Virtualization (NFV) network, it is needed to form an ordered set of connected Virtual Network...
SourceID ieee
SourceType Publisher
StartPage 5384
SubjectTerms Costs
Embedding Cost
Network function virtualization
Resource management
Simulation
Software
Software algorithms
Substrates
Virtual Network Function
VNF Decomposition
Title Cost-Aware Topological Decomposition of Virtual Network Function Forwarding Graphs
URI https://ieeexplore.ieee.org/document/10437838
WOSCitedRecordID wos001178562005155&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB1sEdGLXxW_Ceg1dXeT3WSPWrv1UNsiVXorySaBXrqy3erfN0m3VQ8evIUEhpAhvCF5bx7ALdUsIomIMOE0xVSHMZYmV1hFMlKBCgXjXijcZ4MBn0zSUS1W91oYrbUnn-m2G_q_fFXkS_dUZm84JYwT3oAGY8lKrLV5ULFATaI02IGbuo_mXa8_fOh2hs_O6TpoO5_w9jrCLy8VDyXZ_j83cQCtb1EeGm3g5hC29PwI9n70EzyGl06xqPD9pyg1Gq_cD1wO0KN2zPGanoUKg95mpdONoMGKBI4yi25-LStKR6O10VDPtbJetOA16447T7g2TcCzKKAVJibWFqQ5lTmNTCCC2KREhKGgKpSGM8WksjOJxXZbSkjKFU2MknGsWZDLxJATaM6LuT4FxC2-GWnjmSS1dQYXFslSQdPEhjLckDNoueOZvq_6YkzXJ3P-x_wF7LokeDIIvYRmVS71FWznH9VsUV77bH4BBaOgoQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dT8MgFCU6jR8vfs34LYm-MttCW_qoc92MXbeYafa2QIFkL6vpOv37Au2mPvjgG4HkhnBDzg2ccw8At0SGHg6YhzAlESLS9RFXmUDC455whMtCaoXCSZimdDyOhrVY3WphpJSWfCZbZmj_8kWeLcxTmb7hBIcU03Ww4RPiOZVca_WkoqEae5GzBW7qTpp33WTw0GkP-sbr2mkZp_DWMsYvNxULJvHeP7exD5rfsjw4XAHOAViTs0Ow-6Oj4BF4aefzEt1_skLCUeV_YLIAH6XhjtcELZgr-DYtjHIEphUNHMYa3-xanBeGSKujwa5pZj1vgte4M2r3UG2bgKaeQ0qElS81TFPCM-Iphzm-ijBzXUaEyxUNRciFngk0uutighMqSKAE930ZOhkPFD4GjVk-kycAUo1wiut4Koh0pUGZxrKIkSjQoRRV-BQ0zfFM3qvOGJPlyZz9MX8NtnujfjJJntLnc7BjEmKpIeQCNMpiIS_BZvZRTufFlc3sF5Bto-g
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE+Global+Communications+Conference+%28Online%29&rft.atitle=Cost-Aware+Topological+Decomposition+of+Virtual+Network+Function+Forwarding+Graphs&rft.au=Azhdari%2C+Azadeh&rft.au=Ebrahimzadeh%2C+Amin&rft.au=Afrasiabi%2C+Seyedeh+Negar&rft.au=Szabo%2C+Robert&rft.date=2023-12-04&rft.pub=IEEE&rft.eissn=2576-6813&rft.spage=5384&rft.epage=5390&rft_id=info:doi/10.1109%2FGLOBECOM54140.2023.10437838&rft.externalDocID=10437838