Efficient algorithms for routing dependable connections in WDM optical networks
IEEE/ACM Transactions on Networking (TON)
New options and insights for survivable transport networks
IEEE Communications Magazine
IEEE Communications Magazine
Self-protecting networking using dynamic p-cycle construction within link capacity constraint
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Self-protecting networking using dynamic p-cycle construction within link capacity constraint
Security and Communication Networks
| Hi-index | 0.00 |
Dynamic establishment of restorable connections in WDM networks is an important problem that has received much study. We propose a dynamic restorable connection establishment scheme that uses p-cycles to protect a connection's working lightpath. For a given connection request, our scheme first computes a working lightpath and then computes a set of p-cycles to protect the links on the working lightpath so that the connection can survive any single link failure. The key advantage of the proposed scheme is that it enables fast failure recovery while requiring very simple online computation at connection establishment time. Our scheme consists of three components for connection establishment: offline computation of primary cycles, online computation of the working lightpath, and online computation of p-cycles for working lightpath protection. Our scheme also includes a connection teardown procedure that computes and releases all p-cycles that are no longer needed. Simulation study shows that our scheme significantly outperforms an existing p-cycle-based dynamic restorable connection establishment scheme.