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...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 出版: |
2008
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/3126 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | 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. |
|---|