Hi everybody, I am student from the University of Trento in Italy. I am
preparing my master thesis with the goal of extending Babel in order to
perform a distributed algorithm for the computation of betweenness
centrality. I would like to know if there is someone that could help me in
understanding
Hi Lorenzo,
> Is this the right place where to ask?
Yes.
> how to get the routing table entry matching a given prefix...
You must iterate over all the routing entries with "route streams" and search
the one you want (or write your own function). For example:
struct babel_route *rt = NULL
Hi Juliusz,
Thank you very much for your response.
* I am aware that babel 1.8 is not stable yet.
It's stable -- I just need to take the time to do a release.
Great to hear! :) I have not seen any weird behavior in my tests with
a small amount of nodes.
> As Babel 1.8 will be incompatible
Thank you Matthieu! Precise and super fast answer :)
2016-11-21 18:07 GMT+01:00 Matthieu Boutier <
bout...@pps.univ-paris-diderot.fr>:
> Hi Lorenzo,
>
> > Is this the right place where to ask?
>
> Yes.
>
> > how to get the routing table entry matching a given prefix...
>
> You must iterate over a
>>> As Babel 1.8 will be incompatible to 1.7
>> Babeld 1.8 will be fully compatible with 1.7.
> This is also great to hear, I took this from the changelog that is
> mentioning incompatible changes.
Incompatible to changes to the administrative interface, not to the
protocol.
> At a later stage
5 matches
Mail list logo