A Multi-objective Routing Scheme for Deterministic Network

Y. Xia, Bing Hu
{"title":"A Multi-objective Routing Scheme for Deterministic Network","authors":"Y. Xia, Bing Hu","doi":"10.1109/HPSR52026.2021.9481862","DOIUrl":null,"url":null,"abstract":"The problem discussed and solved in this paper is the multi-objective routing problem for Deterministic Network. The technical requirements of resource allocation in the Deterministic Network implementation technology require us to reserve corresponding resources for deterministic flows to be transmitted in the network, which introduces a new constraint of bandwidth competition, making the existing multi-objective routing schemes unable to provide effective solutions. In order to solve this problem, we firstly establish a mathematical model and solve it with optimization methods. Then we propose a multi-objective routing scheme based on genetic algorithm. On the basis of satisfying delay and bandwidth constraints, good results are obtained. In order to test the scalability of the scheme, it was tested in network after adding packet loss constraint and the network of larger scales, which all achieved good results. By comparing the performance of our scheme with that of mathematical modeling optimization, it is found that our scheme has a significant and substantial improvement in efficiency at the cost of relaxing constraints. It is concluded that the multi-objective routing scheme based on genetic algorithm proposed in this paper is an effective scheme to solve the multi-objective problem for Deterministic Network.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR52026.2021.9481862","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The problem discussed and solved in this paper is the multi-objective routing problem for Deterministic Network. The technical requirements of resource allocation in the Deterministic Network implementation technology require us to reserve corresponding resources for deterministic flows to be transmitted in the network, which introduces a new constraint of bandwidth competition, making the existing multi-objective routing schemes unable to provide effective solutions. In order to solve this problem, we firstly establish a mathematical model and solve it with optimization methods. Then we propose a multi-objective routing scheme based on genetic algorithm. On the basis of satisfying delay and bandwidth constraints, good results are obtained. In order to test the scalability of the scheme, it was tested in network after adding packet loss constraint and the network of larger scales, which all achieved good results. By comparing the performance of our scheme with that of mathematical modeling optimization, it is found that our scheme has a significant and substantial improvement in efficiency at the cost of relaxing constraints. It is concluded that the multi-objective routing scheme based on genetic algorithm proposed in this paper is an effective scheme to solve the multi-objective problem for Deterministic Network.
一种确定性网络的多目标路由方案
本文讨论并解决的问题是确定性网络中的多目标路由问题。确定性网络实现技术中对资源分配的技术要求要求我们为网络中要传输的确定性流预留相应的资源,这就引入了新的带宽竞争约束,使得现有的多目标路由方案无法提供有效的解决方案。为了解决这一问题,我们首先建立了数学模型,并用最优化方法进行求解。然后提出了一种基于遗传算法的多目标路由方案。在满足时延和带宽约束的基础上,取得了较好的效果。为了测试该方案的可扩展性,在加入丢包约束后的网络和更大规模的网络中进行了测试,均取得了良好的效果。通过将我们的方案与数学建模优化的性能进行比较,发现我们的方案在以放松约束为代价的情况下,效率有了显著而实质性的提高。结果表明,本文提出的基于遗传算法的多目标路由方案是解决确定性网络多目标问题的有效方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信