High availability path design in ring-based optimal networks
IEEE/ACM Transactions on Networking (TON)
Fiber Network Service Survivability
Fiber Network Service Survivability
Towards Fault Recovery and Management inCommunication Networks
Journal of Network and Systems Management
High availability path design in ring-based optimal networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
There is growing interest on the part of networkoperators in the ability to analyze the availability ofpath implementations in their networks and to providevarious grades of assured service availability to customers. The calculation of availabilityis, however, considerably more complex in today's SONETring-based networks than in prior point-to-pointsystems. This is due both to the active protection nature of the rings and their dual-redundantinterconnect strategies. We show that there is also morethan one option for dual-ring interconnection and thata minimum cost high availability path implementation will generally involve a mixture ofmatched-node and explicitly dual fed treatments. Wedevelop an economic comparison of dual feeding (df) andmatched nodes (mn) in terms of the resource consumptionof each scheme and show that the choice can bemade on an individual ring-by-ring basis with a simpledecision criterion. We then develop expressions ofgeneral use for the end-to-end unavailability ofsingle-fed, pure df, mn and mixed df-mn path constructions.These results are a step towards on-line provisioning orpath planning systems that can minimize the pathimplementation cost subject to an assured target level of design availability.