Optimal Data Traffic and Computer Processing by a Generalized Network Flow Model with Gains and Losses

V. Sgurev, L. Doukovska, S. Drangajov
{"title":"Optimal Data Traffic and Computer Processing by a Generalized Network Flow Model with Gains and Losses","authors":"V. Sgurev, L. Doukovska, S. Drangajov","doi":"10.1109/BdKCSE48644.2019.9010613","DOIUrl":null,"url":null,"abstract":"Using of a generalized network flow model with gains and losses is proposed for solving the problem of optimal network traffic and data processing from sources to the consumers. The problem for finding traffic of minimal cost is reduced solving the linear network flow problem. A method for network flow optimization is proposed for finding the maximal data flow from sources to consumers. It is shown that this flow is equal to the minimal cut of the network between sources and consumers. Theoretical results, obtained in the present work are confirmed by two appropriate numerical examples.","PeriodicalId":206080,"journal":{"name":"2019 Big Data, Knowledge and Control Systems Engineering (BdKCSE)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Big Data, Knowledge and Control Systems Engineering (BdKCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BdKCSE48644.2019.9010613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Using of a generalized network flow model with gains and losses is proposed for solving the problem of optimal network traffic and data processing from sources to the consumers. The problem for finding traffic of minimal cost is reduced solving the linear network flow problem. A method for network flow optimization is proposed for finding the maximal data flow from sources to consumers. It is shown that this flow is equal to the minimal cut of the network between sources and consumers. Theoretical results, obtained in the present work are confirmed by two appropriate numerical examples.
具有损益的广义网络流模型的最优数据流量与计算机处理
提出了一种具有损益的广义网络流模型,用于解决从源到消费者的最优网络流量和数据处理问题。通过求解线性网络流问题,减少了寻找成本最小的流量的问题。提出了一种网络流优化方法,用于寻找从数据源到消费者的最大数据流。结果表明,该流量等于源和消费者之间的网络的最小切割。本文所得到的理论结果通过两个适当的数值算例得到了证实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信