直径约束可靠性:复杂性和区分拓扑

2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-11-01 DOI:10.1109/RNDM.2014.7014935

E. Canale, H. Cancela, F. Robledo, P. Romero, Pablo Sartor

{"title":"直径约束可靠性:复杂性和区分拓扑","authors":"E. Canale, H. Cancela, F. Robledo, P. Romero, Pablo Sartor","doi":"10.1109/RNDM.2014.7014935","DOIUrl":null,"url":null,"abstract":"Let G = (V,E) be a simple graph with |V| = n nodes and |E| = m links, a subset K ⊆ V of terminals, a vector p = (p1, ..., pm) ∈ [0, 1]m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities qi = 1 - pi. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by d links, or less. This number is denoted by RK,Gd(p).","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Diameter constrained reliability: Complexity and distinguished topologies\",\"authors\":\"E. Canale, H. Cancela, F. Robledo, P. Romero, Pablo Sartor\",\"doi\":\"10.1109/RNDM.2014.7014935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G = (V,E) be a simple graph with |V| = n nodes and |E| = m links, a subset K ⊆ V of terminals, a vector p = (p1, ..., pm) ∈ [0, 1]m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities qi = 1 - pi. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by d links, or less. This number is denoted by RK,Gd(p).\",\"PeriodicalId\":299072,\"journal\":{\"name\":\"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RNDM.2014.7014935\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2014.7014935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

设G = (V,E)为一个具有|V| = n个节点、|E| = m个链路的简单图，一个有若干个终端的子集K⊥V，一个向量p = (p1，…)， pm)∈[0,1]m和正整数d，称为直径。我们假设节点是完美的，但链接是随机和独立的，概率qi = 1 - pi。直径约束可靠度(简称DCR)是结果子图的终端保持由d条或更少的链路组成的路径连接的概率。这个数字用RK,Gd(p)表示。

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

查看原文本刊更多论文

Diameter constrained reliability: Complexity and distinguished topologies

Let G = (V,E) be a simple graph with |V| = n nodes and |E| = m links, a subset K ⊆ V of terminals, a vector p = (p₁, ..., p_m) ∈ [0, 1]^m and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities q_i = 1 - p_i. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by d links, or less. This number is denoted by R_K,G^d(p).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)

自引率

0.00%

发文量