Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
IEEE/ACM Transactions on Networking (TON)
Generalized sharing in survivable optical networks
IEEE/ACM Transactions on Networking (TON)
A novel recursive shared segment protection algorithm in survivable WDM networks
Journal of Network and Computer Applications
Traffic recovery time constrained shared sub-path protection algorithm in survivable WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved quasi-path restoration in mesh networks
IEEE/ACM Transactions on Networking (TON)
Intelligent shared-segment protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
New insights on survivability in multi-domain optical networks
Information Sciences: an International Journal
Supporting multiple protection strategies in optical networks
IEEE/ACM Transactions on Networking (TON)
Information Sciences: an International Journal
An on-line routing algorithm of locally protected paths with exact reservations
CSN '07 Proceedings of the Sixth IASTED International Conference on Communication Systems and Networks
Incorporating protection mechanisms in the dynamic multi-layer routing schemes
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Availability formulations for segment protection
IEEE Transactions on Communications
Near optimal routing and capacity management for PWCE-based survivable WDM networks
Photonic Network Communications
QoS protection optimisation for MPLS
International Journal of Communication Networks and Distributed Systems
Preplanned restoration of multicast demands in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Switching/merging node placement in survivable optical networks with SSP
Computer Communications
Differentiated quality-of-recovery in survivable optical mesh networks using p-structures
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.07 |
The major challenges in designing survivable schemes are how to allocate a minimal amount of spare resources (e.g., bandwidth) using fast (e.g., polynomial-time) algorithms, and, in case a failure occurs, to be able to recover quickly from it. All existing approaches invariably make tradeoffs. We propose novel shared segment protection algorithms which make little or no compromise . We develop an elegant integer linear programming (ILP) model to determine an optimal set of segments to protect a given active path. Although the ILP approach is useful for a medium-size network, it is too time consuming for large networks. Accordingly, we also design a fast heuristic algorithm based on dynamic programming to obtain a near-optimal set of segments. Although the heuristic algorithm has a polynomial time complexity, it can achieve a bandwidth efficiency as high as some best-performing shared path protection schemes and, at the same time, much faster recovery than these shared path protection schemes. The proposed scheme is also applicable to a wide range of networking technologies, including Internet Protocol and wavelength-division multiplexing networks under the generalized multiprotocol label switched framework.