Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration

— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a priori knowledge of future arrivals, and so necessitating use of on-line algorithms. Restorability implies that to successfully route a path set-up request both an active path and an alternate link (node) disjoint backup path have to be routed at the same time. This joint on-line routing problem is becoming particularly important in optical networks and in MPLS (Multi Protocol Label Switching) based networks due to the trend in backbone networks toward dynamic provisioning of bandwidth guaranteed or wavelength paths. A straightforward solution for the restoration problem is to find two disjoint paths. However, this results in excessive resource usage for backup paths and does not satisfy the implicit service provider requirement of optimizing network resource utilization so as to increase the number of potenti...

• Type: Conference
• Year: 2000
• Where: INFOCOM
• Authors: Murali S. Kodialam, T. V. Lakshman
• Keywords: Backup Paths, Communications, Dynamic Routing, INFOCOM 2000, Routing