Inter-arrival Planning for Sub-graph Routing Protection in WDM Networks
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.
KeywordsOptical Network Network Event Link Failure Connection Request Backup Path
Unable to display preview. Download preview PDF.
- 1.Ramaswami, R., Sivarajan, K.N.: Optical Networks: a Practical Perspective. Morgan Kaufmann Publishers, San Francisco (2002)Google Scholar
- 3.Frederick, M.T., Somani, A.K.: A single-fault recovery strategy for optical networks using subgraph routing. In: Proc. ONDM 2003, pp. 549–568 (2003)Google Scholar
- 4.Datta, 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. In: Proc. DRCN 2003 (2003)Google Scholar