Show simple item record

dc.contributor.authorBen Ameur, Walid 
dc.contributor.authorPióro, Michal 
dc.contributor.authorPavón Mariño, Pablo 
dc.date.accessioned2011-01-11T11:55:45Z
dc.date.available2011-01-11T11:55:45Z
dc.date.issued2010-10
dc.identifier.citationBEN AMEUR, Walid, PAVÓN MARIÑO, Pablo. On traffic domination in communication networks. En: Performance Evaluation of Computer and Communication Systems (2010: Vienna). PERFORM Workshop 2010. Performance Evaluation of Computer and Communication Systems: Milestones and Future Challenges, October 14-16, 2010, at the University of Vienna. Vienna: Universidad. 2010. 12 p.en_US
dc.description.abstractInput data for communication network design/optimization problems involving multi-hour or uncertain tra c can consist of a large set of tra c matrices. These matrices are explicitly considered in prob- lem formulations for link dimensioning. However, many of these matrices are usually dominated by others so only a relatively small subset of ma- trices would be su cient to obtain proper link capacity reservations, sup- porting all original tra c 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 tra c matrix over another. We consider two basic cases of domination: (i) total domination when the same tra c routing must be used for both matrices, and (ii) ordi- nary domination when tra c dependent routing can be used. The paper is based on our original results and generalizes the domination results known for fully connected networks.en_US
dc.description.sponsorshipWhile working on the paper during his stay as an invited professor at Warsaw University of Technology, W. Ben-Ameur was supported by European Union in the framework of European Social Fund. P. Pav on was supported by the FP7 BONE project, by the MEC project TEC2010-21405- C02/TCM CALM, and by \Programa de Ayudas a Grupos de Excelencia de la R. de Murcia, F. S eneca" { he had also stayed at Warsaw University of Technology while working on the results presented in the paper. M. Pi oro was supported by the Polish Ministry of Science and Higher Education (grants no. 280/N- DFG/2008/0 and N517 397334), and by the Swedish Research Council (grant no. 621-2006-5509).en_US
dc.formatapplication/pdf
dc.language.isoengen_US
dc.publisherUniversity of Viennaen_US
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 España*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.titleOn traffic domination in communication networksen_US
dc.typeinfo:eu-repo/semantics/articleen_US
dc.subjectOptimización de la reden_US
dc.subjectDominación de tráfico de matricesen_US
dc.subjectOptimización multihoraen_US
dc.subjectTráfico inciertoen_US
dc.subjectTeoría de gráficosen_US
dc.subjectNetwork optimizationen_US
dc.subjectTraffic matrices dominationen_US
dc.subjectMulti-hour optimizationen_US
dc.subjectUncertain trafficen_US
dc.subjectGraph theoryen_US
dc.subject.otherIngeniería Telemáticaen_US
dc.identifier.urihttp://hdl.handle.net/10317/1535
dc.peerreviewen_US
dc.contributor.investgroupGrupo de Ingeniería Telemática (GIT)en_US
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess


Files in this item

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 3.0 España
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 España