On the benefits of multi-path recovery in flexgrid optical networks
- 212 Downloads
- 9 Citations
Abstract
We propose a new recovery scheme, called multi-path recovery (MPR), specifically designed for flexgrid-based optical networks. It combines protection and restoration schemes to jointly recover, in part or totally, the bitrate requested by client demands in case of failure. We define the bitrate squeezed recovery optimization (BRASERO) problem to maximize the amount of bitrate which is recovered in case of failure of any single fiber link; a mixed integer linear programming formulation for the BRASERO problem is provided. However, since their exact solutions become impractical when real-sized network and traffic instances are considered, we develop a heuristic algorithm which provides a much better trade-off between optimality and complexity. Exhaustive numerical experiments carried out over realistic network topologies and traffic scenarios show that the efficiency of the proposed MPR scheme approaches that of restoration while providing recovery times as short as protection schemes.
Keywords
Flexgrid optical networks Multi-path Recovery Bitrate squeezing Network optimizationNotes
Acknowledgments
The research leading to these results has received funding from the European Community’s Seventh Framework Programme FP7/2007-2013 under grant agreement no. 317999 IDEALIST project. Moreover, it was supported by the Spanish science ministry through the TEC2011-27310 ELASTIC project.
References
- 1.Grover, W.: Mesh-Based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall, Upper Saddle River (2003)Google Scholar
- 2.Velasco, L., Agraz, F., Martínez, R., Casellas, R., Spadaro, S., Muñoz, R., Junyent, G.: GMPLS-based multi-domain restoration: analysis, strategies, policies and experimental assessment. IEEE/OSA J. Opt. Commun. Netw. 2, 427–441 (2010)CrossRefGoogle Scholar
- 3.Velasco, L., Spadaro, S., Comellas, J., Junyent, G.: Shared-path protection with extra-traffic in ASON/GMPLS ring networks. OSA J. Opt. Netw. 8, 130–145 (2009)CrossRefGoogle Scholar
- 4.Jinno, M., Takara, H., Kozicki, B., Tsukishima, Y., Sone, Y., Matsuoka, S.: Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies. IEEE Commun. Mag. 47, 66–73 (2009)CrossRefGoogle Scholar
- 5.Jinno, M., Kozicki, B., Takara, H., Watanabe, A., Sone, Y., Tanaka, T., Hirano, A.: Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network. IEEE Commun. Mag. 48, 138–145 (2010)CrossRefGoogle Scholar
- 6.Wang, X., Zhang, Q., Kim, I., Palacharla, P., Sekiya, M.: Blocking performance in dynamic flexible grid optical networks—What is the ideal spectrum granularity? In: Proceedings of the IEEE/OSA ECOC (2011)Google Scholar
- 7.Sone, Y., Watanabe, A., Imajuku, W., Tsukishima, Y., Kozicki, B., Takara, H., Jinno, M.: Bandwidth squeezed restoration in spectrum-sliced elastic optical path networks (SLICE). IEEE/OSA J. Opt. Commun. Netw. 3, 223–233 (2011)CrossRefGoogle Scholar
- 8.Tak, S., Park, E.: Restoration performance study of k-shortest disjoint paths in WDM optical networks. Telecommun. Syst. J. 34, 13–26 (2007)CrossRefGoogle Scholar
- 9.Eiger, M., Luss, H., Shallcross, D.: Network restoration under a single link or node failure using preconfigured virtual cycles. Telecommun. Syst. J. 46, 17–30 (2011)CrossRefGoogle Scholar
- 10.Chen, X., Chamania, M., Jukan, A., Drummond, A., Fonseca, N.: A multipath routing mechanism in optical networks with extremely high bandwidth requests. In: Proceedings of the IEEE GLOBECOM (2009)Google Scholar
- 11.Pages, A., Perello, J., Spadaro, S.: Lightpath fragmentation for efficient spectrum utilization in dynamic elastic optical networks. In: Proceedings of the IEEE ONDM (2012)Google Scholar
- 12.Huang, S., Martel, C., Mukherjee, B.: Survivable multipath provisioning with differential delay constraint in telecom mesh networks. IEEE/ACM Trans. Netw. 19, 657–669 (2011)CrossRefGoogle Scholar
- 13.Das, A., Martel, C., Mukherjee, B.: A partial-protection approach using multipath provisioning. In: Proceedings of the IEEE ICC (2009)Google Scholar
- 14.Vadrevu, C., Wang, R., Mukherjee, B.: Degraded services in mixed-line-rate networks using multipath routing. In: Proceedings of the ANTS (2011)Google Scholar
- 15.Vadrevu, C., Wang, R., Tornatore, M., Martel, C., Mukherjee, B.: Survivable provisioning in mixed-line-rate networks using multipath routing. In: Proceedings of the OSA OFC (2012)Google Scholar
- 16.Clouqueur, M., Grover, W.: Mesh-restorable networks with enhanced dual-failure restorability properties. Photon. Netw. Commun. 9, 7–18 (2005)CrossRefGoogle Scholar
- 17.Gonçalves, J., Resende, M.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17, 487–525 (2011)CrossRefGoogle Scholar
- 18.Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, Amsterdam (2004)MATHGoogle Scholar
- 19.Velasco, L., Klinkowski, M., Ruiz, M., Comellas, J.: Modeling the routing and spectrum allocation problem for flexgrid optical networks. Photon. Netw. Commun. 24, 177–186 (2012)CrossRefGoogle Scholar
- 20.Wang, Y., Cao, X., Pan, Y.: A study of the routing and spectrum allocation in spectrum-sliced elastic optical path networks. In: Proceedings of IEEE INFOCOM (2011)Google Scholar
- 21.
- 22.Ruiz, M., Pedrola, O., Velasco, L., Careglio, D., Fernndez-Palacios, J., Junyent, G.: Survivable IP/MPLS-over-WSON multilayer network optimization. IEEE/OSA J. Opt. Commun. Netw. 3, 629–640 (2011)CrossRefGoogle Scholar
- 23.Ou, C., Zhang, J., Zang, H., Sahasrabuddhe, L., Mukherjee, B.: New and improved approaches for shared-path protection in WDM mesh networks. IEEE/OSA J. Lightwave Technol. 22, 1223–1232 (2004)CrossRefGoogle Scholar
- 24.Castro, A., Velasco, L., Ruiz, M., Klinkowski, M., Fernández-Palacios, J.P., Careglio, D.: Dynamic routing and spectrum (re)allocation in future flexgrid optical networks. Comput. Netw. 56, 2869–2883 (2012)CrossRefGoogle Scholar
- 25.Suurballe, J.W., Tarjan, R.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325–336 (1984)MathSciNetCrossRefMATHGoogle Scholar