Please use this identifier to cite or link to this item:
Traffic grooming in WDM networks
|uhm_ms_3835_uh.pdf||Version for UH users||950.92 kB||Adobe PDF||View/Open|
|uhm_ms_3835_r.pdf||Version for non-UH users. Copying/Printing is not permitted||951.1 kB||Adobe PDF||View/Open|
|Title:||Traffic grooming in WDM networks|
|Advisor:||Sasaki, Galen H|
|Issue Date:||Dec 2003|
|Publisher:||University of Hawaii at Manoa|
|Abstract:||Wavelength Division Multiplexing (WDM) is the promising technology, which provides very wide bandwidths to support the exponential growth of lnternet traffic. A major part of the WDM network cost is the cost of opto-electronic switching components. By grooming low speed traffic connections efficiently onto the lightpaths, the cost of the WDM network can be reduced significantly. In the first part of the thesis, different WDM ring network architectures under a non-statistical traffic model are considered. The average number of Line Terminating Equipments (LTEs) required per node in these networks is significantly lower when compared to a ring network with opaque nodes. To utilize the bandwidth efficiently, the low speed traffic connections have to be rearranged by bridge and roll. In the second part of the thesis, grooming in WDM mesh networks under a static traffic model is considered. The main objective here is to minimize the total lightpaths required. A greedy heuristic algorithm for the lightpath minimization problem is presented.|
|Description:||viii, 35 leaves|
|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.