point to point intent (traffic flow)

[Ashwini]

Hi All,
If i have two point to point intent that is i have two path from source to destination.one which is shortest path(path with only one node in between) and other is another path(path with two node in between) so in this case which path should traffic follow??

in my case it is follwoing 1st path(shortest based on number of hopes)
note:please let me know where i can find code for this.

Regards,
Ashwini Mhatre

[Thomas Vachuska]

Hi,

I’m not sure I fully follow the question. The HostToHostIntent and PointToPointIntent compilers use the PathService and/or TopologyService (implemented by PathManager and TopologyManager, respectively) to compute the paths. This in turn uses the DijkstraGraphSearch, which is an variant of Dijkstra shortest path search, capable of computing all shortest paths between given src/dst and which allows specifying custom edge-weight function. Negative weights (since they have no meaning to the Dijkstra path-search algorithm) are interpreted as indicators of non-traversable edges.

If you search the project for the above classes, you will be able to find the code.

Thomas

--
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.
To post to this group, send email to onos...@onosproject.org.
Visit this group at http://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/ef8b417a-aa2f-4a67-be18-2d1db6065523%40onosproject.org.