PERFORMANCE STUDY- OF DISTRIBUTED PATH RESTORATION PROTOCOLS

Abstract

The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. In the development of technologies for span failure restoration, rerouting realizing the k-successively shortest link disjoint paths (KSP) may be faster, easier, and, in distributed implementation, more robust than a distributed counterpart for Max-Flow. We provide a method for capacity optimization of path restorable networks, which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM). -Restorability of the network has been considered as the benchmark to compare the K-shortest path and Max-Flow path restoration. In this dissertation, we discuss and implement' a new .path restoration algorithm that takes into account the mutual capacity constraints during the restoration time. Further, both the K-shortest path and Max-Flow approaches have been implemented using the interference heuristic approach. The simulation work for the implementation of the algorithms has been done using C++ language under the DOS platform.