Brief description
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.
Algorithm description table
Algorithm inputs | Requires a topology (nodes and links) and a demand set within the netPlan object. Input link capacities are ignored. Algorithm parameters:
|
---|---|
Algorithm outputs | See algorithm description |
Required libraries | None |
Keywords | Capacity assignment (CA), Destination-based routing, Flow assignment (FA), Greedy heuristic, OSPF |
Authors | Pablo Pavón Mariño, José Luis Izquierdo Zaragoza |
Date | February 2014 |
Code | CFA_OSPF_fixedWeight.java |
Detailed description
Initially, only one IP link is established between those nodes which have a link between them in the input design. Then, we compute the worse utilization among all the links, in no failure condition, or including also any single bidirectional failure condition, if singleBidirectionalFailureProvision=true. If the worse utilization in any IP link does not exceed maximumUtilization, we are done. If not, we add two more links of fixedIPLinkCapacity (one in each direction), between the nodes of the highest utilized IP link, and iterate again