Inter-arrival Planning For Sub-graph Routing Protection In Wdm Networks

Abstract

We propose an inter-arrival planning strategy that strongly reduces path and wavelength reassignment in WDM networks protected by sub-graph routing. It has been recently demonstrated that Sub-Graph Routing Protection outperforms Backup Multiplexing in terms of blocking probability and link utilization. However, a major drawback is that upon occurrence of a link failure, even connections that do not traverse the faulty link may have to reassign their path or wavelength to accommodate others, interrupting the service. In this paper we show that offline inter-arrival planning of protection resources can efficiently reduce reassignment while preserving blocking performance. © Springer-Verlag 2004.3124328335Ramaswami, R., Sivarajan, K.N., (2002) Optical Networks: A Practical Perspective, , Morgan Kaufmann PublishersMohan, G., Murthy, C.S.R., Somani, A.K., Efficient algorithms for routing dependable connections in WDM optical networks (2001) IEEE/ACM Trans. Networking, 9, pp. 553-566Frederick, M.T., Somani, A.K., A single-fault recovery strategy for optical networks using subgraph routing (2003) Proc. ONDM'03, pp. 549-568Datta, P., Frederick, M.T., Somani, A.K., Sub-graph routing: A novel fault-tolerant architecture for shared-risk link group failures in WDM optical networks (2003) Proc. DRCN'03Ho, P.H., Mouftah, H.T., A novel distributed protocol for path selection in dynamic wavelength-routed WDM networks (2003) Kluwer Photonic Network Communications, 5, pp. 23-3