Considerando a Probabilidade de Perda de Pacotes no Roteamento OSPF Tolerante a Falhas
(Considering Packet Loss Probability in Fault-Tolerant OSPF Routing)
Emilio Carlos Gomes Wille (email@example.com), Marcos Mincov Tenorio (firstname.lastname@example.org)
Universidade Tecnológica Federal do Paraná
This paper appears in: Revista IEEE América Latina
Publication Date: March 2014
Volume: 12, Issue: 2
Interior gateway protocols such as OSPF associate a weight with each network link and then compute shortest paths. The weights optimization is done by solving the Weight Setting Problem (WSP). One drawback of current approaches is that they disregard factors like packet loss probability. Most approaches also ignore network dynamics. When a router or link fails, there is a redistribution of traffic to alternate paths, increasing the network load and thus resulting in congestion. This paper presents a strategy for solving the WSP considering link congestion, packet loss and fault tolerance. Two meta-heuristics (simulated annealing and harmony search) are applied to yield good quality and high performance solutions. Applications under different scenarios show the effectiveness of the proposed approach.
OSPF routing, Weight setting problem, Packet loss probability, Fault tolerance, Network planning.
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (703)]