Please use this identifier to cite or link to this item:
|Title:||Heuristic approach by Tabu search for resource allocation in communication networks||Authors:||Peng, Yanjie.||Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems||Issue Date:||2005||Source:||Peng, Y. (2005). Heuristic approach by Tabu search for resource allocation in communication networks. Master’s thesis, Nanyang Technological University, Singapore.||Abstract:||With 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.||URI:||http://hdl.handle.net/10356/3126||Rights:||Nanyang Technological University||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Theses|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.