一种用于网络性能评估的波纹扩散算法

Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao
{"title":"一种用于网络性能评估的波纹扩散算法","authors":"Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao","doi":"10.1109/SSCI.2016.7850142","DOIUrl":null,"url":null,"abstract":"To assess the performance of a network system against disturbances, existing methods are usually concerned with two different extreme situations: (i) how likely the system will degrade into some separated sub-graphs because of disturbances; (ii) how likely the 1st best paths will be cut off by disturbances. However, a more general situation, i.e., how likely those paths whose lengths are within a given range will be affected by disturbances, is barely discussed. Basically, to address this general situation, all (not just a proportion) of those paths whose lengths are within the given range must be found out between all pairs of origin and destination (OD) of interest. Unfortunately, no effective method has ever been reported to accomplish this task, although there are many methods capable of calculating all the 1st best paths between all OD pair of interest. This paper, for the first time, attempts to address the above general situation of network performance assessment. To this end, a novel ripple-spreading algorithm (RSA) is proposed to carry out a ripple relay race on the network, in order to identify all of those paths whose lengths are within the given range. Surprisingly, the proposed RSA can find all such paths between all OD pairs of interest by just a single run of ripple relay race. This work makes progress towards the general performance assessment of a network system against disturbances.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A ripple-spreading algorithm for network performance assessment\",\"authors\":\"Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao\",\"doi\":\"10.1109/SSCI.2016.7850142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To assess the performance of a network system against disturbances, existing methods are usually concerned with two different extreme situations: (i) how likely the system will degrade into some separated sub-graphs because of disturbances; (ii) how likely the 1st best paths will be cut off by disturbances. However, a more general situation, i.e., how likely those paths whose lengths are within a given range will be affected by disturbances, is barely discussed. Basically, to address this general situation, all (not just a proportion) of those paths whose lengths are within the given range must be found out between all pairs of origin and destination (OD) of interest. Unfortunately, no effective method has ever been reported to accomplish this task, although there are many methods capable of calculating all the 1st best paths between all OD pair of interest. This paper, for the first time, attempts to address the above general situation of network performance assessment. To this end, a novel ripple-spreading algorithm (RSA) is proposed to carry out a ripple relay race on the network, in order to identify all of those paths whose lengths are within the given range. Surprisingly, the proposed RSA can find all such paths between all OD pairs of interest by just a single run of ripple relay race. This work makes progress towards the general performance assessment of a network system against disturbances.\",\"PeriodicalId\":120288,\"journal\":{\"name\":\"2016 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSCI.2016.7850142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI.2016.7850142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

为了评估网络系统抗干扰的性能,现有的方法通常关注两种不同的极端情况:(i)系统因干扰而退化成一些分离的子图的可能性有多大;(ii)第一最佳路径被干扰切断的可能性。然而,更一般的情况,即那些长度在给定范围内的路径受到干扰的可能性有多大,很少被讨论。基本上,为了解决这种一般情况,必须在所有感兴趣的原点和目的地(OD)对之间找出长度在给定范围内的所有路径(而不仅仅是一部分)。不幸的是,尽管有许多方法能够计算所有感兴趣的OD对之间的所有第一最佳路径,但迄今为止还没有报道过有效的方法来完成这项任务。本文首次尝试解决上述网络性能评估的一般情况。为此,提出了一种新的纹波传播算法(RSA),在网络上进行纹波中继竞赛,以识别长度在给定范围内的所有路径。令人惊讶的是,所提出的RSA可以通过一次ripple relay race找到所有感兴趣的OD对之间的所有路径。这项工作在网络系统抗干扰的一般性能评估方面取得了进展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A ripple-spreading algorithm for network performance assessment
To assess the performance of a network system against disturbances, existing methods are usually concerned with two different extreme situations: (i) how likely the system will degrade into some separated sub-graphs because of disturbances; (ii) how likely the 1st best paths will be cut off by disturbances. However, a more general situation, i.e., how likely those paths whose lengths are within a given range will be affected by disturbances, is barely discussed. Basically, to address this general situation, all (not just a proportion) of those paths whose lengths are within the given range must be found out between all pairs of origin and destination (OD) of interest. Unfortunately, no effective method has ever been reported to accomplish this task, although there are many methods capable of calculating all the 1st best paths between all OD pair of interest. This paper, for the first time, attempts to address the above general situation of network performance assessment. To this end, a novel ripple-spreading algorithm (RSA) is proposed to carry out a ripple relay race on the network, in order to identify all of those paths whose lengths are within the given range. Surprisingly, the proposed RSA can find all such paths between all OD pairs of interest by just a single run of ripple relay race. This work makes progress towards the general performance assessment of a network system against disturbances.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信