Title :
Computing the Most Reliable Source on Stochastic Ring Networks
Author_Institution :
Zhejiang Water Conservancy & Hydropower Coll., Hangzhou, China
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(n2).
Keywords :
probability; stochastic processes; telecommunication network topology; probability; ring topology; stochastic communication network; stochastic ring network; Clocks; Communication networks; Computer networks; Network topology; Routing; Software engineering; Stochastic processes; Telecommunication network reliability; Tree graphs; Water conservation;
Conference_Titel :
Software Engineering, 2009. WCSE '09. WRI World Congress on
Print_ISBN :
978-0-7695-3570-8
DOI :
10.1109/WCSE.2009.31
