Optimized k-shortest-paths algorithm for facility restoration
Software—Practice & Experience
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
IEEE/ACM Transactions on Networking (TON)
Fiber Network Service Survivability
Fiber Network Service Survivability
SONET/SDH: A Sourcebook of Synchronous Networking
SONET/SDH: A Sourcebook of Synchronous Networking
Combined Ring–Mesh Optical Transport Networks
Cluster Computing
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
To date, mesh network design theory has beendeveloped for the case where working and protectioncapacity is terminated at every node. It is recognizedthat express routes, which bypass some nodes en-route, would decrease the total DCS port costs but ithas been unclear how to incorporate bypass planning inthe optimal spare capacity design for a mesh-restorablenetwork. An important issue is whether the introduction of nodal bypass will increase the total sparecapacity needed for restorability, due to a reduction ofrestoration re-routing flexibility. To address thesequestions, we introduce the forcer concept for analysis of the relationship between workingand spare capacity in a mesh-restorable network. Weapply the forcer concept to show theoretically whybypass in fact need never require an increase in sparing and may actually permit a decrease in somecases. In tests to validate and exploit these findings,an average reduction of 12% in total spare capacity and16% in DCS port count totals were obtainedsimultaneously with an Integer Programming optimization. Thesesavings are relative to an already optimized fullyterminated network design. The work thus contributes togreater theoretical understanding and designcost-effectiveness for mesh-based restorable networks.