A Novel Algorithm for Freeing Network from Points of Failure

A network design may have many points of failure, the failure of any of which breaks up the network into two or more parts, thereby disrupting the communication between the nodes. This paper presents a heuristic for making an existing network more reliable by adding new communication links between certain nodes. The algorithm ensures the absence of any point of failure after addition of addition of minimal number of communication links determined by the algorithm. The paper further presents theoretical proofs and results which prove the minimality of the number of new links added in the network.

[1]  G. A. Ray,et al.  Reliability of network topologies , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[2]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[3]  Debashis Saha,et al.  An efficient algorithm for designing optimal backbone topology for a communication networks , 2003, International Conference on Communication Technology Proceedings, 2003. ICCT 2003..

[4]  M.R. Shikh-Bahaei,et al.  Interference cancellation in W-CDMA cellular structures using statistical processing , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[5]  Ellis Horowitz,et al.  Fundamentals of data structures in C , 1976 .

[6]  Andrew S. Tanenbaum,et al.  Computer networks, 4th Edition , 2002 .

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  Noriaki Kamiyama.  Network Topology Design Using Data Envelopment Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[9]  Alice E. Smith,et al.  Efficient optimization of all-terminal reliable networks, using an evolutionary approach , 1997 .

[10]  Radia Perlman,et al.  Interconnections: Bridges, Routers, Switches, and Internetworking Protocols , 1999 .