Examples involving 'OSPF'

Return to keyword list

An example where routing is based on the Open Shortest Path First (OSPF) protocol

Network design - Algorithms

Example nameDescription
CFA_OSPF_fixedWeight.java

Minimimize number of IP links so that traffic is carried using OSPF routing

Keywords: Capacity assignment (CA), Destination-based routing, Flow assignment (FA), Greedy heuristic, OSPF

This algorithm computes the number of IP links between two nodes, and the OSPF routing (with ECMP), so that all the traffic is carried, while all the links have an utilization not exceeding a given threshold (maximumUtilization). All IP links have the same given fixedOSPFWeight weight, and the same given fixedIPLinkCapacity capacity.

FA_EA_minCongestionSingleFailureOSPF.java

OSPF routing that minimizes the average congestion between (i) the congestion when no failure occurs in the network, (ii) the worse congestion ranging the cases when one single SRG is failed.

Keywords: Destination-based routing, Evolutionary algorithm (EA), Flow assignment (FA), OSPF, Restoration algorithm

This algorithm computes the OSPF routing that minimizes the average congestion between (i) the congestion when no failure occurs in the network, (ii) the worse congestion ranging the cases when one single SRG is failed. If no SRGs are defined, congestion in (i) is returned. An evolutionary algorithm is implemented. Each solution is coded as an array of as many elements as links, storing the OSPF weight in each link. Details on the particular form in which the evolutionary operators are implemented can be seen in the source code. The returning design includes the routes defined by the OSPF weights, and an attribute per link with its OSPF weight

FA_OSPF_fastIGPMetric.java

Route traffic with ECMP getting link weights obtained from a heuristic

Keywords: Flow assignment (FA), JOM, LP formulation, OSPF

This algorithm provides two heuristic methods, presented in [Umit2009], to deal with the IGP weight setting problem with the ECMP rule (NP-hard). These heuristics are based on dual properties of multi-commodity flow (MCF) problems to obtain link metrics in a fast and efficient manner.

Resilience simulation - Provisioning algorithms

Example nameDescription
NRSim_AA_OSPF_pathRerouting.java

Reroute all traffic according to the ECMP rule

Keywords: OSPF, Restoration algorithm

This algorithm reacts to any resilience event (failure/restoration) trying to routing all the traffic according to the ECMP rule, using link IGP weights. These weights are not modified by the algorithm.