On traffic domination in communication networks - Performance Evaluation of Computer and Communication Systems: Milestones and Future Challenges Access content directly
Conference Papers Year : 2011

On traffic domination in communication networks


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
Fichier principal
Vignette du fichier
978-3-642-25575-5_16_Chapter.pdf (188.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01301879 , version 1 (13-04-2016)





Walid Ben-Ameur, Pablo Pavón Mariño, Michal Pioro. On traffic domination in communication networks. Performance Evaluation of Computer and Communication Systems (PERFORM), Oct 2010, Vienne, Austria. pp.191-202, ⟨10.1007/978-3-642-25575-5_16⟩. ⟨hal-01301879⟩
657 View
125 Download



Gmail Facebook X LinkedIn More