DocumentCode
3583807
Title
Computing the Most Reliable Source on Stochastic Ring Networks
Author
Ding, Wei
Author_Institution
Zhejiang Water Conservancy & Hydropower Coll., Hangzhou, China
Volume
1
fYear
2009
Firstpage
345
Lastpage
347
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, 2009. WCSE '09. WRI World Congress on
Print_ISBN
978-0-7695-3570-8
Type
conf
DOI
10.1109/WCSE.2009.31
Filename
5319123
Link To Document