arunsy <arunsarat@REDIFFMAIL.COM> Wed, 20 August 2003 09:11 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 FAA00231 for <ospf-archive@LISTS.IETF.ORG>; Wed, 20 Aug 2003 05:11:42 -0400 (EDT)
Received: from PEAR.EASE.LSOFT.COM (209.119.0.19) by cherry.ease.lsoft.com (LSMTP for Digital Unix v1.1b) with SMTP id <7.00AEFDCB@cherry.ease.lsoft.com>; Wed, 20 Aug 2003 5:11:45 -0400
Received: from PEACH.EASE.LSOFT.COM by PEACH.EASE.LSOFT.COM (LISTSERV-TCP/IP release 1.8e) with spool id 51739740 for OSPF@PEACH.EASE.LSOFT.COM; Wed, 20 Aug 2003 05:11:43 -0400
Received: from 202.54.124.179 by WALNUT.EASE.LSOFT.COM (SMTPL release 1.0i) with TCP; Wed, 20 Aug 2003 05:11:43 -0400
Received: (qmail 9204 invoked by uid 510); 20 Aug 2003 09:10:00 -0000
Received: from unknown (203.197.138.199) by rediffmail.com via HTTP; 20 aug 2003 09:10:00 -0000
MIME-Version: 1.0
Content-type: text/plain; format="flowed"
Content-Disposition: inline
Message-ID: <20030820091000.9203.qmail@webmail10.rediffmail.com>
Date: Wed, 20 Aug 2003 09:10:00 -0000
Reply-To: Mailing List <OSPF@PEACH.EASE.LSOFT.COM>
Sender: Mailing List <OSPF@PEACH.EASE.LSOFT.COM>
From: arunsy <arunsarat@REDIFFMAIL.COM>
To: OSPF@PEACH.EASE.LSOFT.COM
Precedence: list

Hi all,
Would someone be able to explain the following clause in RFC 2328
section 16.5 (Incremental Updates -- Summary LSAs) Case 2 (Area A
is a transit area and the router is an ABR).

Case 2: Area A is a transit area and the router is an area
            border router.
            In this case, the following calculations must be
performed.
            First, if N's routing table entry presently contains one
or
            more inter-area paths that utilize the transit area Area
A,
            these paths should be removed. If this removes all paths
            from the routing table entry, the entry should be
            invalidated.  The entry's old values should be saved for
            later comparisons. Next the calculation in Section 16.3
must
            be run again for the single destination N. If the results
of
            this calculation have caused the cost to N to increase,
the
            complete routing table calculation must be rerun starting
            with the Dijkstra algorithm specified in Section 16.1.
            Otherwise, if the cost/path to an AS boundary router (as
            would be the case for a Type 4 summary-LSA) or to any
            forwarding addresses has changed, all AS-external-LSAs
will
             have to be reexamined by rerunning the calculation
in
            Section 16.4.  Otherwise, if N is now newly unreachable,
the
            calculation in Section 16.4 must be rerun for the single
            destination N, in case an alternate external route to N
            exists.

Why complete routing table calculation need to be rerun  if the
calculated new route has the higher cost than that of older one.
And how this behaviour is different from case 1?

And one more thing, how a router (ABR) knows whether the path of
the route is utilizing the transit area, since all the inter-area
routes in ABR are always associated with the Back Bone (even after
step 16.3).

Thanks and Regards,
ARun SY.