dc.contributor.authorPeng, Yanjieen_US
dc.date.accessioned2008-09-17T09:22:48Z
dc.date.accessioned2017-07-23T08:30:47Z
dc.date.available2008-09-17T09:22:48Z
dc.date.available2017-07-23T08:30:47Z
dc.date.copyright2005en_US
dc.date.issued2005
dc.identifier.citationPeng, Y. (2005). Heuristic approach by Tabu search for resource allocation in communication networks. Master’s thesis, Nanyang Technological University, Singapore.
dc.identifier.urihttp://hdl.handle.net/10356/3126
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_US
dc.rightsNanyang Technological Universityen_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
dc.titleHeuristic approach by Tabu search for resource allocation in communication networksen_US
dc.typeThesisen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.contributor.supervisorSoong Boon Heeen_US
dc.description.degreeMASTER OF ENGINEERING (EEE)en_US


Files in this item

FilesSizeFormatView
EEE-THESES_1019.pdf3.285Mbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record