A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network

2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI:10.1109/PRDC.2008.16

Ruen Chze Loh, S. Soh, M. Lazarescu, S. Rai

{"title":"A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network","authors":"Ruen Chze Loh, S. Soh, M. Lazarescu, S. Rai","doi":"10.1109/PRDC.2008.16","DOIUrl":null,"url":null,"abstract":"Multipath routing protocols (MRP) help improve the network quality of service (QoS), including load balancing, fault tolerance (reliability), aggregate bandwidth and delay. While multipaths communication provides better failure-tolerance, their resilience only holds if the multiple paths are selected carefully. Note that selecting an optimal path set is a NP-complete problem. Recently, several algorithms have appeared in the literature to help construct multiple node-disjoint paths or multiple edge-disjoint paths. This paper presents two algorithms, discussing the later issue. The first algorithm, called clique-based-approach (CBA), finds the edge-disjoint-path-set with the optimal reliability. The second algorithm, greedy-CBA (CBA-G), is a heuristic that reduces the computational complexity of CBA. Results show that CBA-G improves the efficiency of CBA without negatively affecting its effectiveness. We also provide an explanation as to why CBA-G is able to produce edge-disjoint-path-sets with reliabilities equal or better than a benchmark protocol, DPSP.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2008.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

Abstract

Multipath routing protocols (MRP) help improve the network quality of service (QoS), including load balancing, fault tolerance (reliability), aggregate bandwidth and delay. While multipaths communication provides better failure-tolerance, their resilience only holds if the multiple paths are selected carefully. Note that selecting an optimal path set is a NP-complete problem. Recently, several algorithms have appeared in the literature to help construct multiple node-disjoint paths or multiple edge-disjoint paths. This paper presents two algorithms, discussing the later issue. The first algorithm, called clique-based-approach (CBA), finds the edge-disjoint-path-set with the optimal reliability. The second algorithm, greedy-CBA (CBA-G), is a heuristic that reduces the computational complexity of CBA. Results show that CBA-G improves the efficiency of CBA without negatively affecting its effectiveness. We also provide an explanation as to why CBA-G is able to produce edge-disjoint-path-sets with reliabilities equal or better than a benchmark protocol, DPSP.

查看原文本刊更多论文

寻找网络中最可靠边不相交路径集的贪心技术

多路径路由协议(MRP)有助于提高网络服务质量(QoS)，包括负载均衡、容错(可靠性)、聚合带宽和延迟。虽然多路径通信提供了更好的容错能力，但只有在仔细选择多条路径的情况下，它们才具有弹性。注意，选择最优路径集是一个np完全问题。最近，文献中出现了几种算法来帮助构建多个节点不相交路径或多个边不相交路径。本文提出了两种算法，讨论了后面的问题。第一种算法称为基于团的方法(CBA)，它寻找具有最优可靠性的边不相交路径集。第二种算法是greedy-CBA (CBA- g)，它是一种启发式算法，降低了CBA的计算复杂度。结果表明，CBA- g在不影响CBA效果的情况下提高了CBA的效率。我们还解释了为什么CBA-G能够产生可靠性等于或优于基准协议DPSP的边不相交路径集。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2008 14th IEEE Pacific Rim International Symposium on Dependable Computing

自引率

0.00%

发文量