Capacity Efficient Shared Protection and Fast Restoration Scheme in Self-Configured Optical Networks
At present one can observe the increasing dependency of society on large-scale complex networked systems. The consequences of faults of network elements are magnified by rapidly growing bandwidth of links and nodes.
In this paper, a novel SCPO heuristic algorithm of establishing survivable connections in wide-area networks, that optimizes the level of resource (link capacity) utilization, is proposed. Unlike many popular optimization methods, it guarantees fast restoration of connections. The key idea is to keep backup paths the shortest by performing the optimization after establishing the connections. The proposed a posteriori optimization is based on the Largest-First graph coloring heuristics. The model is dedicated to static traffic pattern and preplanned survivability scheme.
The algorithm was evaluated for the US Long-Distance Network and compared to the earlier resource utilization optimization approaches. The results show that with only a little capacity utilization degradation, fast restoration can be achieved. The observed reduction in restoration time values is significant (up to 41%). Presented solutions are dedicated to WDM-based optical communications network architectures.
KeywordsLink Capacity Active Path Survivable Network Backup Path Link Cost
Unable to display preview. Download preview PDF.
- 1.Assi, C., Ye, Y., Shami, A., Dixit, S., Ali, M.: Efficient Path Selection and Fast Restoration Algorithms for Shared Restorable Optical Networks. In: ICC 2003 - IEEE International Conference on Communications, vol. 26(1), pp. 1412–1416 (2003)Google Scholar
- 4.Ellison, R.J., Fisher, D.A., Linger, R.C., Lipson, H.F., Longstaff, T., Mead, N.R.: Survivable Network Systems: An Emerging Discipline. Carnegie Mellon University, Software Engineering Institute, Technical Report CMU/SEI-97-TR-013 (Rev. 1999) (1997)Google Scholar
- 5.Hauser, O., Kodialam, M., Lakshman, T.V.: Capacity Design of Fast Path Restorable Optical Networks. IEEE INFOCOM 2, 817–826 (2002)Google Scholar
- 8.Kodialam, M., Lakshman, T.V.: Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels Using Aggregated Link Usage Information. IEEE INFOCOM, 376–385 (2001)Google Scholar
- 9.Kubale, M., et al.: Models and Methods of Graph Coloring. WNT (in Polish) (2002)Google Scholar
- 11.Mead, N.R., Ellison, R.J., Linger, R.C., Longstaff, T., McHugh, J.: Survivable Network Analysis Method. Carnegie Mellon University, Software Engineering Institute, Technical Report CMU/SEI-2000-TR-013 (2000)Google Scholar
- 12.Molisz, W.: Survivability Issues in IP-MPLS Networks. Systems Science 32 (to appear, 2006)Google Scholar
- 14.Qiao, C., et al.: Novel Models for Efficient Shared Path Protection. In: OFC, pp. 545–547 (2002)Google Scholar
- 15.Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part I – Protection. IEEE INFOCOM, 744–751 (1999)Google Scholar
- 16.Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part II – Restoration. In: Proc. IEEE Integrated Circuits Conference, pp. 2023–2030 (1999)Google Scholar
- 18.Wang, H., Li, J., Hong, P.: RSVP-TE Fast Restoration Scheme for Meshed IPO All-optical Networks, pp. 830–834. IEEE, Los Alamitos (2002)Google Scholar