On traffic domination in communication networks (invited paper)

W. Ben-Ameur, P Pavon-Marino, Michal Pioro

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review


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.
Original languageEnglish
Title of host publicationPerformance Evaluation of Computer and Communication Systems. Milestones and Future Challenges/Lecture notes in computer science
ISBN (Print)978-3-642-25574-8
Publication statusPublished - 2010
EventPerformance evaluation of computer and communication systems: milestones and future challenges - Vienna, Austria
Duration: 2010 Oct 142010 Oct 20

Publication series

ISSN (Print)1611-3349
ISSN (Electronic)0302-9743


ConferencePerformance evaluation of computer and communication systems: milestones and future challenges

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering


Dive into the research topics of 'On traffic domination in communication networks (invited paper)'. Together they form a unique fingerprint.

Cite this