Utility and A-Based Algorithm for Network Slice Placement and Chaining

Next Generation Mobile Network, 5G, will leverage heavily on Network Function Virtualisation for flexible and cost efficient deployments. 5G technology is to provide numerous innovative business opportunities through a key concept known as Network Slicing. This approach will require efficient placem...

Full description

Saved in:
Bibliographic Details
Published inIEEE Global Communications Conference (Online) pp. 1 - 6
Main Authors Aklamanu, Fred, Randriamasy, Sabine, Renault, Eric
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2019
Subjects
Online AccessGet full text
ISSN2576-6813
DOI10.1109/GLOBECOM38437.2019.9013820

Cover

Abstract Next Generation Mobile Network, 5G, will leverage heavily on Network Function Virtualisation for flexible and cost efficient deployments. 5G technology is to provide numerous innovative business opportunities through a key concept known as Network Slicing. This approach will require efficient placement and chaining of virtual network functions (VNFs) composing a network slice. The goal is to maximize network resources availability with minimal cost as network infrastructure is shared among different network slices. This paper proposes a time and resource-efficient VNF placement and chaining method, UA*, a Utility-based placement algorithm that extends the A* algorithm node classification set. UA* considers slice performance requirements and policies. Our simulations evaluate UA* and compares its performance with state of the art approaches.
AbstractList Next Generation Mobile Network, 5G, will leverage heavily on Network Function Virtualisation for flexible and cost efficient deployments. 5G technology is to provide numerous innovative business opportunities through a key concept known as Network Slicing. This approach will require efficient placement and chaining of virtual network functions (VNFs) composing a network slice. The goal is to maximize network resources availability with minimal cost as network infrastructure is shared among different network slices. This paper proposes a time and resource-efficient VNF placement and chaining method, UA*, a Utility-based placement algorithm that extends the A* algorithm node classification set. UA* considers slice performance requirements and policies. Our simulations evaluate UA* and compares its performance with state of the art approaches.
Author Aklamanu, Fred
Renault, Eric
Randriamasy, Sabine
Author_xml – sequence: 1
  givenname: Fred
  surname: Aklamanu
  fullname: Aklamanu, Fred
  organization: Nokia Bell Labs and Telecom SudParis
– sequence: 2
  givenname: Sabine
  surname: Randriamasy
  fullname: Randriamasy, Sabine
  organization: Nokia Bell Labs
– sequence: 3
  givenname: Eric
  surname: Renault
  fullname: Renault, Eric
  organization: Telecom SudParis
BookMark eNotj8FOg0AURUejiW3tF7gh7sH3ZoZhWLakrSYoJtp1M8CbdpQOBkia_r1Euzqbc2_unbIb33pi7BEhQoT0aZMXy1VWvAotRRJxwDRKAYXmcMWmmHA9SorDNZvwOFGh0iju2LzvvwCAxyh4ChO23g6uccM5ML4OFuHS9DSy2bedGw7HwLZd8EbDqe2-g4_GVRS8N6aiI_nhL5EdjPPO7-_ZrTVNT_MLZ2y7Xn1mz2FebF6yRR46rtIhrEkKm8hSp4RiHMXL2IqqNFJXtZQIUgHxBC1SCVVVCxsDaq6wtmUNdnRn7OG_1xHR7qdzR9Odd5fb4heWik7m
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/GLOBECOM38437.2019.9013820
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://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1728109620
9781728109626
EISSN 2576-6813
EndPage 6
ExternalDocumentID 9013820
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-i269t-de43f74b89e135762b5f3cba48cd4410460e271f1eb0ccd3f5018261dfbd0f5f3
IEDL.DBID RIE
IngestDate Wed Aug 27 02:14:54 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i269t-de43f74b89e135762b5f3cba48cd4410460e271f1eb0ccd3f5018261dfbd0f5f3
PageCount 6
ParticipantIDs ieee_primary_9013820
PublicationCentury 2000
PublicationDate 2019-01-01
PublicationDateYYYYMMDD 2019-01-01
PublicationDate_xml – month: 01
  year: 2019
  text: 2019-01-01
  day: 01
PublicationDecade 2010
PublicationTitle IEEE Global Communications Conference (Online)
PublicationTitleAbbrev GLOCOM
PublicationYear 2019
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002513290
Score 1.7046907
Snippet Next Generation Mobile Network, 5G, will leverage heavily on Network Function Virtualisation for flexible and cost efficient deployments. 5G technology is to...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms 5G mobile communication
Bandwidth
Cloud computing
Computational modeling
Heuristic algorithms
Resource management
Servers
Title Utility and A-Based Algorithm for Network Slice Placement and Chaining
URI https://ieeexplore.ieee.org/document/9013820
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NT8IwFG-Qk178AON3evBoR7t23XoUAhIjYKIk3Ei7tkLAYcg46F9vuwF-xIOnNUvXNm2WX997v_d7AFxTbIkSmqGQR85AITxCSnOFiGYsctcDKYv06F6fd4fsfhSNKuBmmwtjjCnIZybwzSKWrxfpyrvKGsKH1UJnoO_ECS9ztbb-FIfTNBQbXVGCRePuYdBstwY9mjAaexKXCNYD_KikUgBJZx_0Nkso-SOzYJWrIP34pc743zUegPpXyh583ILRIaiY7AjsfVMbrIHOMPdE2HcoMw1vUdPhl3vOXxbLaT55he72CvslKRw-zad-PO9i99MVX7QmZTGJOhh22s-tLlqXUUDTkIscacOojZlKhCHUmRehiixNlWS-bhHzMV5swphYYhROU02t1_hzhpW2SmPr-h6DarbIzAmA7mfHiRYJl1iyWEslNbNSiYQxqhJFTkHN78j4rVTKGK834-zv1-dg159K6dC4ANV8uTKXDuJzdVWc7SeFcqS1
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NT8IwFH8heFAvfoDx2x08urGu3UePQkBUBiZCwo20awtEHIaMg_71thvgRzx42rJ0b02b5df33u_9HsA1dhXiVBDbC3ztoKDAt7kIuI0EIb4-HjCWl0fH3aA9IA9Df1iCm00tjJQyJ59Jx9zmuXwxT5YmVFajJq3maQd9yyfaVFGttYmoaKTGHl0riyKX1u46vXqz0YtxRHBoaFzUWZn40Uslh5LWHsTrSRQMkhdnmXEn-filz_jfWe5D9atoz3rawNEBlGR6CLvf9AYr0Bpkhgr7brFUWLd2XSOYvs7G88U0m7xa-vxqdQtauPU8mxp7JshuPpe_0ZgU7SSqMGg1-422vWqkYE-9gGa2kASrkPCISoS1g-FxX-GEM2I6FxGT5XWlFyKFJHeTRGBlVP60ayUUF67SY4-gnM5TeQyW_t3dSNAoYC4joWCcCaIYpxEhmEccnUDFrMjordDKGK0W4_Tvx1ew3e7HnVHnvvt4Bjtmh4rwxjmUs8VSXmjAz_hlvs-fVvCoAg
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%3Ajournal&rft.genre=proceeding&rft.title=IEEE+Global+Communications+Conference+%28Online%29&rft.atitle=Utility+and+A-Based+Algorithm+for+Network+Slice+Placement+and+Chaining&rft.au=Aklamanu%2C+Fred&rft.au=Randriamasy%2C+Sabine&rft.au=Renault%2C+Eric&rft.date=2019-01-01&rft.pub=IEEE&rft.eissn=2576-6813&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FGLOBECOM38437.2019.9013820&rft.externalDocID=9013820