Optimizing reliable network topology design using dynamic programming
This thesis addresses four reliable network topology design problems that consider reliability, cost, and/or bandwidth performance metrics. The optimization problems include one or two objectives and one constraint, each of which is known NP-hard. All problems consider all-terminal and/or two-termin...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
2015
|
| Online Access: | http://hdl.handle.net/20.500.11937/823 |
| _version_ | 1848743490833350656 |
|---|---|
| author | Elshqeirat, Basima Ahmad Haroun |
| author_facet | Elshqeirat, Basima Ahmad Haroun |
| author_sort | Elshqeirat, Basima Ahmad Haroun |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | This thesis addresses four reliable network topology design problems that consider reliability, cost, and/or bandwidth performance metrics. The optimization problems include one or two objectives and one constraint, each of which is known NP-hard. All problems consider all-terminal and/or two-terminal reliability measures. Four heuristic dynamic programming approaches are proposed, and 10 order criteria are used to improve their optimality and time efficiency. Simulations on hundreds of networks show the merits of the proposed methods. |
| first_indexed | 2025-11-14T05:46:24Z |
| format | Thesis |
| id | curtin-20.500.11937-823 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T05:46:24Z |
| publishDate | 2015 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-8232017-02-20T06:40:03Z Optimizing reliable network topology design using dynamic programming Elshqeirat, Basima Ahmad Haroun This thesis addresses four reliable network topology design problems that consider reliability, cost, and/or bandwidth performance metrics. The optimization problems include one or two objectives and one constraint, each of which is known NP-hard. All problems consider all-terminal and/or two-terminal reliability measures. Four heuristic dynamic programming approaches are proposed, and 10 order criteria are used to improve their optimality and time efficiency. Simulations on hundreds of networks show the merits of the proposed methods. 2015 Thesis http://hdl.handle.net/20.500.11937/823 en Curtin University fulltext |
| spellingShingle | Elshqeirat, Basima Ahmad Haroun Optimizing reliable network topology design using dynamic programming |
| title | Optimizing reliable network topology design using dynamic programming |
| title_full | Optimizing reliable network topology design using dynamic programming |
| title_fullStr | Optimizing reliable network topology design using dynamic programming |
| title_full_unstemmed | Optimizing reliable network topology design using dynamic programming |
| title_short | Optimizing reliable network topology design using dynamic programming |
| title_sort | optimizing reliable network topology design using dynamic programming |
| url | http://hdl.handle.net/20.500.11937/823 |