Routing table calculation

Single metric: Shortest path algorithms like Dijkstra and its variants are used.

Multiple Metrics: The problem being NP-Complete, plynomial heuristics are developed:

  • Distributed polynomial method based on Lagrange relaxation for 2, 3 and 4 metrics;
  • Distributed dynamic programming;
  • Economic multi-Criteria Decision Analysis.

Webmaster: Ignacy Gawędzki