Combined Latency-Aware and Resource-Effective Virtual Network Function Placement

Wissal Attaoui, Essaid Sabir, H. Elbiaze, M. Sadik
{"title":"Combined Latency-Aware and Resource-Effective Virtual Network Function Placement","authors":"Wissal Attaoui, Essaid Sabir, H. Elbiaze, M. Sadik","doi":"10.1109/CCECE47787.2020.9255792","DOIUrl":null,"url":null,"abstract":"With the emergence of network function virtualization (NFV) and Software-Defined Networking (SDN) technologies, virtual network functions (VNF) can be interconnected to deliver different mobile services in 5G communication networks. Our primary purpose is to find the optimal VNF placement reducing resource consumption while providing specific latency and throughput for slicing services. We consider VNFs as M/M/1/C queues chained together to serve customer requests. The problem relies on finding an efficient orchestration and placement of VNFs. In this context, we propose a decision algorithm based two-procedures, the first one, named orchestration phase, aims to manage the reuse of VNFs having the same required functions through a dynamic logit method, and the second one is related to the new placement of VNFs. In this paper, we focus on a simple scenario of delivering video streaming service traversing a standard chain of four VNFs. Simulation results prove the performance of our proposed algorithm in terms of End-to-End delay and dropping probability compared to greedy and affinity algorithms.","PeriodicalId":296506,"journal":{"name":"2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE47787.2020.9255792","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

With the emergence of network function virtualization (NFV) and Software-Defined Networking (SDN) technologies, virtual network functions (VNF) can be interconnected to deliver different mobile services in 5G communication networks. Our primary purpose is to find the optimal VNF placement reducing resource consumption while providing specific latency and throughput for slicing services. We consider VNFs as M/M/1/C queues chained together to serve customer requests. The problem relies on finding an efficient orchestration and placement of VNFs. In this context, we propose a decision algorithm based two-procedures, the first one, named orchestration phase, aims to manage the reuse of VNFs having the same required functions through a dynamic logit method, and the second one is related to the new placement of VNFs. In this paper, we focus on a simple scenario of delivering video streaming service traversing a standard chain of four VNFs. Simulation results prove the performance of our proposed algorithm in terms of End-to-End delay and dropping probability compared to greedy and affinity algorithms.
结合延迟感知和资源有效的虚拟网络功能布局
随着网络功能虚拟化(NFV)和软件定义网络(SDN)技术的出现,在5G通信网络中,虚拟网络功能(VNF)可以互联互通,提供不同的移动业务。我们的主要目的是找到最佳的VNF位置,减少资源消耗,同时为切片服务提供特定的延迟和吞吐量。我们将VNFs视为链接在一起的M/M/1/C队列来服务客户请求。这个问题依赖于找到VNFs的有效编排和放置。在此背景下,我们提出了一种基于两个过程的决策算法,第一个过程称为编排阶段,旨在通过动态logit方法管理具有相同所需功能的vnf的重用,第二个过程与vnf的新位置有关。在本文中,我们专注于一个简单的场景,即通过四个VNFs的标准链提供视频流服务。仿真结果证明了该算法在端到端延迟和丢弃概率方面的性能优于贪婪算法和亲和算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信