All paths between two devices

3 views
Skip to first unread message

Hassan

unread,
Aug 3, 2016, 11:15:58 AM8/3/16
to ONOS Developers
Hello,

Can anyone guide me how I can get all available paths between two devices ? I tried getPaths() but it returns the set of shortest paths, not all available paths.

Thanks

satish karunanithi

unread,
Aug 8, 2016, 5:51:46 AM8/8/16
to Hassan, ONOS Developers
Hi Hassan,

Currently you get only the shortest paths.

Check if customizing the LinkWeight parameter to getPaths() helps you in your application.

Regards,
Satish.



--
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+unsubscribe@onosproject.org.
To post to this group, send email to onos...@onosproject.org.
Visit this group at https://groups.google.com/a/onosproject.org/group/onos-dev/.
To view this discussion on the web visit https://groups.google.com/a/onosproject.org/d/msgid/onos-dev/813a98ef-2957-4eae-b357-6e777a7d7d27%40onosproject.org.

Hassan Chand

unread,
Aug 8, 2016, 7:53:44 AM8/8/16
to satish karunanithi, ONOS Developers
Hi Satish,

Thanks a lot for your response.

Regards
Hassan

Sofiane MESSAOUDI

unread,
Mar 9, 2022, 8:59:53 AM3/9/22
to ONOS Developers, hassan....@gmail.com, ONOS Developers, satish.ka...@gmail.com
Hello, 

I'm trying to do the same thing and i don't know which class or parameter to be changed could you help me please if you got the solution for that?

thanks,
Sofiane

Le lundi 8 août 2016 à 13:53:47 UTC+2, hassan....@gmail.com a écrit :
Hi Satish,

Thanks a lot for your response.

Regards
Hassan
2016-08-08 11:51 GMT+02:00 satish karunanithi <satish.ka...@gmail.com>:
Hi Hassan,

Currently you get only the shortest paths.

Check if customizing the LinkWeight parameter to getPaths() helps you in your application.

Regards,
Satish.

On Wed, Aug 3, 2016 at 8:45 PM, Hassan <hassan....@gmail.com> wrote:
Hello,

Can anyone guide me how I can get all available paths between two devices ? I tried getPaths() but it returns the set of shortest paths, not all available paths.

Thanks

--
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...@onosproject.org.

Sofiane MESSAOUDI

unread,
Mar 9, 2022, 9:59:10 AM3/9/22
to ONOS Developers
Hello,

Can anyone guide me how I can get all available paths between two devices ? I tried getPaths() but it returns the set of shortest paths, not all available paths. 

So i know that i should customize the onos java classes related to that but i can't find which class or parameter to changer exactly !!! 

Thanks

Sofiane

Hadi Kahraman

unread,
Mar 9, 2022, 10:53:58 AM3/9/22
to ONOS Developers
ONOS path computation is based on Dijkstra algorithm, which computes the "shortest" (minimum total "cost") path only:

DijkstraGraphSearch.java

Five years ago we (Argela) developed a modified algorithm calculating best N paths based on multi-parameter cost computation functions. It was a military project, therefore I cannot share the code.

If someone else didn't add similar functionality to ONOS -which I don't know-, then you need to develop your own.

There is a KShortestPathsSearch class in ONOS, but it didn't work as expected. Maybe we were doing something wrong. Maybe it was fixed later. You can check it.

Sofiane MESSAOUDI <sofianem...@gmail.com>, 9 Mar 2022 Çar, 17:59 tarihinde şunu yazdı:
--
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...@onosproject.org.

Sofiane MESSAOUDI

unread,
Mar 9, 2022, 11:08:59 AM3/9/22
to ONOS Developers, hadi.k...@gmail.com
Thank a lot hadi,

But i don't need any cost computation algorithm, i just need to return all the available paths between host 1 and host 2 or device i and device j, that's all and i don't know what to do!or to change in DijkstraGraphSearch.java for example.

Regards,
Sofiane

Eder Ollora

unread,
Mar 9, 2022, 4:29:09 PM3/9/22
to ONOS Developers, sofianem...@gmail.com, hadi.k...@gmail.com
Hi Sofiane,

I imagine that the reason why there is no pathService.getAllPossiblePaths(Node_a, Node_b) is because it is very hard to compute (here some info on why). I do not remember how the LinkWeigher works in ONOS but in case this variable is used to return paths that match a particular metric, then why not use it?. I probably cannot give an extended explanation about it but you can ask question if you decide to test it.

The way to use the LinkWeigher is briefly explained by Pier here: https://groups.google.com/a/onosproject.org/g/onos-dev/c/38IL1y3-TmY

Cheers
Reply all
Reply to author
Forward
0 new messages