An Energy-driven Network Function Virtualization for Multi-domain Software Defined Networks

计算机科学 网络功能虚拟化 虚拟化 软件定义的网络 功能(生物学) 网络虚拟化 领域(数学分析) 软件 计算机网络 操作系统 云计算 数学 进化生物学 生物 数学分析
作者
Kuljeet Kaur,Sahil Garg,Georges Kaddoum,Franeois Gagnon,Neeraj Kumar,Syed Hassan Ahmed
标识
DOI:10.1109/infcomw.2019.8845314
摘要

Network Functions Virtualization (NFV) in Software Defined Networks (SDN) emerged as a new technology for creating virtual instances for smooth execution of multiple applications. Their amalgamation provides flexible and programmable platforms to utilize the network resources for providing Quality of Service (QoS) to various applications. In SDN-enabled NFV setups, the underlying network services can be viewed as a series of virtual network functions (VNFs) and their optimal deployment on physical/virtual nodes is considered a challenging task to perform. However, SDNs have evolved from single-domain to multi-domain setups in the recent era. Thus, the complexity of the underlying VNF deployment problem in multi-domain setups has increased manifold. Moreover, the energy utilization aspect is relatively unexplored with respect to an optimal mapping of VNFs across multiple SDN domains. Hence, in this work, the VNF deployment problem in multi-domain SDN setup has been addressed with a primary emphasis on reducing the overall energy consumption for deploying the maximum number of VNFs with guaranteed QoS. The problem in hand is initially formulated as a "Multi-objective Optimization Problem" based on Integer Linear Programming (ILP) to obtain an optimal solution. However, the formulated ILP becomes complex to solve with an increasing number of decision variables and constraints with an increase in the size of the network. Thus, we leverage the benefits of the popular evolutionary optimization algorithms to solve the problem under consideration. In order to deduce the most appropriate evolutionary optimization algorithm to solve the considered problem, it is subjected to different variants of evolutionary algorithms on the widely used MOEA framework (an open source java framework based on multi-objective evolutionary algorithms). The experimental results demonstrate that the proposed scheme achieves better results in comparison to the e-Nen-dominated Sorting Genetic Algorithm (NSGA)-II (ϵ-NSGA-II) with the respect to the overall energy consumption and optimal deployment of VNFs in multi-domain SDN scenarios.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
tangchao完成签到,获得积分10
2秒前
小布完成签到 ,获得积分0
7秒前
Ding-Ding完成签到,获得积分10
10秒前
贤惠的老黑完成签到 ,获得积分10
16秒前
manmanzhong完成签到 ,获得积分10
17秒前
iiiau完成签到,获得积分10
20秒前
月夕完成签到 ,获得积分10
24秒前
不过尔尔完成签到 ,获得积分10
27秒前
或无情完成签到 ,获得积分10
35秒前
吴小白完成签到 ,获得积分10
39秒前
馅饼完成签到,获得积分10
46秒前
2026毕业啦完成签到,获得积分10
49秒前
坚强的铅笔完成签到 ,获得积分10
51秒前
洺全完成签到 ,获得积分10
51秒前
小莫完成签到 ,获得积分10
54秒前
59秒前
---发布了新的文献求助10
1分钟前
万能图书馆应助Forest采纳,获得10
1分钟前
居里姐姐完成签到 ,获得积分10
1分钟前
gyx完成签到 ,获得积分10
1分钟前
1分钟前
英姑应助HM采纳,获得10
1分钟前
El发布了新的文献求助10
1分钟前
qweas完成签到,获得积分10
1分钟前
可爱的函函应助El采纳,获得10
1分钟前
Felice完成签到,获得积分10
1分钟前
Akim应助科研通管家采纳,获得30
1分钟前
思绪摸摸头完成签到 ,获得积分10
1分钟前
爱静静完成签到,获得积分0
1分钟前
1分钟前
GGBOND完成签到,获得积分10
1分钟前
zf发布了新的文献求助10
1分钟前
文艺的胖虎完成签到 ,获得积分10
1分钟前
魔幻的访云完成签到 ,获得积分10
1分钟前
1分钟前
是述不是沭完成签到,获得积分10
2分钟前
chenying完成签到 ,获得积分0
2分钟前
如意竺完成签到,获得积分10
2分钟前
Dr. Zhang发布了新的文献求助80
2分钟前
2分钟前
高分求助中
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
A new approach to the extrapolation of accelerated life test data 1000
Problems of point-blast theory 400
Indomethacinのヒトにおける経皮吸収 400
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 370
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
Robot-supported joining of reinforcement textiles with one-sided sewing heads 320
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3996106
求助须知:如何正确求助?哪些是违规求助? 3535712
关于积分的说明 11267429
捐赠科研通 3275306
什么是DOI,文献DOI怎么找? 1806560
邀请新用户注册赠送积分活动 883378
科研通“疑难数据库(出版商)”最低求助积分说明 809785