Need Java Implementation of Dijkstra’s Algorithm for Dynamic Routing in ONOS

[harshith v]

Hi everyone,

I’m currently working with ONOS and exploring dynamic routing. I was wondering if anyone has a Java implementation of Dijkstra’s algorithm integrated with ONOS for path computation or dynamic route updates.

Any sample code, GitHub references, or guidance would be really helpful.
Thanks in advance!

Regards,
Harshith

[Eder Ollora]

Hi harshith v,

I have searched GitHub: https://github.com/search?q=ONOS%20Dijkstra&type=repositories

and IEEE explore: https://ieeexplore.ieee.org/document/8988853/

They are the same (I believe), but it is in Python, as I can see from their GitHub README.

Also, this: https://github.com/maciej-L-20/european_sdn_experiments. I believe in Python, too.

You can find out about Dijkstra's algorithm here: https://groups.google.com/a/opennetworking.org/g/onos-dev/search?q=dijkstra

If you cannot find it there, we can help you more.

Cheers

--
You received this message because you are subscribed to the Google Groups "ONOS Developers" group.
To unsubscribe from this group and stop receiving emails from it, send an email to onos-dev+u...@opennetworking.org.
To view this discussion visit https://groups.google.com/a/opennetworking.org/d/msgid/onos-dev/b41b9fd5-e945-4608-868f-6e55f3f6e21cn%40opennetworking.org.
For more options, visit https://groups.google.com/a/opennetworking.org/d/optout.