A Novel Algorithm for Freeing Network from Points ofFailure

摘要

A network design may have many points of failure, the failure of any of whichbreaks up the network into two or more parts, thereby disrupting the communication betweenthe nodes. This paper presents a heuristic for making an existing network more reliable byadding new communication links between certain nodes. The algorithm ensures the absence ofany point of failure after addition of addition of minimal number of communication links de- determinedby the algorithm. The paper further termined presents theoretical proofs and results whichprove the minimality of the number of new links added in the network.