| 000 | 03464cas|a2200397 a 4500 | ||
|---|---|---|---|
| 005 | 20260818090233.0 | ||
| 008 | 090115s2007 th uu|m rtt 0| a1eng d | ||
| 035 | _a.b12044568 | ||
| 099 | 9 | _aAIT Diss. no.TC-07-01 | |
| 100 | 0 | _aAreeyata Sripetch | |
| 245 | 1 | 0 | _aDesign of DWDM networks for power utilities |
| 260 |
_aPathum Thani, Thailand : _bAsian Institute of Technology, _c2007 |
||
| 300 |
_a108 leaves : _bill. |
||
| 490 | 1 |
_aDissertation ; _vno. TC-07-01 |
|
| 500 | _aA dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Engineering in Telecommunications, School of Engineering and Technology | ||
| 502 | _aThesis (Ph.D.) - Asian Institute of Technology, 2007 | ||
| 520 | _aOn top of a power grid used to distribute electricity, a dense wavelength division multiplexing (DWDM) based optical network can be constructed to be a scalable backbone network that can reach almost all remote areas of the country. This dissertation proposes a complete optimization procedure for optical network design based on an existing power grid. We design a network as a sub graph of the power grid and divide the network topology into two layers: backbone and access networks. The design procedure includes physical topology design, routing and wavelength assignment (RWA) and optical amplifier placement. We formulate the problem of topology design into two steps: selecting the concentrator nodes with their node members and finding the connections among concentrators subject to the two-connectivity constraint on the resultant backbone topology. These two problems are formulated as integer linear programming (ILP) problems. Since the ILP problem for the concentrator connection problem grows intractable for large networks, a heuristic algorithin is developed. For RWA and optical amplifier placement problem, we solve these two problems together since they are closely related. As the ILP for solving these two problems becomes intractable with increasing network size, we propose a simulated annealing approach. We choose a neighborhood structure based on path-switching operations using k shortest paths for each source and destination pair. The optimal number of optical ilmplifiers is solved based on local search among these neighbors. We solve and present numerical results for 3D-node and IDO-node randomly generated power grid topologies and for actual EGAT's power grid topology. | ||
| 650 | 0 | _aTopology | |
| 650 | 0 | _aSimulated annealing (Mathematics) | |
| 700 | 0 |
_aPoompat Saengudomlert, _eChairperson |
|
| 700 | 1 |
_aErke, Tapio J., _eExamination Committee |
|
| 700 | 1 |
_aDutta, Joydeep, _eExamination Committee |
|
| 700 | 1 |
_aChan, Vincent W.S., _eExamination committee |
|
| 810 | 2 |
_aAsian Institute of Technology. _tDissertation ; _vno. TC-07-01 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B00854 |
||
| 907 |
_a.b12044568 _bmnait _cu |
||
| 902 | _a240507 | ||
| 998 |
_b0 _c090115 _dm _ea _fu _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 942 | _c22 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050120565493 _bCREATED : 2012-08-31 _cRECORD # : i12691860 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120235170 _bCREATED : 2016-03-29 _cRECORD # : i12911173 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c27351 _d27351 |
||