Heuristic approach by Tabu search for resource allocation in communication networks

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’ sati...

Full description

Saved in:
Bibliographic Details
Main Author: Peng, Yanjie
Other Authors: Soong Boon Hee
Format: Theses and Dissertations
Published: 2008
Subjects:
Online Access:https://hdl.handle.net/10356/3126
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
id sg-ntu-dr.10356-3126
record_format dspace
spelling sg-ntu-dr.10356-31262023-07-04T17:25:15Z Heuristic approach by Tabu search for resource allocation in communication networks Peng, Yanjie Soong Boon Hee School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems 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. MASTER OF ENGINEERING (EEE) 2008-09-17T09:22:48Z 2008-09-17T09:22:48Z 2005 2005 Thesis Peng, Y. (2005). Heuristic approach by Tabu search for resource allocation in communication networks. Master’s thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/3126 10.32657/10356/3126 Nanyang Technological University application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
topic DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
spellingShingle DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
Peng, Yanjie
Heuristic approach by Tabu search for resource allocation in communication networks
description 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.
author2 Soong Boon Hee
author_facet Soong Boon Hee
Peng, Yanjie
format Theses and Dissertations
author Peng, Yanjie
author_sort Peng, Yanjie
title Heuristic approach by Tabu search for resource allocation in communication networks
title_short Heuristic approach by Tabu search for resource allocation in communication networks
title_full Heuristic approach by Tabu search for resource allocation in communication networks
title_fullStr Heuristic approach by Tabu search for resource allocation in communication networks
title_full_unstemmed Heuristic approach by Tabu search for resource allocation in communication networks
title_sort heuristic approach by tabu search for resource allocation in communication networks
publishDate 2008
url https://hdl.handle.net/10356/3126
_version_ 1772825714290065408