A Capacity Efficient Local Protection Scheme for Bandwidth Guaranteed Connections

Abstract

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.