Qos constrained internet routing with evolutionary algorithms

• Autor(es): Rocha, Miguel ; Sousa, Pedro ; Rio, Miguel ; Cortez, Paulo, 1971-
• Data: 2006
• Identificador Persistente: http://hdl.handle.net/1822/6569
• Origem: RepositóriUM - Universidade do Minho
• Assunto(s): Artificial intelligence; Computer communications; Networks
• Tipo de Documento: Documento de conferência
• Idioma: Inglês

Descrição

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.