Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels using Aggregated Link Usage Information

This paper presents new algorithms for dynamic routing of locally 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. Local restorability means that upon a link or node failure, the first node upstream from the failure must be able to switch the path to an alternate preset outgoing link so that path continuity with bandwidth guarantees is restored by a strictly local decision. The motivation for use of local restoration is that it is much faster than path restoration because failure information does not have to propagate to the source.