Re: [Ospf-wireless-design] Design Team slides for IETF 63

Richard Ogier <rich.ogier@earthlink.net> Fri, 05 August 2005 20:46 UTC

Received: from localhost.localdomain ([127.0.0.1] helo=megatron.ietf.org) by megatron.ietf.org with esmtp (Exim 4.32) id 1E195F-0008L3-UK; Fri, 05 Aug 2005 16:46:25 -0400
Received: from odin.ietf.org ([132.151.1.176] helo=ietf.org) by megatron.ietf.org with esmtp (Exim 4.32) id 1E195E-0008Ky-L4 for ospf-wireless-design@megatron.ietf.org; Fri, 05 Aug 2005 16:46:24 -0400
Received: from ietf-mx.ietf.org (ietf-mx [132.151.6.1]) by ietf.org (8.9.1a/8.9.1a) with ESMTP id QAA03131 for <ospf-wireless-design@ietf.org>; Fri, 5 Aug 2005 16:46:22 -0400 (EDT)
Received: from pop-sarus.atl.sa.earthlink.net ([207.69.195.72]) by ietf-mx.ietf.org with esmtp (Exim 4.43) id 1E19cO-0002zE-La for ospf-wireless-design@ietf.org; Fri, 05 Aug 2005 17:20:41 -0400
Received: from dialup-4.246.30.239.dial1.sanjose1.level3.net ([4.246.30.239] helo=earthlink.net) by pop-sarus.atl.sa.earthlink.net with esmtp (Exim 3.36 #10) id 1E195B-0003KA-00; Fri, 05 Aug 2005 16:46:22 -0400
Message-ID: <42F3D01D.6050801@earthlink.net>
Date: Fri, 05 Aug 2005 13:46:21 -0700
From: Richard Ogier <rich.ogier@earthlink.net>
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:0.9.4) Gecko/20011128 Netscape6/6.2.1 (emach0202)
X-Accept-Language: en-us
MIME-Version: 1.0
To: "Henderson, Thomas R" <thomas.r.henderson@boeing.com>
Subject: Re: [Ospf-wireless-design] Design Team slides for IETF 63
References: <77F357662F8BFA4CA7074B0410171B6D512AC5@XCH-NW-5V1.nw.nos.boeing.com>
Content-Type: text/plain; charset="us-ascii"; format="flowed"
Content-Transfer-Encoding: 7bit
X-Spam-Score: 0.1 (/)
X-Scan-Signature: a87a9cdae4ac5d3fbeee75cd0026d632
Content-Transfer-Encoding: 7bit
Cc: ospf-wireless-design@ietf.org
X-BeenThere: ospf-wireless-design@lists.ietf.org
X-Mailman-Version: 2.1.5
Precedence: list
List-Id: OSPF Wireless Design Team <ospf-wireless-design.lists.ietf.org>
List-Unsubscribe: <https://www1.ietf.org/mailman/listinfo/ospf-wireless-design>, <mailto:ospf-wireless-design-request@lists.ietf.org?subject=unsubscribe>
List-Archive: <https://www1.ietf.org/mailman/private/ospf-wireless-design>
List-Post: <mailto:ospf-wireless-design@lists.ietf.org>
List-Help: <mailto:ospf-wireless-design-request@lists.ietf.org?subject=help>
List-Subscribe: <https://www1.ietf.org/mailman/listinfo/ospf-wireless-design>, <mailto:ospf-wireless-design-request@lists.ietf.org?subject=subscribe>
Sender: ospf-wireless-design-bounces@lists.ietf.org
Errors-To: ospf-wireless-design-bounces@lists.ietf.org

Since the recent discussion might have been a little confusing
(or unclear), I would like to summarize some of my points and
design principles.  First of all, the MDR solution uses 2-hop
neighbor information (actually information regarding interconnectivity
between 1-hop neighbors) from Hellos to select MDRs and decide which
neighbors should be adjacent. I think the use of such 2-hop neighbor
information from Hellos is desirable for a number of reasons.
First, when 2-hop neighbor information changes, it is learned
very quickly via differential Hellos (typically within 2 seconds).
The use of router-LSAs to convey 2-hop neighbor information
(or even non-local adjacency information) can result in
slower convergence and more overhead following a link failure.
For example, there can be delay of MinLSInterval before the
change is advertised in a new LSA.  Recall that we cannot
simply make MinLSInterval smaller in a dense, highly mobile
network, because this will greatly increase overhead!
Also, since Hellos can be differential, this allows
the Hello interval to be smaller, thus allowing a change
to be reported sooner (e.g., within 1 second).
That is why I like the design principal of advertising 2-hop
neighbor information in Hellos, and of using only this
information from Hellos in deciding which neighbors should be
adjacent.  (For example, I would prefer not to use LSAs to
indicate which neighbors are adjacent, if a variation of
smart peering is used.)

One might argue that using only 2-hop neighbor information from
Hellos can increase the number of MDRs and the number of
adjacencies. It may indeed result in a few more adjacencies
and MDRs, but it will also improve robustness and convergence
following topology changes.

Richard





Henderson, Thomas R wrote:

> 
>
>>-----Original Message-----
>>From: Richard Ogier [mailto:rich.ogier@earthlink.net] 
>>Sent: Thursday, August 04, 2005 6:40 PM
>>To: Henderson, Thomas R
>>Cc: ospf-wireless-design@ietf.org
>>Subject: Re: [Ospf-wireless-design] Design Team slides for IETF 63
>>
>>
>>I would like to comment on the smart peering approach, 
>>studied in Section 4.5 of the report.
>>I agree that "smart peering" has a circular dependency 
>>problem if non-adjacent neighbors are included in LSAs.
>>(A simple 4-node example can be constructed to show this.)
>>
>>To avoid this problem, I considered a variation in which each 
>>router lists its adjacent neighbors in a new Hello TLV.
>>Then the router can avoid forming an adjacency with a 
>>neighbor if there already exists a path of adjacencies from 
>>the router to that neighbor based on the adjacency 
>>information obtained from Hellos.  
>>
>
>I think that this may improve the performance, but one challenge that
>remains is that it is not clear whether the loss of an adjacency
>somewhere causes nodes to have to reconsider their previous decisions to
>defer forming adjacencies with their neighbors.  If the degree of the
>node is not high, however, it probably will not be burdensome to revisit
>these decisions when this Hello TLV changes.  But since the adjacency
>decisions are just being made on this localized information, it will
>probably drive up the number of adjacencies.
>
>>This can be used in 
>>conjunction with the MDR extension, so that a router selects 
>>adjacent neighbors as before except that it avoids forming an 
>>adjacency with a neighbor if there already exists a path of 
>>adjacencies to that neighbor.
>>An adjacent neighbor still remains adjacent only as long as 
>>either the router or the neighbor is a (Backup) MDR, so that 
>>adjacencies are still aligned with (Backup) MDRs.
>>This will reduce the number of adjacencies (at least a 
>>little), but I have not run simulations to determine how this 
>>affects performance.
>>
>
>This explanation wasn't completely clear to me.  Are you suggesting that
>the DR-other nodes would then tend to form only one adjacency to the
>backbone in this case?
>
>If one suppresses adjacencies between DR-other neighbors, then one might
>expect that these synchronized DR-other neighbors are often two hops
>away from one another (adjacent to the same (Backup) MDR).  But it is
>not guaranteed; in a dense network, they may have become adjacent to
>(Backup) MDRs that are not topologically close.  In this case, your
>suggestion to include adjacency info in the Hellos might help avoid
>"synchronized" neighbors with long adjacency paths between them, but I
>am not sure that it is going to be worth it-- I am not sure that such
>scenarios are common (plus, again, it might cause more adjacencies). 
>
>Tom
>



_______________________________________________
Ospf-wireless-design mailing list
Ospf-wireless-design@lists.ietf.org
https://www1.ietf.org/mailman/listinfo/ospf-wireless-design