| Example name | Description |
|---|---|
| CACSim_AA_basicAlgorithm.java | CAC algorithm based on shortest path routing Keywords: None Basic CAC algorithm which tries to route each connection request in the shortest path. Since it is an uncapacitated algorithm, links may become over-subscribed |
| CACSim_AA_capacitatedSP.java | CAC algorithm based on capacitated shortest path routing Keywords: None CAC algorithm which tries to route each connection request in the shortest path for which there is enough bandwidth. If no route satisfies this, the connection is blocked |
| CACSim_AA_WDM_basicAlgorithm.java | RWA-CAC algorithm based on k-shortest path routing Keywords: WDM This algorithm receives lightpath connection requests and releases. For each lightpath release, wavelength resources are liberated. For each lightpath request, it determines how many lightpaths are actually required. Then, it tries to allocate them over a set of precomputed k-shortest paths (maximum path length in km equal to maxLightpathLengthInKm) using first-fit wavelength assignment (wavelength continuity is enforced). |
The open-source network planner
