Algorithms which reacts to time-variations on traffic demand volumes
| Example name | Description |
|---|---|
| TVSim_AA_basicTrafficAllocationAlgorithm.java | Allocate demands over existing routes Keywords: None This algorithm allocates the traffic over the existing routes. Link over-subscription may happen. |
| TVSim_AA_WDM_basicTrafficAllocationAlgorithm.java | Adjust dynamically the number of lightpaths of end-to-end lightpath demands Keywords: WDM At each time interval, this algorithm adjusts dynamically the number of lightpaths for each demand with respect to the ones in the previous period. In case that new lightpaths are required, it performs an RWA using first-fit (wavelength continuity is enforced) over a set of precomputed k-shortest paths (maximum path length in km equal to maxLightpathLengthInKm). These paths are evaluated in order. Once a feasible RWA is found, then the lightpath is allocated, and no other candidate solution is checked. |
