TY - JOUR
A1 - Ben Ameur, Walid
AU - Pióro, Michal
AU - Pavón Mariño, Pablo
T1 - On traffic domination in communication networks
Y1 - 2010
UR - http://hdl.handle.net/10317/1535
AB - 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 for fully connected networks.
KW - Optimización de la red
KW - Dominación de tráfico de matrices
KW - Optimización multihora
KW - Tráfico incierto
KW - Teoría de gráficos
KW - Network optimization
KW - Traffic matrices domination
KW - Multi-hour optimization
KW - Uncertain traffic
KW - Graph theory
KW - Ingeniería Telemática
LA - eng
PB - University of Vienna
ER -