A Load Balancing Algorithm Based on End-to-end Rerouting

Jin Guo, M. Liang, Zhiyu Liu
{"title":"A Load Balancing Algorithm Based on End-to-end Rerouting","authors":"Jin Guo, M. Liang, Zhiyu Liu","doi":"10.1109/ICETCI53161.2021.9563561","DOIUrl":null,"url":null,"abstract":"With the quick growth of new Internet applications, the network load is increasing rapidly which may cause network congestion and has a certain impact on the transmission performance and user experience. There are two ways to solve this problem: increasing network bandwidth and balancing network load to increase network utilization. This paper mainly discusses the latter. As we all know, the shortest path algorithm is common for network routing, but it cannot balance the load between the network links, causing the load on some links heavy, we call the link with the heaviest load as the peak link. This paper proposes a new Load Balancing algorithm based on End-to-end Rerouting (LBER). First, the peak link is obtained according to the load status of the network links. Then, the load of the peak link is decreased by additional cost to punish it, that all the paths through the peak link are rerouted from end to end. The ultimate goal is to minimize the peak link load. Simulation experiments show that this algorithm can effectively reduce the peak traffic of the network compared with the existing shortest path algorithm by an average of 29.29%, which means the network bandwidth utilization is improved notably.","PeriodicalId":170858,"journal":{"name":"2021 IEEE International Conference on Electronic Technology, Communication and Information (ICETCI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Electronic Technology, Communication and Information (ICETCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICETCI53161.2021.9563561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the quick growth of new Internet applications, the network load is increasing rapidly which may cause network congestion and has a certain impact on the transmission performance and user experience. There are two ways to solve this problem: increasing network bandwidth and balancing network load to increase network utilization. This paper mainly discusses the latter. As we all know, the shortest path algorithm is common for network routing, but it cannot balance the load between the network links, causing the load on some links heavy, we call the link with the heaviest load as the peak link. This paper proposes a new Load Balancing algorithm based on End-to-end Rerouting (LBER). First, the peak link is obtained according to the load status of the network links. Then, the load of the peak link is decreased by additional cost to punish it, that all the paths through the peak link are rerouted from end to end. The ultimate goal is to minimize the peak link load. Simulation experiments show that this algorithm can effectively reduce the peak traffic of the network compared with the existing shortest path algorithm by an average of 29.29%, which means the network bandwidth utilization is improved notably.
基于端到端路由的负载均衡算法
随着互联网新应用的快速增长,网络负载迅速增加,可能造成网络拥塞,对传输性能和用户体验产生一定影响。解决这个问题的方法有两种:增加网络带宽和平衡网络负载以提高网络利用率。本文主要讨论后者。众所周知,最短路径算法是常用的网络路由算法,但它不能均衡网络链路之间的负载,导致某些链路的负载比较重,我们把负载最重的链路称为峰值链路。提出了一种基于端到端重路由(LBER)的负载均衡算法。首先,根据网络链路的负载状态得到峰值链路。然后,通过额外的代价来惩罚峰值链路,从而降低峰值链路的负载,使所有通过峰值链路的路径从端到端重新路由。最终目标是最小化峰值链路负载。仿真实验表明,与现有最短路径算法相比,该算法可有效降低网络峰值流量,平均降幅为29.29%,网络带宽利用率显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信