Computing the Most Reliable Source on Stochastic Ring Networks

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).