Advanced

On traffic domination in communication networks (invited paper)

Ben-Ameur, W.; Pavon-Marino, P and Pioro, Michal LU (2010) Performance evaluation of computer and communication systems: milestones and future challenges In Performance Evaluation of Computer and Communication Systems. Milestones and Future Challenges/Lecture notes in computer science 6821. p.191-202
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:... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Performance Evaluation of Computer and Communication Systems. Milestones and Future Challenges/Lecture notes in computer science
volume
6821
pages
191 - 202
publisher
Springer
conference name
Performance evaluation of computer and communication systems: milestones and future challenges
external identifiers
  • scopus:84855544099
ISSN
1611-3349
0302-9743
ISBN
978-3-642-25574-8
DOI
10.1007/978-3-642-25575-5_16
language
English
LU publication?
yes
id
78ea2207-9ff7-48ad-a67b-2089d8edfbdf (old id 1718866)
date added to LUP
2010-11-19 13:33:15
date last changed
2018-05-29 11:15:03
@inproceedings{78ea2207-9ff7-48ad-a67b-2089d8edfbdf,
  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       = {Ben-Ameur, W. and Pavon-Marino, P and Pioro, Michal},
  booktitle    = {Performance Evaluation of Computer and Communication Systems. Milestones and Future Challenges/Lecture notes in computer science},
  isbn         = {978-3-642-25574-8},
  issn         = {1611-3349},
  language     = {eng},
  pages        = {191--202},
  publisher    = {Springer},
  title        = {On traffic domination in communication networks (invited paper)},
  url          = {http://dx.doi.org/10.1007/978-3-642-25575-5_16},
  volume       = {6821},
  year         = {2010},
}