On traffic domination in communication networks

Walid Ben-Ameur , Pablo Pavon-Marino , Michał Pióro

Abstract

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.
Author Walid Ben-Ameur
Walid Ben-Ameur,,
-
, Pablo Pavon-Marino
Pablo Pavon-Marino,,
-
, Michał Pióro (FEIT / IT)
Michał Pióro,,
- The Institute of Telecommunications
Pages191-202
Publication size in sheets0.5
Book Hummel Karin Anna, Hlavacs Helmut, Gansterer Wilfried (eds.): Performance Evaluation of Computer and Communication Systems. Milestones and Future Challenges, Lecture Notes In Computer Science, vol. 6821, 2011, Springer, ISBN 978-3-642-25574-8, [978-3-642-25575-5], 240 p., DOI:10.1007/978-3-642-25575-5
2011 Performance Evaluation of Computer and Communication Systems.pdf / No licence information (file archived - login or check accessibility on faculty)
Keywords in Englishnetwork optimization, traffic matrices domination, multihour optimization, uncertain traffic, graph theory
DOIDOI:10.1007/978-3-642-25575-5_16
Languageen angielski
File
2011 Ben-Ameur, Pióro On Traffic Domination.pdf 207.93 KB
Score (nominal)0
Citation count*3 (2019-01-31)
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?