Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPeng, Yanjieen
dc.identifier.citationPeng, Y. (2005). Heuristic approach by Tabu search for resource allocation in communication networks. Master’s thesis, Nanyang Technological University, Singapore.en
dc.description.abstractWith the huge increase in the demand for more capacity in communication networks, resources are limited and scarce. Consequently, resource allocation is a major challenge in the design and implementation of communication networks. The main objective is to improve resource utilization and users’ satisfactions. Three resource allocation problems are investigated in this thesis. They are routing and wavelength assignment (RWA) problem in wavelength-routed optical networks, channel assignment problem (CAP) in cellular telephone networks, and broadcast scheduling problem (BSP) in TDMA packet radio networks. The algorithms based on the tabu search (TS) paradigm are proposed for solving these combinatorial optimization problems.en
dc.rightsNanyang Technological Universityen
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Wireless communication systemsen
dc.titleHeuristic approach by Tabu search for resource allocation in communication networksen
dc.contributor.supervisorSoong Boon Heeen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.description.degreeMASTER OF ENGINEERING (EEE)en
item.fulltextWith Fulltext-
Appears in Collections:EEE Theses
Files in This Item:
File Description SizeFormat 
EEE-THESES_1019.pdf3.21 MBAdobe PDFThumbnail

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.