虚拟化网络服务扩展算法

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI:10.1109/NCA.2018.8548341

Omar Houidi, Oussama Soualah, Wajdi Louati, D. Zeghlache, F. Kamoun

{"title":"虚拟化网络服务扩展算法","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":"{\"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}","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

摘要

这项工作提出了扩展租户虚拟网络功能转发图(VNF-FG)的算法，以嵌入新的网络功能，并逐步向已经部署的租户专用片中引入额外的服务。通过整数线性规划(ILP)算法解决了相关的服务图扩展问题，该算法可作为与所提出的启发式算法进行性能比较的参考。提出了一种特征分解方法，并对其进行了评价和比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Virtualized Network Services Extension Algorithms

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)

自引率

0.00%

发文量