Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Dynamic establishment of restorable connections using p-cycle protection in WDM networks
Optical Switching and Networking
Extending the p-cycle concept to path segment protection for span and node failure recovery
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The p-cycle design problem has been extensively studied because it can provide both ring-like fast self-protection speed and spare capacity efficiency of path protection scheme. However, p-cycle provisioning for dynamic traffic has not been fully addressed. Most related works have not considered link capacity in the construction of p-cycles, which may cause problems in practice because the protection paths may not have enough backup bandwidth. In this paper, with the consideration of link capacity, we present a sufficient and necessary condition that guarantees p-cycles for providing enough protection bandwidth. Based on this condition, we propose an effective solution to provide connections for dynamic requests with the property that each link used for a connection is protected by a p-cycle. Simulation results show that our dynamic p-cycle provisioning solution outperforms the traditional path protection scheme.