A Capacity Efficient Local Protection Scheme for Bandwidth Guaranteed Connections

Dynamic provisioning of bandwidth guaranteed connections with protection against single link failures is an important issue in connection-oriented networks. The most capacity efficient protection scheme proposed in literature is end-to-end protection where a backup path is provided between the source node and the destination node of the service path. A drawback of end-to-end protection is slow restoration speed, which can be overcome with local protection where each link on the service path has a backup path originated from the upstream end node of the link. However, the capacity efficiency of local protection is much lower than that of end-to-end protection. In this paper, we present a new algorithm for dynamic routing of bandwidth guaranteed connections using local protection. The key feature of our algorithm is that it provides efficient bandwidth utilization by exploiting bandwidth sharing among service paths and backup paths in addition to exploiting bandwidth sharing among backup paths. Simulation results show that the performance of our algorithm is fairly close to that of the end-to-end protection algorithm in terms of total capacity consumption under incremental traffic and our algorithm outperforms the end-to-end protection algorithm in terms of total earning under dynamic traffic.

[1]  Chang Liu,et al.  A dynamic routing algorithm with load balancing heuristics for restorable connections in WDM networks , 2004, IEEE Journal on Selected Areas in Communications.

[2]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Chunming Qiao,et al.  Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .

[5]  Biswanath Mukherjee,et al.  Near-optimal approaches for shared-path protection in WDM mesh networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[6]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Chunming Qiao,et al.  Distributed partial information management (DPIM) schemes for survivable networks .1 , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Chunming Qiao,et al.  An ultra-fast shared path protection scheme - distributed partial information management, part II , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[9]  Xun Su,et al.  An online distributed protection algorithm in WDM networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[10]  Zhi Liu,et al.  Upstream node initiated fast restoration in MPLS networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.