Minimization of Overall Blocking Probability for Traffic Grooming in Optical WDM Mesh Networks
Date Issued
2003
Date
2003
Author(s)
Kao, Mao-Yuan
DOI
en-US
Abstract
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.
Subjects
路由
波長分配
規劃
多波長分工網路
網路
數學規劃
阻塞
日鬆弛法
機率
最佳化
拉
格蘭
Traffic Grooming
Lagrangean Relaxation
Mathematical Programming
Wavelength Assignment
Blocking Probability
Optimization
Network Planning
Routing
WDM
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-92-R90725057-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):b72f1cfc6ebf73fa00441bb23c96c1bf