A passive protected self-healing mesh network architecture and applications
IEEE/ACM Transactions on Networking (TON)
Generalized loop-back recovery in optical mesh networks
IEEE/ACM Transactions on Networking (TON)
Protection cycles in mesh WDM networks
IEEE Journal on Selected Areas in Communications
Extending the p-cycle concept to path segment protection for span and node failure recovery
IEEE Journal on Selected Areas in Communications
Novel algorithms for shared segment protection
IEEE Journal on Selected Areas in Communications
Lightpath routing for intelligent optical networks
IEEE Network: The Magazine of Global Internetworking
Computer Networks: The International Journal of Computer and Telecommunications Networking
PXT-based path protection for multicast sessions in WDM networks
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Designing fast and bandwidth efficient protection scheme for WDM optical networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
| Hi-index | 0.00 |
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is exacerbated by the higher data rates available in optical networks. It is therefore imperative to address network survivability in an efficient manner in order to design and operate reliable networks. Transparent optical networks (TONs) provide several advantages over optically opaque networks for supporting the growing communication demands, but suffer from several drawbacks that reduce the efficacy of most applicable capacity-efficient survivability techniques. In this paper, we introduce a novel protection algorithm (for single link and node failures) called Streams. The Streams algorithm is similar to 1:1 dedicated path protection in terms of implementation and operation overhead, and has identical recovery speeds while requiring less capacity. We compare the Streams algorithm with dedicated and shared path protection in terms of capacity requirements, path lengths, and recovery time. We also extend the flooding based mesh restoration algorithm (FBMR) in order to provide a fair comparison in online routing scenarios, and report the relative tradeoffs between the different algorithms. Our results show that dynamically routed Streams offer attractive tradeoffs in terms of capacity, path length, recovery speed, data loss and implementation complexity.