Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

On traffic domination in communication networks (invited paper)

Författare:
Publiceringsår: 2010
Språk: Engelska
Sidor: 191-202
Publikation/Tidskrift/Serie: Performance Evaluation of Computer and Communication Systems. Milestones and Future Challenges/Lecture notes in computer science
Volym: 6821
Dokumenttyp: Konferensbidrag
Förlag: Springer

Sammanfattning

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.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

Performance evaluation of computer and communication systems: milestones and future challenges
2010-10-14/2010-10-20
Vienna, Austria
Published
Yes
  • Networking
  • ISSN: 0302-9743
  • ISBN: 978-3-642-25574-8

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen