Project Details:

Input: us backbone topology which consists of $24$ nodes an edges is given as input. The input file contains adjace bandwidth, delay, and reliability matrices. The relation between each node in these matrices is separated by $"$:$".$ matrix is separated by an empty row.

In the neighborhood matrix, link distances are unifc distributed between $1$ and $5.$

The bandwidth matrix uniform distribution is between $310.$

The delay matrix is uniformly distributed between $1$ and

The reliability matrix is between $0\mathrm{.}95$ and $0\mathrm{.}99.$

Request: A request will have source node id$,$ destination id$,$ and bandwidth requirement information.

Solution: The function, called Solution, will take the txt file and the defined request. With the information take parameters, it is desired to find the shortest path between points $($source and destination$)$ by satisfying the follc constraints.

You have to do the requirement. When you add delay and reliabi constraints to the solution, you can get additional points.

Constraints: The solution must be within the range of specified constraints.

Bandwidth demand must be $5.($required$)$

Delay threshold must be less than $40.($extra $5$ poin

Reliability threshold must be greater than $0\mathrm{.}70.(5$ points$)$

Algorithm: Three of the following algorithms must be use solve the problem.

Dijkstra Algorithm

Bellman$-$Ford Algorithm

$A**$ Algorithm

Flody$-$Warshall Algorithm

Additional points will be awarded for solving the problem with of the meta$-$heuristic algorithms specified. $($extra $10$ points$)$

Simulated Annealing Algorithm

Tabu Search Algorithm

Ant Colony Algorithm

Bee Colony Algorithm

Firefly Algorithm