Optimal Topology Management for Software-Defined Networks Minimizing Latency and Using Network Slicing

IF 1.7 4区 工程技术 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Complexity Pub Date : 2024-06-23 DOI:10.1155/2024/4849198
Andrés Viveros, Pablo Adasme, Ali Dehghan Firoozabadi
{"title":"Optimal Topology Management for Software-Defined Networks Minimizing Latency and Using Network Slicing","authors":"Andrés Viveros,&nbsp;Pablo Adasme,&nbsp;Ali Dehghan Firoozabadi","doi":"10.1155/2024/4849198","DOIUrl":null,"url":null,"abstract":"<div>\n <p>In this paper, we analyze the problem of managing users from different slices connecting to a software-defined network (SDN). We seek to minimize the propagation latency between switches and controllers as well as between controllers themselves. We also minimize the connection latency between users and their network access nodes. Thus, the main highlights of the paper are to formally represent the problem utilizing two equivalent mixed-integer quadratic programming models. The first one represents the user requirements of each slice by using a membership matrix. The second one consists of subsets of users separated within each slice requirement. Subsequently, the above models are analyzed in a standard linearized version. Finally, they are compared with a proposed local search math-heuristic algorithm. The proposed models and algorithm are solved with the CPLEX solver with default options. To the best of our knowledge, this journal paper constitutes a first attempt to incorporate network slicing in SDN allowing flexibility, resource efficiency, security, and effective management of the network facilitating the deployment of customized and adaptive services. Besides, our models allow us to deal with the management of connecting users to either controller or switch-type nodes depending on the slice to which each user belongs. For security reasons, a certain slice could only have access to the network controllers, while the rest of the users that belong to the other slices can connect to the switch-type nodes of the network. From the numerical experiments, we observe that the linear models show a better performance in terms of CPU times and the best solutions obtained. Similarly, our proposed approximation algorithm achieves near-optimal solutions in significantly shorter CPU times, for all the input graph networks, when compared to the proposed exact models which allows for finding the optimal solutions.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/4849198","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2024/4849198","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we analyze the problem of managing users from different slices connecting to a software-defined network (SDN). We seek to minimize the propagation latency between switches and controllers as well as between controllers themselves. We also minimize the connection latency between users and their network access nodes. Thus, the main highlights of the paper are to formally represent the problem utilizing two equivalent mixed-integer quadratic programming models. The first one represents the user requirements of each slice by using a membership matrix. The second one consists of subsets of users separated within each slice requirement. Subsequently, the above models are analyzed in a standard linearized version. Finally, they are compared with a proposed local search math-heuristic algorithm. The proposed models and algorithm are solved with the CPLEX solver with default options. To the best of our knowledge, this journal paper constitutes a first attempt to incorporate network slicing in SDN allowing flexibility, resource efficiency, security, and effective management of the network facilitating the deployment of customized and adaptive services. Besides, our models allow us to deal with the management of connecting users to either controller or switch-type nodes depending on the slice to which each user belongs. For security reasons, a certain slice could only have access to the network controllers, while the rest of the users that belong to the other slices can connect to the switch-type nodes of the network. From the numerical experiments, we observe that the linear models show a better performance in terms of CPU times and the best solutions obtained. Similarly, our proposed approximation algorithm achieves near-optimal solutions in significantly shorter CPU times, for all the input graph networks, when compared to the proposed exact models which allows for finding the optimal solutions.

Abstract Image

软件定义网络的最佳拓扑管理 尽量减少延迟并使用网络切片
本文分析了管理连接到软件定义网络(SDN)的不同片区用户的问题。我们力求最大限度地减少交换机和控制器之间以及控制器本身之间的传播延迟。同时,我们还要最大限度地减少用户与其网络接入节点之间的连接延迟。因此,本文的主要亮点是利用两个等价的混合整数二次编程模型来正式表示问题。第一个模型通过成员矩阵表示每个片区的用户需求。第二个模型由在每个切片要求中分离出来的用户子集组成。随后,对上述模型进行了标准线性化分析。最后,将它们与所提出的局部搜索数学启发式算法进行比较。建议的模型和算法使用 CPLEX 求解器(带默认选项)求解。据我们所知,这篇期刊论文是首次尝试将网络切片纳入 SDN,从而实现网络的灵活性、资源效率、安全性和有效管理,促进定制化和自适应服务的部署。此外,我们的模型允许我们根据每个用户所属的切片,处理将用户连接到控制器或交换机类型节点的管理问题。出于安全考虑,某个分片只能访问网络控制器,而属于其他分片的其他用户则可以连接到网络的交换式节点。通过数值实验,我们发现线性模型在 CPU 时间和获得的最佳解决方案方面表现更佳。同样,对于所有输入图形网络,我们提出的近似算法与可找到最优解的精确模型相比,能在更短的 CPU 时间内获得接近最优解的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Complexity
Complexity 综合性期刊-数学跨学科应用
CiteScore
5.80
自引率
4.30%
发文量
595
审稿时长
>12 weeks
期刊介绍: Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.
×
引用
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学术官方微信