Minimizing the Maximum Link Utilization for Traffic Engineering in SDN: A Comparative Analysis

U. Prabu , V. Geetha
{"title":"Minimizing the Maximum Link Utilization for Traffic Engineering in SDN: A Comparative Analysis","authors":"U. Prabu ,&nbsp;V. Geetha","doi":"10.1016/j.procs.2024.12.032","DOIUrl":null,"url":null,"abstract":"<div><div>Software Defined Network modernizes network architecture by supporting scalability, significant flexibility, and programmability. Its functioning has been extended to several areas such as cloud computing, edge computing, enterprise networks, data centers, and the Internet of Things (IoT). It also successfully enhances the functioning of traffic engineering. Traffic engineering involves optimization and dynamic control of traffic flows, minimizing congestion and maximum link utilization, centralized control, and network traffic management. It also enables the effective utilization of resources, boosts the user experience, and increases network performance. Minimizing maximum link utilization implies the distribution of network traffic across respective links or paths to use the offered resources of the network by preventing congestion. Its major goal is to guarantee that none of the individual links gets overloaded. Various approaches have been proposed in the past several years to address this problem. In this article, the state-of-the-art approaches are reviewed and analyzed. The problem formulation of each approach for minimizing the maximum link utilization is detailed with significant importance. The proposed algorithms, its type, and results are also depicted to have a better comparative analysis. Additionally, the type of graph considered while formulating the problem, topologies used to investigate the efficiency of the algorithm, performance metrics, and implementation platforms are listed to have a clear understanding of various approaches.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"252 ","pages":"Pages 296-305"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Procedia Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1877050924034641","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Software Defined Network modernizes network architecture by supporting scalability, significant flexibility, and programmability. Its functioning has been extended to several areas such as cloud computing, edge computing, enterprise networks, data centers, and the Internet of Things (IoT). It also successfully enhances the functioning of traffic engineering. Traffic engineering involves optimization and dynamic control of traffic flows, minimizing congestion and maximum link utilization, centralized control, and network traffic management. It also enables the effective utilization of resources, boosts the user experience, and increases network performance. Minimizing maximum link utilization implies the distribution of network traffic across respective links or paths to use the offered resources of the network by preventing congestion. Its major goal is to guarantee that none of the individual links gets overloaded. Various approaches have been proposed in the past several years to address this problem. In this article, the state-of-the-art approaches are reviewed and analyzed. The problem formulation of each approach for minimizing the maximum link utilization is detailed with significant importance. The proposed algorithms, its type, and results are also depicted to have a better comparative analysis. Additionally, the type of graph considered while formulating the problem, topologies used to investigate the efficiency of the algorithm, performance metrics, and implementation platforms are listed to have a clear understanding of various approaches.
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.50
自引率
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学术官方微信