TY - GEN
T1 - On traffic domination in communication networks
AU - Ben-Ameur, Walid
AU - Pavon-Marino, Pablo
AU - Pióro, Michał
PY - 2011/12/1
Y1 - 2011/12/1
N2 - Input data for communication network design/optimization problems involving multi-hour or uncertain traffic can consist of a large set of traffic matrices. These matrices are explicitly considered in problem formulations for link dimensioning. However, many of these matrices are usually dominated by others so only a relatively small subset of matrices would be sufficient to obtain proper link capacity reservations, supporting all original traffic 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 traffic matrix over another. We consider two basic cases of domination: (i) total domination when the same traffic routing must be used for both matrices, and (ii) ordinary domination when traffic dependent routing can be used. The paper is based on our original results and generalizes the domination results known for fully connected networks.
AB - Input data for communication network design/optimization problems involving multi-hour or uncertain traffic can consist of a large set of traffic matrices. These matrices are explicitly considered in problem formulations for link dimensioning. However, many of these matrices are usually dominated by others so only a relatively small subset of matrices would be sufficient to obtain proper link capacity reservations, supporting all original traffic 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 traffic matrix over another. We consider two basic cases of domination: (i) total domination when the same traffic routing must be used for both matrices, and (ii) ordinary domination when traffic dependent routing can be used. The paper is based on our original results and generalizes the domination results known for fully connected networks.
KW - graph theory
KW - multi-hour optimization
KW - network optimization
KW - traffic matrices domination
KW - uncertain traffic
U2 - 10.1007/978-3-642-25575-5_16
DO - 10.1007/978-3-642-25575-5_16
M3 - Conference contribution
AN - SCOPUS:84855544099
SN - 9783642255748
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 191
EP - 202
BT - Perform. Eval. Comput. and Comm. Syst.
T2 - IFIP WG 6.3/7.3 International Workshop on Performance Evaluation of Computer and Communication Systems: Milestones and Future Challenges, PERFORM 2010
Y2 - 14 October 2010 through 16 October 2010
ER -