V. Tikhonov, O. Tykhonova, O. Yavorska, Radkevych Svetlana
{"title":"基于最小交通量准则的交通网络流优化","authors":"V. Tikhonov, O. Tykhonova, O. Yavorska, Radkevych Svetlana","doi":"10.1109/PICST51311.2020.9468096","DOIUrl":null,"url":null,"abstract":"A method of optimal distribution of digital flows in the transport network by the criterion of minimum transit is proposed, in which the mathematical model of the network is a free-oriented weighted graph with two open poles, and the distribution of flows begins with maximum flows on paths with minimum number of transit nodes. Due to this, in a telecommunication network with dynamically configured channels, the overall productivity increases and the number of transit routes is minimized. This method addressed for usage in the software-defined transport networks.","PeriodicalId":123008,"journal":{"name":"2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Flows Optimization of the Transport Network by the Criterion of Minimal Transit\",\"authors\":\"V. Tikhonov, O. Tykhonova, O. Yavorska, Radkevych Svetlana\",\"doi\":\"10.1109/PICST51311.2020.9468096\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method of optimal distribution of digital flows in the transport network by the criterion of minimum transit is proposed, in which the mathematical model of the network is a free-oriented weighted graph with two open poles, and the distribution of flows begins with maximum flows on paths with minimum number of transit nodes. Due to this, in a telecommunication network with dynamically configured channels, the overall productivity increases and the number of transit routes is minimized. This method addressed for usage in the software-defined transport networks.\",\"PeriodicalId\":123008,\"journal\":{\"name\":\"2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PICST51311.2020.9468096\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICST51311.2020.9468096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Flows Optimization of the Transport Network by the Criterion of Minimal Transit
A method of optimal distribution of digital flows in the transport network by the criterion of minimum transit is proposed, in which the mathematical model of the network is a free-oriented weighted graph with two open poles, and the distribution of flows begins with maximum flows on paths with minimum number of transit nodes. Due to this, in a telecommunication network with dynamically configured channels, the overall productivity increases and the number of transit routes is minimized. This method addressed for usage in the software-defined transport networks.