Anaproach toGenerate AnEficent seto Candidate p-yclesinWD MeshNetworks

In thispaperwe proposea new framework forcomputing an efficient setofp-cycles whichcanlead tosuperior performance intermsofcapacity utilization in networkprotection. We first propose an algorithm forfinding allfundamental cycles. Then,thesetofcandidate p-cycles is constructed bymerging fundamental cycles. Thenumberof proposed candidate p-cycles issmallbuttheycanconstruct morestraddling linkandhavehighapriori efficiency. Finally, anILPmodelisemployed toselect anadequate setofp-cycles toensure100%protection whileminimizing thetotal spare capacity. Our numerical results showthatthenumberof (a)Anindividualp-Cycle candidate p-cycles generated isless than7% outofallpossible cycles forthetest networks andthesolutions areclose tooptimal. Indexterms- Networksurvivability, networkprotection, fundamental cycle, p-cycle, ILP