随机环网络中最可靠源的计算

2009 WRI World Congress on Software Engineering Pub Date : 2009-05-19 DOI:10.1109/WCSE.2009.31

Wei Ding

{"title":"随机环网络中最可靠源的计算","authors":"Wei Ding","doi":"10.1109/WCSE.2009.31","DOIUrl":null,"url":null,"abstract":"Given a stochastic communication network with a ring topology and n vertices, where the operational probability of each link is independent and no failures happen to vertices, we expect to determine the most reliable source on the network. In this paper, we propose an efficient algorithm whose time complexity is O(n^2).","PeriodicalId":331155,"journal":{"name":"2009 WRI World Congress on Software Engineering","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Computing the Most Reliable Source on Stochastic Ring Networks\",\"authors\":\"Wei Ding\",\"doi\":\"10.1109/WCSE.2009.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a stochastic communication network with a ring topology and n vertices, where the operational probability of each link is independent and no failures happen to vertices, we expect to determine the most reliable source on the network. In this paper, we propose an efficient algorithm whose time complexity is O(n^2).\",\"PeriodicalId\":331155,\"journal\":{\"name\":\"2009 WRI World Congress on Software Engineering\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 WRI World Congress on Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSE.2009.31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 WRI World Congress on Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSE.2009.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

给定一个具有环形拓扑和n个顶点的随机通信网络，其中每个链路的运行概率是独立的，并且顶点不发生故障，我们期望确定网络上最可靠的源。本文提出了一种时间复杂度为O(n^2)的高效算法。

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

查看原文本刊更多论文

Computing the Most Reliable Source on Stochastic Ring Networks

Given a stochastic communication network with a ring topology and n vertices, where the operational probability of each link is independent and no failures happen to vertices, we expect to determine the most reliable source on the network. In this paper, we propose an efficient algorithm whose time complexity is O(n^2).

求助全文

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

来源期刊

2009 WRI World Congress on Software Engineering

自引率

0.00%

发文量