Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9715
Title: PERFORMANCE STUDY- OF DISTRIBUTED PATH RESTORATION PROTOCOLS
Authors: Mazumdar, Saumitra
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;DISTRIBUTED PATH RESTORATION PROTOCOLS;ATM;TRANSPORT NETWORK
Issue Date: 2001
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.
URI: http://hdl.handle.net/123456789/9715
Other Identifiers: M.Tech
Research Supervisor/ Guide: Sarje, A. K.
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECDG10443.pdf3.48 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.