Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/9715
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mazumdar, Saumitra | - |
dc.date.accessioned | 2014-11-20T06:31:15Z | - |
dc.date.available | 2014-11-20T06:31:15Z | - |
dc.date.issued | 2001 | - |
dc.identifier | M.Tech | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/9715 | - |
dc.guide | Sarje, A. K. | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.subject | ELECTRONICS AND COMPUTER ENGINEERING | en_US |
dc.subject | DISTRIBUTED PATH RESTORATION PROTOCOLS | en_US |
dc.subject | ATM | en_US |
dc.subject | TRANSPORT NETWORK | en_US |
dc.title | PERFORMANCE STUDY- OF DISTRIBUTED PATH RESTORATION PROTOCOLS | en_US |
dc.type | M.Tech Dessertation | en_US |
dc.accession.number | G10443 | en_US |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ECDG10443.pdf | 3.48 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.