[j-nsp] Re: Faster OSPF DD Exchange

[AnupKumarT 70695]

I just suggested a method to make DD Exchange faster.

******************************************************************************************
 This email and its attachments contain confidential information from HUAWEI, which is intended only for the person or entity whose address is listed above. Any use of the information contained herein in any way (including, but not limited to, total or partial disclosure, reproduction, or dissemination) by persons other than the intended recipient(s) is prohibited. If you receive this e-mail in error, please notify the sender by phone or email immediately and delete it!
 *****************************************************************************************

----- Original Message -----
From: Hannes Gredler <hannes at juniper.net>
Date: Thursday, December 15, 2005 6:34 pm
Subject: Re: Faster OSPF DD Exchange

> Anup T wrote:
> > According to RFC 2328, we send 1 DD packet, wait till the ack is 
> seen 
> > and only then send the next DD pkt.  We can improve upon this. 
> The idea 
> > is to send N DD packets initially. Then, as and when an ack is 
> seen, 
> > send the next DD pkt.
> 
> anup,
> 
> rfc2328 has a pretty clear language on this:
> 
> 10.1.  Neighbor states
> 
>     [ ... ]
> 
>         Exchange
>             In this state the router is describing its entire 
> link state
>             database by sending Database Description packets to the
>             neighbor.  Each Database Description Packet has a DD
>             sequence number, and is explicitly acknowledged.  
> Only one
>             Database Description Packet is allowed outstanding at any
>             one time.
> 
>     [ ... ]
> 
> 
> may i ask you why you have asked this question to the juniper-nsp 
> list ?
> is there something wrong with our OSPF implementation that you 
> want to report ?
> 
> /hannes
>