Hi Ali,
I found your email address at the openflow-wiki-mpls-te-demo site, sorry for
taking the liberty to disturb you.
In the src/nox/coreapps/mpls/cspf.cc file, function find_route() tries to find
a shortest path with Dijkstra algorithm which meets bandwidth and priority
constraints of a tunnel, and calls handle_link_change() handler if link event
occurs. As we know, Dijkstra is a static single source algorithm, and should be
re-called to re-calculate out a new shortest path when link updates, while
handle_link_change() adopts a dynamically all pairs shortest path(apsp)
algorithm, with the maintained data structure by apsp, we can get the minimum
distance and shortest path within constant time. So I am puzzled over why cspf
used a mixture of both static and dynamic routing algorithms, instead of solely
using multiple Dijkstra or apsp? Or I misunderstand something, please correct
me and help me getting out of the mess.
Thank you very much and waiting for your reply.
Best regards.
_______________________________________________
openflow-discuss mailing list
openflow-discuss@lists.stanford.edu
https://mailman.stanford.edu/mailman/listinfo/openflow-discuss
