Omar Houidi, Oussama Soualah, Wajdi Louati, D. Zeghlache, F. Kamoun
{"title":"Virtualized Network Services Extension Algorithms","authors":"Omar Houidi, Oussama Soualah, Wajdi Louati, D. Zeghlache, F. Kamoun","doi":"10.1109/NCA.2018.8548341","DOIUrl":null,"url":null,"abstract":"This work presents algorithms to extend tenant Virtualized Network Functions Forwarding Graphs (VNF-FG) to embed new networking functions and introduce gradually additional services into the already deployed tenant dedicated slices. The related service graph extension problem is addressed through an Integer Linear Programming (ILP) algorithm that serves as a reference for performance comparisons with a proposed heuristic algorithm. An eigendecomposition approach is proposed, evaluated and compared.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2018.8548341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
This work presents algorithms to extend tenant Virtualized Network Functions Forwarding Graphs (VNF-FG) to embed new networking functions and introduce gradually additional services into the already deployed tenant dedicated slices. The related service graph extension problem is addressed through an Integer Linear Programming (ILP) algorithm that serves as a reference for performance comparisons with a proposed heuristic algorithm. An eigendecomposition approach is proposed, evaluated and compared.