Performance of Dynamic Networks: A Measurement Consists of Flow, Timing and Reliability

Yih-Wenn Laih, C. Jane
{"title":"Performance of Dynamic Networks: A Measurement Consists of Flow, Timing and Reliability","authors":"Yih-Wenn Laih, C. Jane","doi":"10.1109/CCOMS.2018.8463338","DOIUrl":null,"url":null,"abstract":"Dynamic network models are widely employed for system analysis and performance evaluation of computer and communication systems. In dynamic networks each arc is weighted with a capacity and a transit time. The former is the maximum amount of flow that can travel through the arc per unit time, the later is the time period needed for flow to travel through the arc. In this article, an additional weight operation probability, is assigned to each arc to note the capability of the arc's successful transition. The performance of dynamic networks is defined by the probability that the maximum dynamic flow from source to sink within required time horizon is no less than specified threshold. To the best of our knowledge, no existing article had considered dynamic flow and network reliability simultaneously. Based on facts that there is always a maximum dynamic flow among the temporally repeated flows and the maximum temporally repeated flow can be obtained via an equivalent minimum cost maximum flow problem, we present a pioneering algorithm to compute performance of dynamic networks by solving minimum cost maximum flow and two-terminal capacity reliability at the same time.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCOMS.2018.8463338","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Dynamic network models are widely employed for system analysis and performance evaluation of computer and communication systems. In dynamic networks each arc is weighted with a capacity and a transit time. The former is the maximum amount of flow that can travel through the arc per unit time, the later is the time period needed for flow to travel through the arc. In this article, an additional weight operation probability, is assigned to each arc to note the capability of the arc's successful transition. The performance of dynamic networks is defined by the probability that the maximum dynamic flow from source to sink within required time horizon is no less than specified threshold. To the best of our knowledge, no existing article had considered dynamic flow and network reliability simultaneously. Based on facts that there is always a maximum dynamic flow among the temporally repeated flows and the maximum temporally repeated flow can be obtained via an equivalent minimum cost maximum flow problem, we present a pioneering algorithm to compute performance of dynamic networks by solving minimum cost maximum flow and two-terminal capacity reliability at the same time.
动态网络的性能:包括流量、时序和可靠性的测量
动态网络模型广泛应用于计算机和通信系统的系统分析和性能评价。在动态网络中,每个弧线都有一个容量和一个传输时间。前者是单位时间内可以通过电弧的最大流量,后者是流量通过电弧所需的时间段。在本文中,为每个弧线分配了一个额外的权重操作概率,以表示弧线成功过渡的能力。动态网络的性能由在要求的时间范围内从源到汇的最大动态流量不小于指定阈值的概率来定义。据我们所知,没有现有的文章同时考虑动态流和网络可靠性。基于时间重复流中总存在最大动态流,且最大时间重复流可通过等效最小代价最大流问题得到的事实,提出了一种同时求解最小代价最大流和双端容量可靠性的动态网络性能计算算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信