Improvement of the Calculation Model the Set of Disjoint Paths with Maximum Bandwidth

Oleksandr V Lemeshko, Oleksandra Yeremenko, M. Yevdokymenko, Batoul Sleiman
{"title":"Improvement of the Calculation Model the Set of Disjoint Paths with Maximum Bandwidth","authors":"Oleksandr V Lemeshko, Oleksandra Yeremenko, M. Yevdokymenko, Batoul Sleiman","doi":"10.1109/UkrMiCo47782.2019.9165311","DOIUrl":null,"url":null,"abstract":"In this paper, the improvement of the calculation model the set of disjoint paths with maximum bandwidth during multipath routing in the infocommunication network is presented. The task stated was reduced to solving the optimization problem of integer linear programming with maximization of the number of paths and their bandwidth in the presence of linear constraints since the routing variables are Boolean, and variables that determine the number of routes used take only integer values.","PeriodicalId":6754,"journal":{"name":"2019 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo)","volume":"21 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UkrMiCo47782.2019.9165311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, the improvement of the calculation model the set of disjoint paths with maximum bandwidth during multipath routing in the infocommunication network is presented. The task stated was reduced to solving the optimization problem of integer linear programming with maximization of the number of paths and their bandwidth in the presence of linear constraints since the routing variables are Boolean, and variables that determine the number of routes used take only integer values.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最大带宽不相交路径集计算模型的改进
本文对信息通信网络多路径路由中最大带宽不相交路径集计算模型进行了改进。由于路由变量是布尔型的,而决定所使用的路由数量的变量只能取整数值,因此所述任务被简化为在存在线性约束的情况下,求解路径数量及其带宽最大化的整数线性规划优化问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparative Analysis of the Methods of Wavelet-and Spline-extrapolation in Problems of Predicting Self-similar Traffic Synchronizing Sequences For Verification Of Finite State Machines UkrMiCo 2019 Title Page Mathematical Optimization Model of Congestion Management, Resource Allocation and Congestion Avoidance on Network Routers Electrodynamic Approach to Designing Wireless Power Transfer Systems (Internal System Processes)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1