On Traffic Domination in Communication Networks

  • Walid Ben-Ameur
  • Pablo Pavon-Marino
  • Michał Pióro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6821)


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.


network optimization traffic matrices domination multi-hour optimization uncertain traffic graph theory 


  1. 1.
    Ben-Ameur, W., Kerivin, H.: Routing of uncertain traffic demands. Optimization and Engineering 3, 283–313 (2005)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Ben-Ameur, W., Pióro, M.: On traffic domination and total traffic domination in communication networks with arbitrary graphs. Technical report, Institute of Telecommunications, Warsaw University of TechnologyGoogle Scholar
  3. 3.
    Jungnickel, D.: Graphs, Networks and Algorithms. Springer, Heidelberg (1999)Google Scholar
  4. 4.
    Lasdon, L.: Optimization Theory for Large Systems. McMillan Publishing Co., Inc. (1970)Google Scholar
  5. 5.
    Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. Journal of Combinatorial Theory 31(1), 75–81 (1981)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Oriolo, G.: Domination between traffic matrices. Mathematics of Operations Research 33(1), 91–96 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Pavon-Marino, P., Garcia-Manrubia, B., Aparicio-Pardo, R.: Multi-hour network planning based on domination between sets of traffic matrices. To be Published in Computer NetworksGoogle Scholar
  8. 8.
    Pavon-Marino, P., Pióro, M.: On total traffic domination in non-complete graphs. submitted to OR LettersGoogle Scholar
  9. 9.
    Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan-Kaufmann (2004)Google Scholar
  10. 10.
    Shepherd, B., Zhang, L.: A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. Discrete Applied Mathematics 110(2-3), 301–315 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Terblanche, S.E.: Contributions towards survivable Network Design with Uncertain Traffic Requirements. PhD thesis, North-West University, South Africa (2008)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2011

Authors and Affiliations

  • Walid Ben-Ameur
    • 1
  • Pablo Pavon-Marino
    • 2
  • Michał Pióro
    • 3
    • 4
  1. 1.TELECOM SudParisÉvryFrance
  2. 2.Technical University of CartagenaCartagenaSpain
  3. 3.Warsaw University of TechnologyWarszawaPoland
  4. 4.Lund UniversityLundSweden

Personalised recommendations