On the link upgrade problem for networks
In this thesis, we study the link upgrade problem and examine some existing heuristic algorithms that have been proposed for this problem, implements and evaluate the performance of these algorithms. We also investigate the possibility of proposing new algorithms with better performance.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Theses and Dissertations |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/4977 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Summary: | In this thesis, we study the link upgrade problem and examine some existing heuristic algorithms that have been proposed for this problem, implements and evaluate the performance of these algorithms. We also investigate the possibility of proposing new algorithms with better performance. |
|---|