This module implements a distributed primal-decomposition-based gradient algorithm, for a coordinated adjustment of the routing in multiple domains (or cluster, or autonomous systems) in a network, so that domains do not need to exchange sensitive internal information, and minimize the average number of hops in the network.
Ths event processor is adapted to permit observing the algorithm performances under user-defined conditions,
including asynchronous distributed executions, where signaling can be affected by losses and/or delays, and/or measurement errors.
The time evolution of different metrics can be stored in output files, for later processing.
As an example, see the
MATLAB file used for generating the graph/s of the case study in the
using this algorithm.
To simulate a network with this module, use the