Paper Info
Title
On maximizing tree reliability based on minimum diameter spanning tree
Abstract
For communications networks, reliability is a crucial problem to provide stable services. Hence, this paper defines Maximum Availability Tree (MAT) problem that aims at composing the most reliable tree network in terms of terminal reliability. Our work indicates that MAT problem is converted to Minimum Diameter Spanning Tree (MDST) problem by modeling a network with a probabilistic graph whose edges are assigned probability indicating operability of corresponding communications links. The simulation results demonstrate that MAT improves reliability of communications between any pair of nodes in an obtained network.
Year
DOI
Venue
2014
10.1109/APCCAS.2014.7032853
Circuits and Systems
Keywords
Field
DocType
probability,telecommunication links,telecommunication network reliability,trees (mathematics),MAT problem,MDST problem,communication link network reliability improvement,maximum availability tree problem,minimum diameter spanning tree problem,probabilistic graph,probability indicating operability,service stability,terminal reliability,tree network reliability maximization,graph reliability,graph theory,terminal reliability,tree
Mathematical optimization,Telecommunications network,Distributed minimum spanning tree,Computer science,Operability,Linear programming,Spanning tree,Probabilistic logic,Tree network,Reliability theory
Conference
Citations 
PageRank 
References 
1
0.36
4
Authors
3
Name
Order
Citations
PageRank
Genya Ishigaki1467.69
Masao Yoshida210.36
Norihiko Shinomiya35019.15