000 03745nas|a2200457 i 4500
005 20260818085311.0
008 050799s1998 th uzm rtt 00| a1eng d
035 _a.b1175431x
099 9 _aAIT Thesis no.TC-98-05
100 1 _aLaskar, Imdad
245 1 0 _aCost-effective topologies for regional optical networks using genetic algorithms with multiple fitness criteria
260 _aBangkok :
_bAsian Institute of Technology,
_c1998
300 _a69 p.
490 1 _aThesis ;
_vno. TC-98-05
500 _aA thesis submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Advanced Technologies
502 _aThesis (M.Eng.) - Asian Institute of Technology, 1998
520 _aThe optimum network planning methods are necessary when designing optical networks so as to minimize the overall network cost while providing an acceptable performance levels of the network. The problem is of relevance as because in recent years, there has been a major stride in the development of optical networks, which provide both switching and transmission within the optical domain and also offers an extremely large bandwidth. This study considers together the network design considerations of maximum propagation delay, traffic capacity requirements between the nodes, overall network reliability and network survivability for the optimization of an Optical Network. All these network design considerations have been integrated to a minimal set of constraints for optimization. The Genetic Algorithm (GA) is used as the optim1zation tool to obtain the minimal cost physical topology design. The cost of the network is considered as a function of the total length of the fiber to be used and the total node degree of the network. The algorithm has been tested on a 5-node and a 10-node network and also compared with some previously obtained topology. The GA has also been tested for adding extra nodes to an existing optimized network and also in the case of the increase in traffic in some nodes of an optimized network. The results show that the genetic algorithm is an effective algorithm for such problems, and possibly many other topology optimization problem and the integrated problem formulation used in this study works well with the genetic algorithm.
650 0 _aGenetic algorithms
650 0 _aOptical communications
700 1 _aSharma, A.B.,
_eChairperson
700 1 _aErke, Tapio J.,
_eExamination Committee
700 1 _aZhang, Jian-Guo,
_eExamination committee
710 2 _aGovernment of Finland,
_eScholarship donor
810 2 _aAsian Institute of Technology.
_tThesis ;
_vno. TC-98-05
856 _3Full-Text
_uhttp://203.159.5.9/ait-thesis/detail.php?q=B13571
907 _a.b1175431x
_bmnait
_cy
902 _a240717
998 _b0
_c990705
_dm
_ea
_fy
_g0
945 _lmnait
945 _lmnait
945 _lmnarc
945 _lmnarc
942 _c22
942 _c40
942 _c20
909 _aBarcode : 30050120808505
_bCREATED : 2014-05-15
_cRECORD # : i12800041
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050160045661
_bCREATED : 2016-02-03
_cRECORD # : i12888023
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050211018048
_bCREATED : 2022-03-24
_cRECORD # : i13374965
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050211018030
_bCREATED : 2022-03-24
_cRECORD # : i13374977
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c23888
_d23888