Subject: [CCAMP] algorithm for cspf

From: vijayanand c <[email-masked]>
Date: Fri, 12 Apr 2019 07:33:35 +0000

hi all,
I have a question.

I would like to know what algorithm is recommended for path computation across WDM network. Will it be a modified version of dijkstra - with one run to check for optical constraints at every hop and find shortest path by metric , or the K-th shortest path algorithm to continuously explore many paths and check optical constraints( such as wavelength continuity, ROADM directionality constraint etc) on each of the paths one by one

Please give your suggestions/experience.

Regards
Vijay