Priority-Enabled Optimization of Resource Utilization in Fault-Tolerant Optical Transport Networks
In this paper, a novel SCMTO heuristic algorithm of establishing survivable connections in wide-area networks, that jointly optimizes the level of resource utilization as well as the time of connection restoration, is proposed. The algorithm is dedicated to multipriority traffic. Two service classes are assumed, referred to as low and high priority, respectively. Unlike typical optimization methods, SCMTO algorithm also guarantees fast service restoration by processing the high-priority connections with the author’s a posteriori optimization, based on the Largest-First graph coloring heuristics.
The algorithm was evaluated for the US Long-Distance Network. The results show that with only little capacity utilization degradation, fast restoration can be achieved. Compared to the results of the typical a priori optimization, the obtained average values of connection restoration time were up to 20% shorter (and even up to 41% for the high-priority traffic only). They were achieved together with reduction in resource utilization ratio up to 48%.
Presented solutions are dedicated to WDM-based high-performance optical communications network architectures.
KeywordsResource Utilization Wavelength Division Multiplex Active Path Survivable Network Backup Path
Unable to display preview. Download preview PDF.
- 2.Ellison, R.J., Fisher, D.A., Linger, R.C., Lipson, H.F., Longstaff, T., Mead, N.R.: Survivable Network Systems: An Emerging Discipline. Technical Report CMU/SEI 97 TR 013. Carnegie Mellon University, Software Engineering Institute (1997) (Rev. 1999)Google Scholar
- 3.Hauser, O., Kodialam, M., Lakshman, T.V.: Capacity Design of Fast Path Restorable Optical Networks. IEEE INFOCOM 2, 817–826 (2002)Google Scholar
- 6.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
- 7.Kubale, M., et al.: Models and Methods of Graph Coloring. WNT (in Polish, 2002)Google Scholar
- 8.Mead, N.R., Ellison, R.J., Linger, R.C., Longstaff, T., McHugh, J.: Survivable Network Analysis Method. Technical Report CMU/SEI-2000-TR-013. Carnegie Mellon University, Software Engineering Institute (2000)Google Scholar
- 12.Qiao, C., et al.: Novel Models for Efficient Shared Path Protection. OFC, 545–547 (2002)Google Scholar
- 13.Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part I - Protection. IEEE INFOCOM, 744–751 (1999)Google Scholar
- 14.Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part II - Restoration. In: Proc. IEEE Integrated Circuits Conference, pp. 2023–2030 (1999)Google Scholar