• Abhay Bhandari

In this work, a recovery strategy is planned which utilizes reactive way to deal with single connection failure. This Proposed technique uses Dijkstra's calculation to locate the most shortest way between two nodes in a given system and if there should arise an occurrence of failure of any connection on the working connection all the adjoining cycles between end nodes of the fizzled connection are determined. From the discovered contiguous cycles the shortest nearby cycle is discovered which comprises of the source and destination nodes of the fizzled connection. At that point the neighboring nodes relating to the fizzled connection changes from the fizzled connection to the recently discovered working connection to re-set up the system. After reclamation of fizzled connection every contiguous node of the fizzled interface refresh their cycles. Rebuilding time is likewise figured to discover time required to reestablish fizzled connect. The proposed strategy is tried in MATLAB by contrasting aftereffects of proposed method and existing link disjoint method.

Dijkstra’s Algorithm, Link disjoint, Survivability, Single link failure, restoration.

"SURVIVABILITY IN OPTICAL MESH NETWORKS DURING SINGLE LINK FAILURE", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.1113-1118, January 2019, Available :http://www.jetir.org/papers/JETIRDY06185.pdf

"SURVIVABILITY IN OPTICAL MESH NETWORKS DURING SINGLE LINK FAILURE", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp1113-1118, January 2019, Available at : http://www.jetir.org/papers/JETIRDY06185.pdf