A Greedy Algorithm is a simple heuristic strategy used for solving optimization problems. In these algorithms, at each step, the best possible choice is made without considering the future consequences. Greedy algorithms build up a solution piece by piece, always choosing the locally optimal solution at each stage with the hope of finding a global optimum.

Posts

Optical Network Anomaly Detection and Localization Based on Forward Transmission Sensing and Route Optimization

/in /by

We introduce a novel scheme to detect and localize optical network anomaly using forward transmission sensing, and develop a heuristic algorithm to optimize the route selection. The performance is verified via simulations and network experiments.

Read more