Please use this identifier to cite or link to this item:

TitleQos constrained internet routing with evolutionary algorithms
Author(s)Rocha, Miguel
Sousa, Pedro
Rio, Miguel
Cortez, Paulo
KeywordsArtificial intelligence
Computer communications
Issue dateJul-2006
CitationIEEE CONGRESS ON EVOLUTIONARY COMPUTATION, Vancouver, BC, Canada, 2006 – “CEC2006 : proceedings”. [S.l.] : IEEE Press, 2006. ISBN 0-7803-9487-9. p. 9270-9277.
Abstract(s)OSPFOSPF is the most common intra-domain routing protocol in Wide Area Networb. Thus, optimiaing OSPF weighb will produce tools for traflc engineering with Quality of Sewice constraints, without changing the network management madel. Evolutionary Algorithms (EAs) provide a valuable tool to face this NF-hard problem, allowing Jexibb cost functions with sweml mtrics of the network behavior: A novel framework is proposed that enriches current models for network congestion with delay constraints, setting the basis for EAs that allocate OSPF weights, guided by a bi-objective cost function. The results show that EAs make an eflcient method, outperfoming common heuristics and achieving gfective network behavior under nplfavornble scenarios.
TypeConference paper
AccessOpen access
Appears in Collections:CAlg - Artigos em livros de atas/Papers in proceedings
DI/CCTC - Artigos (papers)

Files in This Item:
File Description SizeFormat 
1326_mrocha.pdfDocumento principal3,37 MBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID