The problem of fast restoration of lost transport facilities between nodes of the growing high-
capacity fiber network has recently emerged as a principle concern of both network …

Telecommunication fiber networks can be more complicated than the traditional graph-
theoretic networks of nodes and links. This is due to practical and economic considerations …

The problem of finding shortest paths arises in many contexts; testing restoration algorithms
and developing design packages for large telecommunications networks are two cases …

Fast restoration of broadband optical fiber networks from multiple-link and node failures, as
well as single-link failures, is addressed. A distributed restoration algorithm based on …

A technique that combines benefits of fast, distributed heuristics and of centralized optimal
algorithms is proposed. As a form of preplanning, whenever the topology of the network is …

This paper describes the dynamic K-shortest path (DKSP) algorithm for distributed facility
restoration and its performance in a simulation of AT&T's high-capacity digital facilities …

This paper investigates the shortest paths tree problem taking single link failure into account.
Let G be a graph modeled by network with vertex set V and edge set E. Given a specified …

The authors present a fast distributed network restoration algorithm for restoring disrupted
traffic in a digital cross-connect system (DCS) based fiber network due to fiber span cut. The …

Intelligent transmission network elements such as digital cross connect systems and
add/drop multiplexers enable network restoration by dynamic reconfiguration of the network …

Path restoration scheme can be used in augmenting existing telecommunication networks
with adequate spare capacity to achieve a desired level of protection against link failures …