Metodologias para roteamento ótimo em redes de telecomunicações

• Ano de defesa: 2011
• Autor(a) principal: Tenório, Marcos Mincov
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Tecnológica Federal do Paraná; Curitiba; Programa de Pós-Graduação em Engenharia Elétrica e Informática Industrial
• Palavras-chave em Português: Sistemas de telecomunicação; Roteadores (Rede de computador); Redes de computadores; Comutação por pacotes (Transmissão de dados); Telecomunicações - Tráfego - Controle de qualidade; Engenharia elétrica; Telecommunication systems; Ruters (Computer network); Computer networks; Packet switching (Data transmission); Telecommunication - Traffic - Quality control; Electric engineering
• Link de acesso: http://repositorio.utfpr.edu.br/jspui/handle/1/395

Internet traffic management becomes essential due the large use of the Internet the past decades. Balancing the use of existing IP resources improves the performance of services. Backbone manteiners are responsible for routing data that are sent along the network links from a source to a destination host. A routing protocol is used to perform this task. One of the most commonly used internal routing protocol is OSPF (Open Shortest Path First). The quality of the routes offered by the OSPF protocol mainly depends on weights that are assigned by the network operator to the links. The determination of these weights depends on technical or economic criteria deemed necessary by the ISPs. This master dissertation addresses the routing problem aiming at providing network quality of service by optimizing the weights assigned to links. The weight setting problem (WSP) corresponds to find a set of OSPF weights that optimize network performance. To solve this problem, the literature shows algorithms that mostly seek to balance the network traffic by correctly setting link loads. This work aims at solving WSP proposing a new approach that takes into account packet losses over origin-destination paths and link overhead. Also an extended formulation is proposed, to obtain a set of operating weights in normal environments and in environments where node failures can occur. The application of two well known heuristics, Simulated Annealing and Harmony Search, to this problem allows to find satisfactory solutions to the performance criteria specified.