Minimization of Overall Blocking Probability for Traffic Grooming in Optical WDM Mesh Networks

• Main Authors: Mao-Yuan Kao, 高茂原
• Other Authors: 林永松
• Format: Others
• Language: en_US
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/93691152370756329443

碩士 === 國立臺灣大學 === 資訊管理學研究所 === 92 === Recently, wavelength division multiplexing (WDM) has been considered as a promising transmission technology in optical communication networks. Researchers and optical networking industries are now trying to find a way to support multiple low-speed traffic streams onto a single high-speed wavelength in order to minimize the network-wide cost in terms of line terminating equipment and electronic switching. In the proposed research, the problem of traffic grooming in optical WDM networks is studied. The problem is formulated as a combinatorial optimization problem, of which the objective function is to minimize the total traffic blocking probability upon the underlying WDM mesh network subject to physical link capacity constraints, wavelength continuity constraints, and wavelength add/drop port constraints The decision variables in the formulations include traffic requirement routing design, WDM layer lightpath routing assignment and WDM layer wavelength assignment. The basic approach to the algorithm development for this thesis is Lagrangean relaxation in conjunction with a number of optimization techniques. We evaluate the performance for different network topologies.