On traffic domination in communication networks
Identificadores
URI: http://hdl.handle.net/10317/1535Compartir
Métricas
Estadísticas
Ver Estadísticas de usoMetadatos
Mostrar el registro completo del ítemGrupo de investigación
Grupo de Ingeniería Telemática (GIT)Área de conocimiento
Ingeniería TelemáticaPatrocinadores
While working on the paper during his stay as an invited professor at Warsaw University of Technology, W. Ben-Ameur was supported by European Union in the framework of European Social Fund. P. Pav on was supported by the FP7 BONE project, by the MEC project TEC2010-21405- C02/TCM CALM, and by \Programa de Ayudas a Grupos de Excelencia de la R. de Murcia, F. S eneca" { he had also stayed at Warsaw University of Technology while working on the results presented in the paper. M. Pi oro was supported by the Polish Ministry of Science and Higher Education (grants no. 280/N- DFG/2008/0 and N517 397334), and by the Swedish Research Council (grant no. 621-2006-5509).Fecha de publicación
2010-10Editorial
University of ViennaCita bibliográfica
BEN AMEUR, Walid, PAVÓN MARIÑO, Pablo. On traffic domination in communication networks. En: Performance Evaluation of Computer and Communication Systems (2010: Vienna). PERFORM Workshop 2010. Performance Evaluation of Computer and Communication Systems: Milestones and Future Challenges, October 14-16, 2010, at the University of Vienna. Vienna: Universidad. 2010. 12 p.Revisión por pares
SíPalabras clave
Optimización de la redDominación de tráfico de matrices
Optimización multihora
Tráfico incierto
Teoría de gráficos
Network optimization
Traffic matrices domination
Multi-hour optimization
Uncertain traffic
Graph theory
Resumen
Input data for communication network design/optimization
problems involving multi-hour or uncertain tra c can consist of a large
set of tra c matrices. These matrices are explicitly considered in prob-
lem formulations for link dimensioning. However, many of these matrices
are usually dominated by others so only a relatively small subset of ma-
trices would be su cient to obtain proper link capacity reservations, sup-
porting all original tra c matrices. Thus, elimination of the dominated
matrices leads to substantially smaller optimization problems, making
them treatable by contemporary solvers. In the paper we discuss the
issues behind detecting domination of one tra c matrix over another.
We consider two basic cases of domination: (i) total domination when
the same tra c routing must be used for both matrices, and (ii) ordi-
nary domination when tra c dependent routing can be used. The paper
is based on our original results and generalizes the domination results
known ...
Colecciones
- Artículos [1734]
El ítem tiene asociados los siguientes ficheros de licencia:
Redes sociales