Publication: Multi-hour network planning based on domination between sets of traffic matrices
| dc.contributor.author | Pavon Marino, Pablo | |
| dc.contributor.author | García Manrubia, María Belén | |
| dc.contributor.author | Aparicio Pardo, Ramón | |
| dc.contributor.department | Didáctica de las Ciencias Matemáticas y Sociales | |
| dc.date.accessioned | 2026-01-08T12:16:07Z | |
| dc.date.available | 2026-01-08T12:16:07Z | |
| dc.date.copyright | © 2010 Elsevier B.V. | |
| dc.date.issued | 2011-02-21 | |
| dc.description.abstract | In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the week can be exploited. This paper investigates the application of the traffic domination relation between sets of traffic matrices to multi-hour network planning. Two problem variants are considered: a network with a static, and with a dynamic traffic routing. We derive a set of techniques for, given a multi-hour traffic demand potentially composed of hundreds of matrices, obtaining a traffic series with a smaller number of matrices. The traffic domination relation guarantees that the network designed for the simplified series is suitable for the original one. Also, we apply the domination relation to derive lower bounds to the network cost, and upper bounds to the suboptimality incurred by simplifying the traffic demand. The algorithms proposed are tested in a case of study with the Abilene network. In our tests, a long traffic series could be reduced to a small number of traffic matrices, and be effective for network planning. | |
| dc.format | application/pdf | |
| dc.format.extent | 11 | |
| dc.identifier.citation | Computer Networks, 2011, Vol. 55, 55, Issue 3, pp. 665-675 | |
| dc.identifier.doi | https://doi.org/10.1016/j.comnet.2010.10.013 | |
| dc.identifier.eissn | 1872-7069 | |
| dc.identifier.issn | 1389-1286 | |
| dc.identifier.uri | http://hdl.handle.net/10201/184593 | |
| dc.language | eng | |
| dc.publisher | Elsevier | |
| dc.relation | El trabajo descrito en este artículo se realizó con el apoyo del proyecto BONE ("Building the Future Optical Network in Europe"), una Red de Excelencia financiada por la Comisión Europea a través del 7º Programa Marco de TIC. Esta investigación ha sido parcialmente respaldada por el proyecto MEC TEC2007-67966-01/TCM CON-PARTE-1, y se desarrolla también en el marco de los proyectos de la Fundación Séneca 00002/CS/08 (FORMA) y el "Programa de Ayudas a Grupos de Excelencia de la Región de Murcia", F. Séneca (Plan Regional de Ciencia y Tecnología 2007/2010). | |
| dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S1389128610003221 | |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | |
| dc.rights.accessRights | info:eu-repo/semantics/openAccess | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | |
| dc.subject.ods | Objetivo 9: Infraestructura | |
| dc.title | Multi-hour network planning based on domination between sets of traffic matrices | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type.version | info:eu-repo/semantics/acceptedVersion | |
| dspace.entity.type | Publication | es |
| relation.isAuthorOfPublication | 64ccef65-d13a-4800-a6b6-faceb1502bea | |
| relation.isAuthorOfPublication.latestForDiscovery | 64ccef65-d13a-4800-a6b6-faceb1502bea |
Collections
Este ítem está sujeto a una licencia Creative Commons. http://creativecommons.org/licenses/by-nc-nd/4.0/