距离限制下随机流量网络可靠性评估的简单算法

M. Forghani-elahabad, Ufabc SP Cmcc
{"title":"距离限制下随机流量网络可靠性评估的简单算法","authors":"M. Forghani-elahabad, Ufabc SP Cmcc","doi":"10.5540/03.2023.010.01.0014","DOIUrl":null,"url":null,"abstract":". Various real-world systems, including computer and communication networks, transportation, and distribution systems, can be modeled as a stochastic/multistate flow network (MFN). Reliability indices are of great importance in evaluating the quality of service in MFNs. One such index is the two-terminal reliability (2TR), which represents the probability that the maximum flow in the network is not less than a certain demand level. Researchers have investigated the 2TR problem for MFNs, considering constraints such as budget, time, or distance limitations. Nevertheless, distance constraints have received relatively less attention in the literature, despite their significant role in optimizing the efficiency of some transmission networks. Hence, this study focuses on the 2TR problem with a distance constraint in an MFN and proposes a simple yet efficient algorithm to solve it. We demonstrate the effectiveness of our algorithm through a benchmark example.","PeriodicalId":274912,"journal":{"name":"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics","volume":"190 ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A simple algorithm for reliability evaluation of stochastic-flow networks under distance limitation\",\"authors\":\"M. Forghani-elahabad, Ufabc SP Cmcc\",\"doi\":\"10.5540/03.2023.010.01.0014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". Various real-world systems, including computer and communication networks, transportation, and distribution systems, can be modeled as a stochastic/multistate flow network (MFN). Reliability indices are of great importance in evaluating the quality of service in MFNs. One such index is the two-terminal reliability (2TR), which represents the probability that the maximum flow in the network is not less than a certain demand level. Researchers have investigated the 2TR problem for MFNs, considering constraints such as budget, time, or distance limitations. Nevertheless, distance constraints have received relatively less attention in the literature, despite their significant role in optimizing the efficiency of some transmission networks. Hence, this study focuses on the 2TR problem with a distance constraint in an MFN and proposes a simple yet efficient algorithm to solve it. We demonstrate the effectiveness of our algorithm through a benchmark example.\",\"PeriodicalId\":274912,\"journal\":{\"name\":\"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics\",\"volume\":\"190 \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5540/03.2023.010.01.0014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5540/03.2023.010.01.0014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

.现实世界中的各种系统,包括计算机和通信网络、运输和配送系统,都可以建模为随机/多态流动网络(MFN)。可靠性指数对评估多态流动网络的服务质量非常重要。其中一个指标是双终端可靠性(2TR),它表示网络中最大流量不低于某一需求水平的概率。考虑到预算、时间或距离限制等约束条件,研究人员对多频网络的 2TR 问题进行了研究。然而,尽管距离限制在优化某些输电网络效率方面发挥着重要作用,但文献中对距离限制的关注相对较少。因此,本研究将重点放在中频网络中带有距离约束的 2TR 问题上,并提出了一种简单而高效的算法来解决该问题。我们通过一个基准示例演示了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A simple algorithm for reliability evaluation of stochastic-flow networks under distance limitation
. Various real-world systems, including computer and communication networks, transportation, and distribution systems, can be modeled as a stochastic/multistate flow network (MFN). Reliability indices are of great importance in evaluating the quality of service in MFNs. One such index is the two-terminal reliability (2TR), which represents the probability that the maximum flow in the network is not less than a certain demand level. Researchers have investigated the 2TR problem for MFNs, considering constraints such as budget, time, or distance limitations. Nevertheless, distance constraints have received relatively less attention in the literature, despite their significant role in optimizing the efficiency of some transmission networks. Hence, this study focuses on the 2TR problem with a distance constraint in an MFN and proposes a simple yet efficient algorithm to solve it. We demonstrate the effectiveness of our algorithm through a benchmark example.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Controle do Aedes Aegypti com a Técnica Wolbachia e Armadilhas Impulsivas via Transformação Integral Generalizada Algoritmo Genético Adaptativo com Chaves Aleatórias Viciadas para um Problema de Corte de Estoque Multi-Período com Custos de Setup Reconstrução Tridimensional de uma Subestação de Energia Elétrica para Localização de Equipamentos a Partir de Termogramas Otimização de treliças metálicas planas em perfil tubular circular As aproximações de Fujimoto e o origami na representação de frações do tipo 1/n
×
引用
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