Re: Why recalculation from scratch?

Jing Shen <jshen@CAD.ZJU.EDU.CN> Thu, 15 August 2002 03:03 UTC

Received: from cherry.ease.lsoft.com (cherry.ease.lsoft.com [209.119.0.109]) by ietf.org (8.9.1a/8.9.1a) with ESMTP id XAA02402 for <ospf-archive@LISTS.IETF.ORG>; Wed, 14 Aug 2002 23:03:39 -0400 (EDT)
Received: from walnut (209.119.0.61) by cherry.ease.lsoft.com (LSMTP for Digital Unix v1.1b) with SMTP id <9.006D5797@cherry.ease.lsoft.com>; Wed, 14 Aug 2002 23:04:57 -0400
Received: from DISCUSS.MICROSOFT.COM by DISCUSS.MICROSOFT.COM (LISTSERV-TCP/IP release 1.8e) with spool id 108475 for OSPF@DISCUSS.MICROSOFT.COM; Wed, 14 Aug 2002 23:04:52 -0400
Received: from 209.119.0.100 by WALNUT.EASE.LSOFT.COM (SMTPL release 1.0f) with TCP; Wed, 14 Aug 2002 23:04:52 -0400
Received: from walnut (209.119.0.61) by cherry.ease.lsoft.com (LSMTP for Digital Unix v1.1b) with SMTP id <23.006D585D@cherry.ease.lsoft.com>; Wed, 14 Aug 2002 23:04:57 -0400
Message-ID: <OSPF%2002081423045241@DISCUSS.MICROSOFT.COM>
Date: Wed, 14 Aug 2002 23:04:52 -0400
Reply-To: Mailing List <OSPF@DISCUSS.MICROSOFT.COM>
Sender: Mailing List <OSPF@DISCUSS.MICROSOFT.COM>
From: Jing Shen <jshen@CAD.ZJU.EDU.CN>
Subject: Re: Why recalculation from scratch?
To: OSPF@DISCUSS.MICROSOFT.COM
Precedence: list

Bin Liu,

The first, router does not maintains all information as human does.
the second, each router computes its routing table on its view of network.
When state of some links varies, the logical view of network changes
and the shortest path tree of the graph may become a totally new one;
the third, as link state propagates by relaying hop by hop, it can not
be expected that every router update their routing table simulataneously,
so each time a new link state is received the routing table must be
recomputed
to guarantee the convergence.

Of course, in a network with thousands of prefix such computing need a lot
of
CPU time but it's just one of the key reasons. IMO, Route flapping and
looping is
the factors attracting more attention.

Cheers

Jing Shen