See: Description
Class | Description |
---|---|
Offline_ba_numFormulations |
Solves the congestion control problem using a NUM formulation.
|
Offline_ca_wirelessCsmaWindowSize |
Optimizes the backoff window size of the links in a wireless network based on a CSMA MAC, solving a formulation.
|
Offline_ca_wirelessPersistenceProbability |
Optimizes the persistence probability of the links in a wireless network based on a random-access (ALOHA-type) MAC, solving a formulation.
|
Offline_ca_wirelessTransmissionPower |
Finds a fair allocation of the transmission power in a wireless network, solving a formulation.
|
Offline_cba_congControLinkBwSplitTwolQoS |
In a network with demands of two QoS, jointly optimizes the demand injected traffic and link capacity assigned to each solving a formulation.
|
Offline_cba_wirelessCongControlTransmissionPowerAssignment |
Jointly optimizes the demand injected traffic (congestion control) and link transmission powers ina wireless network, solving a NUM formulation.
|
Offline_cfa_modularCapacitiesAndRoutingDualDecomposition |
Finds the routing and mocular capacities for a network that minimize the cost, using a dual decomposition approach
The time evolution of different metrics can be stored in output files, for later processing.
|
Offline_cfa_xpMultiperiodModularCapacities |
Finds the multiperiod (e.g.
|
Offline_Example_Algorithm | |
Offline_fa_ospfWeightOptimization_ACO |
Searches for the OSPF link weights that minimize a measure of congestion, using an ant-colony optimization (ACO) heuristic.
|
Offline_fa_ospfWeightOptimization_EA |
Searches for the OSPF link weights that minimize a measure of congestion, using an evolutionary algorithm (genetic algorithm) heuristic
The time evolution of different metrics can be stored in output files, for later processing.
|
Offline_fa_ospfWeightOptimization_GRASP |
Searches for the OSPF link weights that minimize a measure of congestion, using a GRASP heuristic
The time evolution of different metrics can be stored in output files, for later processing.
|
Offline_fa_ospfWeightOptimization_greedy |
Searches for the OSPF link weights that minimize a measure of congestion, using a greedy heuristic
|
Offline_fa_ospfWeightOptimization_localSearch |
Searches for the OSPF link weights that minimize a measure of congestion, using a local-search heuristic
The time evolution of different metrics can be stored in output files, for later processing.
|
Offline_fa_ospfWeightOptimization_SAN |
Searches for the OSPF link weights that minimize a measure of congestion, using a simulated annealing (SAN) heuristic
The time evolution of different metrics can be stored in output files, for later processing.
|
Offline_fa_ospfWeightOptimization_tabuSearch |
Searches for the OSPF link weights that minimize a measure of congestion, using a tabu search heuristic
The time evolution of different metrics can be stored in output files, for later processing.
|
Offline_fa_xde11PathProtection |
Solves several variants of unicast routing problems with 1+1 protection, with flow-link formulations
|
Offline_fa_xdeFormulations |
Solves several variants of unicast routing problems, with flow-link formulations
|
Offline_fa_xdeFormulationsMulticast |
Solves several variants of multicast routing problems, with flow-link formulations
|
Offline_fa_xdeSharedRestoration |
Solves several variants of unicast routing problems with flow-link formulations, so that designs are fault tolerant to a set of failure states, using shared restoration
|
Offline_fa_xp11PathProtection |
Solves several variants of unicast routing problems with 1+1 protection, with flow-path formulations
|
Offline_fa_xpFormulations |
Solves several variants of unicast routing problems, with flow-path formulations
|
Offline_fa_xpFormulationsMulticast |
Solves several variants of multicast routing problems, with flow-path formulations
|
Offline_fa_xpMultihourDynamicRouting |
Solves a multihour routing problem with dynamic routing (routing may be different at different time intervals) using a flow-path formulation
|
Offline_fa_xpMultihourObliviousRouting |
Solves a multihour routing problem with oblivious routing (common routing in all the time intervals) using a flow-path formulation
|
Offline_fa_xteFormulations |
Solves severals variants of routing problems in the form of destination-link formulations.
|
Offline_tca_nodeLocation |
Solves several variants of node location problem formlations.
|
Offline_tcfa_generalMultilayer |
Solves a general multilayer optimization problem formulation.
|
Offline_tcfa_wdmPhysicalDesign_graspAndILP |
This algorithm is devoted to solve the several network planning problems in an optical WDM network (fiber placement, RWA, under different recovery schemes), appearing in the case study in the book section mentioned below.
|
Offline_tcfa_xdeFormulationsMinLinkCost |
This algorithm gives access to several variants of full topology design problems.
|
Examples of offline network design algorithms, corresponding to case studies in this book.
Each algorithm Javadoc includes a brief explanation of its use, and a reference to the book section where a full description is provided.Copyright © 2018. All rights reserved.