Please use this identifier to cite or link to this item:
Survivable routing in WDM networks with guaranteed minimum network bandwidth
|M.S.Q111.H3_4225 AUG 2007_r.pdf||Version for non-UH users. Copying/Printing is not permitted||1.21 MB||Adobe PDF||View/Open|
|M.S.Q111.H3_4225 AUG 2007_uh.pdf||Version for UH users||1.21 MB||Adobe PDF||View/Open|
|Title:||Survivable routing in WDM networks with guaranteed minimum network bandwidth|
|Keywords:||Wavelength division multiplexing|
Routing (Computer network management)
|Abstract:||In IP over WDM networks, IP links are realized by subscribing to lightpath services from a WDM network. Survivability is a key issue in designing such networks. There are two kinds of Lightpath services available: protected and unprotected. The research in  mainly considers the cases in which the only constraint is that the IP network remains connected after any single fiber-link failure. The problem was formulated into a mixed integer linear programming (MILP) problem. This thesis considers the additional requirement of a minimum survivable network bandwidth, and incorporates this as a criterion into the network design. First a new MILP formulation is proposed which satisfies the minimum survivable network bandwidth requirements. In addition, the computational requirement for the MILP is measured in simulations. Simulations show that the MILP has reasonable computation costs for small to moderate size networks. These costs increase with the increase of survivable bandwidth requirements.|
|Description:||Thesis (M.S.)--University of Hawaii at Manoa, 2007.|
Includes bibliographical references.
vi, 47 leaves, bound ill. 29 cm
|Rights:||All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.|
|Appears in Collections:||M.S. - Electrical Engineering|
Please contact email@example.com if you need this content in an alternative format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.