Abstract
Information networks are required to be reliable. It is important to design robust networks that are resistant to network failure. For that propose, it is necessary to decrease the failure probability of links by the backup resource and the fast recovery mechanism and so on. However, it costs very much to protect all the links. Therefore, it is necessary to preferentially protect only some highly required links and improve the reliability of the entire network. In this paper, we consider the simultaneously failure of links. A set of links has the probability that all the links in the set simultaneously are broken. When a family of the sets is given, we address the network design maximizing the network reliability (the probability that the entire network is connected) by protecting the limited number of links. We formulate this network design problem and propose a polynomial-time heuristic algorithm. Furthermore, we evaluate the performance by using the topology of some actual information networks, and we show that the proposed algorithm works well.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
