WAN design with demand, hop limit and path diversity constraints
This thesis presents a challenging telecommunication network design problem, in which the network designer has to assure not only connectivity, but also some degree of performance guarantee and survivability to the solution. We introduce a topological and capacity design, with node-pair constraints...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | masterThesis |
| שפה: | אנגלית |
| יצא לאור: |
2008
|
| נושאים: | |
| גישה מקוונת: | http://hdl.handle.net/20.500.12008/2950 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| _version_ | 1868890233146179584 |
|---|---|
| author | Ho, Vincent |
| author_browse | Ho, Vincent |
| author_facet | Ho, Vincent |
| author_role | author |
| collection | COLIBRI |
| dc.creator.none.fl_str_mv | Ho, Vincent |
| dc.date.none.fl_str_mv | 2008 2014-11-24T22:36:21Z 2014-11-24T22:36:21Z 20141202 |
| dc.format.none.fl_str_mv | 131 p. application/pdf |
| dc.identifier.none.fl_str_mv | HO, V. "WAN design with demand, hop limit and path diversity constraints". Tesis de maestría, Universidad de la República (Uruguay). Facultad de Ingeniería. Instituto de Computación – PEDECIBA, 2008. http://hdl.handle.net/20.500.12008/2950 |
| dc.language.none.fl_str_mv | en eng |
| dc.publisher.none.fl_str_mv | UR. FI-INCO, |
| dc.rights.none.fl_str_mv | info:eu-repo/semantics/openAccess Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) |
| dc.source.none.fl_str_mv | reponame:COLIBRI instname:Universidad de la República instacron:Universidad de la República |
| dc.subject.none.fl_str_mv | Topology Capacity Network design Node disjoint paths Hop limit Multi-path routing Genetic algorithms |
| dc.title.none.fl_str_mv | WAN design with demand, hop limit and path diversity constraints |
| dc.type.none.fl_str_mv | Tesis de maestría info:eu-repo/semantics/masterThesis info:eu-repo/semantics/acceptedVersion |
| description | This thesis presents a challenging telecommunication network design problem, in which the network designer has to assure not only connectivity, but also some degree of performance guarantee and survivability to the solution. We introduce a topological and capacity design, with node-pair constraints of heterogeneous bounds. These constraints take into account the throughput, the number of node-disjoint paths, and the maximum number of hops. Moreover, the capacity to place on each link is chosen from a pool of available cable types, each with its maximum capacity and fixed cost, in other words the cost function is stepwise with respect to capacity usage. The solution space of the problem in study is composed by each one of the node-pair demands. An in-depth combinatorial study was done, leading to the development of a new coding for genetic |
| eu_rights_str_mv | openAccess |
| format | masterThesis |
| id | anni_f3f3ce06e100efae8ed9289df81e28da |
| identifier_str_mv | HO, V. "WAN design with demand, hop limit and path diversity constraints". Tesis de maestría, Universidad de la República (Uruguay). Facultad de Ingeniería. Instituto de Computación – PEDECIBA, 2008. |
| instacron_str | Universidad de la República |
| institution | Universidad de la República |
| instname_str | Universidad de la República |
| language | eng |
| language_invalid_str_mv | en |
| network_acronym_str | anni |
| network_name_str | oai-lr-anni |
| oai_identifier_str | oai:colibri.udelar.edu.uy:20.500.12008/2950 |
| publishDate | 2008 |
| publishDateSort | 2008 |
| publisher.none.fl_str_mv | UR. FI-INCO, |
| reponame_str | COLIBRI |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| rights_invalid_str_mv | Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) |
| spelling | WAN design with demand, hop limit and path diversity constraintsHo, VincentTopologyCapacityNetwork designNode disjoint pathsHop limitMulti-path routingGenetic algorithmsThis thesis presents a challenging telecommunication network design problem, in which the network designer has to assure not only connectivity, but also some degree of performance guarantee and survivability to the solution. We introduce a topological and capacity design, with node-pair constraints of heterogeneous bounds. These constraints take into account the throughput, the number of node-disjoint paths, and the maximum number of hops. Moreover, the capacity to place on each link is chosen from a pool of available cable types, each with its maximum capacity and fixed cost, in other words the cost function is stepwise with respect to capacity usage. The solution space of the problem in study is composed by each one of the node-pair demands. An in-depth combinatorial study was done, leading to the development of a new coding for geneticUR. FI-INCO,2014-11-24T22:36:21Z2014-11-24T22:36:21Z200820141202Tesis de maestríainfo:eu-repo/semantics/masterThesisinfo:eu-repo/semantics/acceptedVersion131 p.application/pdfHO, V. "WAN design with demand, hop limit and path diversity constraints". Tesis de maestría, Universidad de la República (Uruguay). Facultad de Ingeniería. Instituto de Computación – PEDECIBA, 2008.http://hdl.handle.net/20.500.12008/2950reponame:COLIBRIinstname:Universidad de la Repúblicainstacron:Universidad de la RepúblicaenengLas obras depositadas en el Repositorio se rigen por la Ordenanza de los Derechos de la Propiedad Intelectual de la Universidad De La República. (Res. Nº 91 de C.D.C. de 8/III/1994 – D.O. 7/IV/1994) y por la Ordenanza del Repositorio Abierto de la Universidad de la República (Res. Nº 16 de C.D.C. de 07/10/2014)info:eu-repo/semantics/openAccessLicencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0)oai:colibri.udelar.edu.uy:20.500.12008/29502026-04-14T10:27:50Z |
| spellingShingle | WAN design with demand, hop limit and path diversity constraints Ho, Vincent Topology Capacity Network design Node disjoint paths Hop limit Multi-path routing Genetic algorithms |
| status_str | acceptedVersion |
| title | WAN design with demand, hop limit and path diversity constraints |
| title_full | WAN design with demand, hop limit and path diversity constraints |
| title_fullStr | WAN design with demand, hop limit and path diversity constraints |
| title_full_unstemmed | WAN design with demand, hop limit and path diversity constraints |
| title_short | WAN design with demand, hop limit and path diversity constraints |
| title_sort | WAN design with demand, hop limit and path diversity constraints |
| topic | Topology Capacity Network design Node disjoint paths Hop limit Multi-path routing Genetic algorithms |
| url | http://hdl.handle.net/20.500.12008/2950 |