[Olsr-users] 回复： when is the topology stable?

[Henning Rogge]

Hi,

the DIjkstra-Algorithm is pretty cheap in terms of CPU power.

Henning

On Thu, Mar 13, 2014 at 12:05 PM, 李茂 <(spam-protected)> wrote:
> Thanks a lot.
> A node knows the whole topology by getting the TC messages.The time that all
> TC messages arrive a same node is different,meaning that a node always
> receives TC messages,so the topology always changes.If the route caculation
> is depend on the current topology,then a node caculate the route all the
> time.This will lead to a big cost.if the algorithm caculate the route by the
> convergence topology,not current topology,this may be better.
>
>
>
> ------------------ 原始邮件 ------------------
> 发件人: "Henning Rogge";<(spam-protected)>;
> 发送时间: 2014年3月13日(星期四) 晚上6:37
> 收件人: "李茂"<(spam-protected)>;
> 抄送: "Olsr-users"<(spam-protected)>;
> 主题: Re: [Olsr-users] when is the topology stable?
>
> It does not.
>
> The routing daemon calculates the routes based on the current topology
> data. When new data arrives, the routes are recalculated.
>
> Henning Rogge
>
> On Thu, Mar 13, 2014 at 9:11 AM, 李茂 <(spam-protected)> wrote:
>> we all know the route calculate by the topology.the algorithm should get
>> the
>> stable topology ,then calculate the route.I want to know how the algorithm
>> know it has got a stable topology?whether is there a flag that indicate
>> tolopogy has been stable?please help,thanks.
>> --
>> Olsr-users mailing list
>> (spam-protected)
>> https://lists.olsr.org/mailman/listinfo/olsr-users