{"title":"MOLM: Alleviating Congestion through Multi-Objective Simulated Annealing-Based Load Balancing Routing in LEO Satellite Networks","authors":"Yihu Zhou, Haiming Chen, Zhibin Dou","doi":"10.3390/fi16040109","DOIUrl":null,"url":null,"abstract":"In satellite networks, existing congestion resolution methods do not consider the predictability and stability of paths, leading to frequent path switches and high maintenance costs. In this regard, we propose a novel congestion resolution approach, named MOLM, which introduces a continuous neighbor set during path updates. This set includes nodes capable of establishing sustainable connections with the predecessors and successors of congested nodes. Combined with a multi-objective simulated annealing framework, MOLM iteratively derives an optimal selection from this set to replace congested nodes. Additionally, we employ a Fast Reroute mechanism based on backup paths (FRR-BP) to address node failures. The simulation results indicate that the optimal node endows the new path with optimal path stability and path latency.","PeriodicalId":509567,"journal":{"name":"Future Internet","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/fi16040109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In satellite networks, existing congestion resolution methods do not consider the predictability and stability of paths, leading to frequent path switches and high maintenance costs. In this regard, we propose a novel congestion resolution approach, named MOLM, which introduces a continuous neighbor set during path updates. This set includes nodes capable of establishing sustainable connections with the predecessors and successors of congested nodes. Combined with a multi-objective simulated annealing framework, MOLM iteratively derives an optimal selection from this set to replace congested nodes. Additionally, we employ a Fast Reroute mechanism based on backup paths (FRR-BP) to address node failures. The simulation results indicate that the optimal node endows the new path with optimal path stability and path latency.