复杂可修复流网络中部件故障造成的流量损失最小化

Michael T. Todinov
{"title":"复杂可修复流网络中部件故障造成的流量损失最小化","authors":"Michael T. Todinov","doi":"10.1109/UKSIM.2011.53","DOIUrl":null,"url":null,"abstract":"For repairable flow networks with complex topology, a simple and efficient algorithm is proposed for minimising the lost flow due to component failures during a specified time interval, at a specified output flow rate. The algorithm is based on two fundamental properties of repairable flow networks which involve the new concept 'specific resistance of a flow path'. The developed algorithm can be applied for optimal scheduling of flows, which significantly improves the quality of service of communication, production and transportation networks.","PeriodicalId":161995,"journal":{"name":"2011 UkSim 13th International Conference on Computer Modelling and Simulation","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimizing the Lost Flow Due to Component Failures for Complex Repairable Flow Networks\",\"authors\":\"Michael T. Todinov\",\"doi\":\"10.1109/UKSIM.2011.53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For repairable flow networks with complex topology, a simple and efficient algorithm is proposed for minimising the lost flow due to component failures during a specified time interval, at a specified output flow rate. The algorithm is based on two fundamental properties of repairable flow networks which involve the new concept 'specific resistance of a flow path'. The developed algorithm can be applied for optimal scheduling of flows, which significantly improves the quality of service of communication, production and transportation networks.\",\"PeriodicalId\":161995,\"journal\":{\"name\":\"2011 UkSim 13th International Conference on Computer Modelling and Simulation\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 UkSim 13th International Conference on Computer Modelling and Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UKSIM.2011.53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 UkSim 13th International Conference on Computer Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UKSIM.2011.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

对于具有复杂拓扑结构的可修流网络,提出了一种简单有效的算法,在给定的输出流量下,在给定的时间间隔内,将组件故障造成的流量损失最小化。该算法基于可修流网络的两个基本特性,其中涉及到“流路比阻”的新概念。该算法可用于流量优化调度,显著提高通信、生产和运输网络的服务质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Minimizing the Lost Flow Due to Component Failures for Complex Repairable Flow Networks
For repairable flow networks with complex topology, a simple and efficient algorithm is proposed for minimising the lost flow due to component failures during a specified time interval, at a specified output flow rate. The algorithm is based on two fundamental properties of repairable flow networks which involve the new concept 'specific resistance of a flow path'. The developed algorithm can be applied for optimal scheduling of flows, which significantly improves the quality of service of communication, production and transportation networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信