{"title":"一种确定性网络的多目标路由方案","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":"{\"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}","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}
A Multi-objective Routing Scheme for Deterministic Network
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.