Routing design of tree‐shaped local public communication networks with high reliability and low cost
暂无分享,去创建一个
This paper discusses reliability problems for local public communication networks such as cable television networks and the subscriber‐loops of telecommunication networks. They have tree‐shapes and expand continuously as new customers join. By introducing a simple model, it is shown that most principal reliability measures and cost measures for such networks can be described through the networks' graphical characteristic quantities. Extensive simulations show that the prior provision of trunk pipes and a suitable choice of the route selecting rule for new customers are effective in constructing a highly reliable network with low cost.
[1] Charles J. Colbourn,et al. The Combinatorics of Network Reliability , 1987 .
[2] A. Satyanarayana,et al. Efficient algorithms for reliability analysis of planar networks - a survey , 1986, IEEE Transactions on Reliability.
[3] Yukio Takahashi,et al. Horton's and Strahler's Laws (Natural Laws in River Networks) in Telecommunication Networks , 1994 .
[4] D. Shier. Network Reliability and Algebraic Structures , 1991 .